In Problems 41-56, construct a mathematical model in the form of a linear programming problem. (The answer in the back of the book for these application problems include the model.) Then solve the problem using the simplex method. Include an interpretation of any nonzero slack variables in the optimal solution. Advertising. A department store has up to $ 20 , 000 to spend on television advertising for a sale, All ads will be places with one television station. A 30 -second ad costs $ 1 , 000 on daytime TV and is viewed by 14 , 000 potential customers, $ 2 , 000 on prime-time TV and is viewed by 24 , 000 potential customers, and $ 1 , 500 on late-night TV and is viewed by 18 , 000 potential customers. The television station will not accept a total of more than 15 ads in all three time periods. How many ads should be placed in each time period in order to maximize the number of potential customers who will see the ads? How many potential customers will see the ads? (Ignore repeated viewings of the ad by the same potential customer.)
In Problems 41-56, construct a mathematical model in the form of a linear programming problem. (The answer in the back of the book for these application problems include the model.) Then solve the problem using the simplex method. Include an interpretation of any nonzero slack variables in the optimal solution. Advertising. A department store has up to $ 20 , 000 to spend on television advertising for a sale, All ads will be places with one television station. A 30 -second ad costs $ 1 , 000 on daytime TV and is viewed by 14 , 000 potential customers, $ 2 , 000 on prime-time TV and is viewed by 24 , 000 potential customers, and $ 1 , 500 on late-night TV and is viewed by 18 , 000 potential customers. The television station will not accept a total of more than 15 ads in all three time periods. How many ads should be placed in each time period in order to maximize the number of potential customers who will see the ads? How many potential customers will see the ads? (Ignore repeated viewings of the ad by the same potential customer.)
Solution Summary: The author explains the linear programming problem model, wherein a department store spends 20,000 on television advertisement.
In Problems 41-56, construct a mathematical model in the form of a linear programming problem. (The answer in the back of the book for these application problems include the model.) Then solve the problem using the simplex method. Include an interpretation of any nonzero slack variables in the optimal solution.
Advertising. A department store has up to
$
20
,
000
to spend on television advertising for a sale, All ads will be places with one television station. A
30
-second ad costs
$
1
,
000
on daytime TV and is viewed by
14
,
000
potential customers,
$
2
,
000
on prime-time TV and is viewed by
24
,
000
potential customers, and
$
1
,
500
on late-night TV and is viewed by
18
,
000
potential customers. The television station will not accept a total of more than
15
ads in all three time periods. How many ads should be placed in each time period in order to maximize the number of potential customers who will see the ads? How many potential customers will see the ads? (Ignore repeated viewings of the ad by the same potential customer.)
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY