Scribd
Upload
2 views

Assignment3_LP_with solution_

The document outlines an assignment on linear programming with multiple problems, including true/false statements, sensitivity analysis, and graphical methods. It covers various scenarios such as maximizing profit, advertising strategies, and formulating a nutritious meal plan while adhering to specific constraints. Each problem includes optimal solutions and explanations for changes in constraints or coefficients.

Uploaded by

??
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Assignment3_LP_with solution_

The document outlines an assignment on linear programming with multiple problems, including true/false statements, sensitivity analysis, and graphical methods. It covers various scenarios such as maximizing profit, advertising strategies, and formulating a nutritious meal plan while adhering to specific constraints. Each problem includes optimal solutions and explanations for changes in constraints or coefficients.

Uploaded by

??
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Assignment 3: Linear Programming

Due: 23:59 October 27 (Sunday), via Moodle

Problem 1 (True or False)


Answer whether each statement is True or False. If your answer is False, explain why the
statement is False.

1) The following objective function is incorrect for linear programming:


Maximize Profit = 10X2+ 5Y2, where X and Y are decision variables.

2) A redundant constraint has zero shadow price.

3) Decreasing an objective function coefficient of a linear programming problem may not


change the optimal solution.

4) Linear programs never have multiple optimal solutions.

5) Decreasing the right-hand side value of a constraint will always change the optimal
solution.

1) False: the objective function is not linear.


2) True
3) True
4) False. Can have multiple optimal solutions
5) False. A nonbinding constraint that has slack will not affect the optimal
solution.
Problem 2 (LP Sensitivity Report)
The questions are based on the following linear program and the Excel solver sensitivity report
below.

Maximize profit = 15X1 + 7X2


Subject to X1 + X2 ≤ 10
X1 ≤8
X1, X2 ≥ 0

a) What is the optimal solution, and what is the optimal profit?


b) Suppose the objective coefficient for X1 changes from 15 to 10, and the problem is resolved; then
what is the new optimal profit?
c) Suppose the right-hand side of constraint 2 decreases to 4, and the problem is resolved; then
what is the new optimal profit?
d) What is the maximum price you will pay to increase the right-hand side of constraint 1 by five
units (to 15)?

a. The optimal solution is X1 = 8, X2 = 2, profit = $134.


b. The new optimal profit = 8(10) + 2(7) = $94.
c. The new optimal profit=$134 - 8(4) = $102.
d. The maximum price = 5(7) = $35.
Problem 3 (Election Ad)
(Corner point method) A candidate for mayor in a small town has allocated $50,000 for last-minute
advertising in the days preceding the election. Two types of ads will be used: radio and television. Each
radio ad costs $400 and reaches an estimated 4,000 people. Each television ad costs $800 and reaches
an estimated 5,000 people. In planning the advertising campaign, the campaign manager would like to
reach as many people as possible, but she has stipulated that at least 10 ads of each type must be used.
Also, the number of radio ads must be at least the number of television ads. How many ads of each type
should be used? How many people will this reach? Formulate the linear programming problem using
the corner point solution method.
Solutions:

Let R = number of radio ads; T = number of TV ads.


Maximize exposure = 4,000R + 5,000T
Subject to: 400R + 800T  50,000 (budget)
R  10 (redundant)
T  10
RT
R, T  0 (non negative)
Optimal corner point R = 105, T = 10,
Audience = 4,000(105) + 5,000(10) = 470,000 people
Problem 4
(Graphical Method) Graphically solve the following problem:
Maximize profit = 8 𝑋1 + 5 𝑋2
Subject to
𝑋1 + 𝑋2 ≤ 10 (1)
𝑋1 ≤6 (2)
𝑋1 , 𝑋2 ≥ 0

a) What is the optimal solution?


b) Change the right-hand side of constraint (1) from 10 to 11 and resolve the problem. How much did
the profit change as a result of this?
c) Change the right-hand side of constraint (1) to 6 (instead of 10) and resolve the problem. How
much did the profit change as a result of this? Looking at the graph, what would happen to constraint
(2) if the right-hand-side value of the constraint (1) were to go below 6?
Solutions:

a. The feasible corner points and their profits are:


Feasible corner points Profit = 8X1 + 5X2
(0,0) 0
(6,0) 48
(6,4) 68
(0,10) 50

The optimal solution is X1 = 6, X2 = 4, profit = $68.

b. The feasible corner points and their profits are:


Feasible corner points Profit = 8X1 + 5X2
(0,0) 0
(6,0) 48
(6,5) 73
(0,11) 55
The new optimal solution is X1 = 6, X2 = 5, profit = $73. Profit increased by $5.

c. The feasible corner points and their profits are:


Feasible corner points Profit = 8X1 + 5X2
(0,0) 0
(6,0) 48
(0,6) 30

As a result of this change, the feasible region got smaller. Profit decreased by $20.

If the right hand side of constraint 1 goes below 6, the new optimal X2 will stay at 0, and optimal X1 will be smaller than 6.
In addition, the other constraint, X1 <=6, becomes redundant.
Problem 5 (College Mean Plan)
(Use Excel Solver) Kathy Roniger, campus dietitian for a small Idaho college, is responsible for
formulating a nutritious meal plan for students. For an evening meal, she feels that the following five
meal-content requirements should be met: (1) between 900 and 1,500 calories; (2) at least 4 miligrams
of iron; (3) no more than 50 grams of fat; (4) at least 26 grams of protein; and (5) no more than 50
grams of carbohydrates. On a particular day, Roniger’s food stock includes seven items that can be
prepared and served for supper to meet these requirements. The cost per pound for each food item
and the contribution to each of the five nutritional requirements are given in the table below.

Table of Food Values and Costs


Calories/ Iron Fat Protein Carbohydrates Cost/
Food item LB (MG/LB) (GM/LB) (GM/LB) (GM/LB) LB ($)
Milk 295 0.2 16 16 22 0.6
Ground meet 1216 0.2 96 81 0 2.35
Chicken 394 4.3 9 74 0 1.15
Fish 358 3.2 0.5 83 0 2.25
Beans 128 3.2 0.8 7 28 0.58
Spinach 118 14.1 1.4 14 19 1.17
Potatoes 279 2.2 0.5 8 63 0.33

What combination and amounts of food items will provide the nutrition Roniger requires at the least
total food cost?

(a) Formulate this as an LP problem, put it in Excel and use the Solver to solve it.

(b) What is the cost per meal?

(c) Generate the sensitivity report in excel and explain how would an increase in milk price by 10
cents/lb impact your decision.

(d) How much can you change the milk price before the optimal solution changes?

Solutions:
(a) Minimize total cost = $0.60X1 + 2.35X2 + 1.15X3 + 2.25X4 + 0.58X5 + 1.17X6 + 0.33X7
subject to
295X1 + 1,216X2 + 394X3 +358X4 + 128X5+ 118X6 + 279X7  1,500
295X1 + 1,216X2 + 394X3 +358X4 + 128X5+ 118X6 + 279X7  900
.2X1 + .2X2 + .4.3X3 + 3.2X4 + 3.2X5 + 14.1X6 + 2.2X7  4
16X1 + 96X2 + 9X3 + 0.5X4 + 0.8X5+ 1.4X6 + 0.5X7  50
16X1 + 81X2 + 74X3 + 83X4 + 7X5+ 14X6 + 8X7  26
22X1 + 28X5 + 19X6 + 63X7  50
All Xi  0
Solutions from computer:
The meal plan for the evening is
No milk (X1 = 0)
0.499 pound of ground meat (X2)
0.173 pound of chicken (X3)
No fish (X4 = 0)
No beans (X5 = 0)
0.105 pound of spinach (X6)
0.762 pound of white potatoes (X7)
(b) Each meal has a cost of $1.75.
(c) Milk increases 10 cents/lb: no change in price or diet.
(d) Decrease the coefficient by $0.14

You might also like