A department store chain has up to $22,000 to spend on television advertising for a sale. All ads will be placed with one television​ station, where 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 by24,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.) Include an interpretation of any nonzero slack variables in the optimal solution.   Select the correct choice below and fill in any answer boxes present in your choice.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
A department store chain has up to $22,000 to spend on television advertising for a sale. All ads will be placed with one television​ station, where 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 by24,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.) Include an interpretation of any nonzero slack variables in the optimal solution.
 
Select the correct choice below and fill in any answer boxes present in your choice.
A department store chain has up to $22,000 to spend on television advertising for a sale. All ads will be placed with one television station, where 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.) Include an interpretation of any nonzero
slack variables in the optimal solution.
Select the correct choice below and fill in any answer boxes present in your choice.
O A. The maximum number of potential customers who see the ads is
people when
daytime ads.
prime-time ads, and
late-night ads are placed.
O B. There is no way to maximize the number of potential customers.
Include an interpretation of any nonzero slack variables in the optimal solution.
O A. In this case, s, = 4,000 dollars not used and s, = 10 ads not used.
O B. In this case, s, = 10 dollars not used.
O C. In this case, s, = 4,000 ads not used.
O D. There are no nonzero slack variables in the optimal solution.
Transcribed Image Text:A department store chain has up to $22,000 to spend on television advertising for a sale. All ads will be placed with one television station, where 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.) Include an interpretation of any nonzero slack variables in the optimal solution. Select the correct choice below and fill in any answer boxes present in your choice. O A. The maximum number of potential customers who see the ads is people when daytime ads. prime-time ads, and late-night ads are placed. O B. There is no way to maximize the number of potential customers. Include an interpretation of any nonzero slack variables in the optimal solution. O A. In this case, s, = 4,000 dollars not used and s, = 10 ads not used. O B. In this case, s, = 10 dollars not used. O C. In this case, s, = 4,000 ads not used. O D. There are no nonzero slack variables in the optimal solution.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 10 steps with 1 images

Blurred answer
Knowledge Booster
Optimization
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,