Question

In: Statistics and Probability

Below is a Linear Programming problem scenario and algebraic formulation. Review the scenario and identify what...

Below is a Linear Programming problem scenario and algebraic formulation. Review the scenario and identify what if any errors there are in the algebraic formulation. Select all that apply.  

Sage Lorimer runs a small chain of jewelry boutiques. She has hired a Marketing Intern to help choose the number and types of advertising that should be used to promote the stores. The table below shows the types of advertising available over the next month and the unit cost. Sage wants to ensure the largest number of people see the ads. The total advertising budget is $75,000.   

Advertisement Type

Exposure (people/Ad)

Cost

($/Ad)

Ad Bookings Available

Online Media Ad

8,000

$1,000

unlimited

Newspaper Ad

10,000

$3,000

15 ads

Radio Ad

15,000

$4,000

10 ads

Television Ad

30,000

$8,000

5 ads

Algebraic LP Problem Formulation:

Let Xi = the # of Ads of Type i to buy with i = {1 for Online Media, 2 for Newspaper Ads, 3 for Radio Ads, and 4 for Television Ads}

Z = $8,000X1 + $10,000X2 + $15,000X3 + $30,000X4    

Subject To:

1,000X1 + 3,000X2 + 4,000X3 + 8,000X4

≤ 75,000

Ad Budget Constraint

X2

≤ 15 ads

Newspaper Ad Supply Constraint

X3  

≤ 10 ads

Radio Ad Supply Constraint

X4  

≤ 5 ads

TV Ad Supply Constraint

X1 + X2 + X3 + X4

≥ 0

X1 , X2 , X3 , and X4

Integer values

Integer Constraints

Do NOT attempt to solve this linear program.

Select one or more:

a. Integer constraints not needed.

b. Constraint label(s) missing

c. Missing Non-negativity constraints

d. Objective Function has the wrong units of measure

e. Constraint Right Hand Sides missing units of measure

f. Constraint Right Hand Sides should be constraint coefficients

g. Variable limit constraints not needed

h. Constraint labels are not sufficiently descriptive

i. Maximize vs. Minimize not stated

Please help me ASAP, because I need it before 2PM . Thank you all.

Solutions

Expert Solution

formula:

steps:data->solver

is the output

maximum profit=600000

X1=75,X2=0,X3=0,X4=0

Also,Ad budget=75000

Newspaper ad supply=0

Radio Ad supply=0

TV Ad supply=0

constraint=75

please rate my answer and comment for doubts.


Related Solutions

Below is the linear programming for the Shortest Path Problem. Considering the second contraint in the...
Below is the linear programming for the Shortest Path Problem. Considering the second contraint in the mathematical model : ∑ixji−∑ixij=0∀j≠s,j≠t What is the logic behind this contraint? To make sure there is only one solution To make sure that the path is connected between the nodes To make sure the variable stays binary This contraint is redundant and not necessary Which of the following statements are true? (select all that apply) The shape of a student t-distribution curve depends on...
Below is the linear programming for the Shortest Path Problem. Considering the second contraint in the...
Below is the linear programming for the Shortest Path Problem. Considering the second contraint in the mathematical model : ∑ixji−∑ixij=0∀j≠s,j≠t What is the logic behind this contraint? To make sure there is only one solution To make sure that the path is connected between the nodes To make sure the variable stays binary This contraint is redundant and not necessary Which of the following statements are true? (select all that apply) The shape of a student t-distribution curve depends on...
Question 3 Below is the linear programming for the Shortest Path Problem. Considering the second contraint...
Question 3 Below is the linear programming for the Shortest Path Problem. Considering the second contraint in the mathematical model : ∑ i x ji −∑ i x ij =0∀j≠s,j≠t What is the logic behind this contraint? 1) To make sure there is only one solution 2) To make sure that the path is connected between the nodes 3) To make sure the variable stays binary 4) This contraint is redundant and not necessary Question 4 Which of the following...
What is the difference between the optimal solution to a linear programming problem and the objective...
What is the difference between the optimal solution to a linear programming problem and the objective function value at the optimal solution? Use an example in your explanation
What is Linear Programming? Give an example of an application of Linear
What is Linear Programming? Give an example of an application of Linear
Every linear programming problem involves optimizing a: Select one: a. linear function subject to several linear...
Every linear programming problem involves optimizing a: Select one: a. linear function subject to several linear constraints b. linear regression model subject to several linear constraints c. linear function subject to several non-linear constraints d. non-linear function subject to several linear constraints
Consider the following transportation problem. Formulate this problem as a linear programming model and solve it...
Consider the following transportation problem. Formulate this problem as a linear programming model and solve it using the MS Excel Solver tool. Shipment Costs ($), Supply, and Demand: Destinations Sources 1 2 3 Supply A 6 9 100 130 B 12 3 5 70 C 4 8 11 100 Demand 80 110 60 (4 points) Volume Shipped from Source A __________ (4 points) Volume Shipped from Source B __________ (4 points) Volume Shipped from Source C __________ (3 points) Minimum...
The optimal solution of the linear programming problem is at the intersection of constraints 1 and...
The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Please answer the following questions by using graphical sensitivity analysis. Max s.t. Max 2x1 + x2 s.t. 4x1 +1x2 ≤8 4x1 +3x2 ≤12 1x1 +2x2 ≤6 x1 , x2 ≥ 0 Over what range can the coefficient of x1 vary before the current solution is no longer optimal? Over what range can the coefficient of x2 vary before the current solution is no...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that     ...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that      x1+ 2x2 ≤ 12          x2 ≥ 3       x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z
Non-negativity is always present in a linear programming problem. A) True B) False In all linear...
Non-negativity is always present in a linear programming problem. A) True B) False In all linear programming problems, the maximization or minimization of some quantity is the objective. A) True B) False All linear programming problems have at least one feasible solution. A) True B) False The point (0,0) is always part of the feasible region. A) True B) False The optimal solution for a linear programming problem occurs when the objective function intersects with at least one of the...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT