Question

In: Statistics and Probability

Consider the following linear program Max 3A + 2B St 1A + 1B <= 10 3A...

Consider the following linear program
Max 3A + 2B
St
1A + 1B <= 10
3A + 1B <= 24
1A + 2B <= 16
A, B >= 0
The value of the optimal solution is 27. Suppose that the right hand side for constraint one is increased from 10 to 11.

a) Use the graphical solution procedure to find the new optimal solution.
b) Use the solution to part A to determine the shadow price for constraint 1
C) The sensitivity report for the linear programming problem one provides the following right hand range information

Constraint      Constraint      Allowable    Allowable
                        R H Side.        Increase.     Decrease
1.                        10,000.          1,200.           2,000
2.                        24,000.         6.000.          6,000
3.                        16,000.          Infinite.        3,000

What does the right hand side range information for constraint one tell you about the shadow price for constraint one

D) The shadow price for constraint 2 is 0.5 using this shadow price and right hand side range information and parts c what conclusion can you draw about the effect of changes to the right hand side of constraint 2

Solutions

Expert Solution

a)

Since the objective function line will pass through point C at last in the bounded solution. The value will lie at point C such that at the intersection point of lines x1 + x2 = 11 and 3x1 + x2 = 24.

Solving for the intersection point of these two lines,

x1 = 6.5 and x2 = 4.5

objection function value is;

z = 3(6.5) + 2(4.5) = 28.5

b)

Shadow price for constraint 1 = new objective function value - old objective function value

Shadow price for constraint 1 = 28.5 - 27 = 1.5

c)

The allowable increase for the constraint 1 = 1.2 and the allowable decrease for the constraint 1 = 2

Within this allowable range, the optimal solution will not change such that we can change the right-side value within this range and the objection function value will increase or decrease by shadow price multiplied by the change in the right-hand side value.

d)

Constraint 2:

Right-hand side value = 24

Allowable increase = 6

Allowable decrease = 6

Shadow price = 0.5

For 6 unit increase in the RH side value, the objective function value will increase by 0.5*6 =3

For 6 unit decrease in the RH side value, the objective function value will decrease by 0.5*6 =3


Related Solutions

Given the linear program Max 3A + 4B s.t. -1A + 2B ≤ 8 1A +...
Given the linear program Max 3A + 4B s.t. -1A + 2B ≤ 8 1A + 2B ≤ 12 2A + 1B ≤ 16 A, B ≥ 0 (a) Write the problem in standard form. For those boxes in which you must enter subtractive or negative numbers use a minus sign. (Example: -300) - Select your answer -MaxMinItem 1 A + B + S1 + S2 + S3 s.t. A + B + S1 - Select your answer -≥≤=Item 10...
44. Consider the following linear program Max 1a+1b s.t. 5a+3b<15 3a+5b,<15 a,b >0 A. What is...
44. Consider the following linear program Max 1a+1b s.t. 5a+3b<15 3a+5b,<15 a,b >0 A. What is the optimal solution for this problem? B. Suppose that the objective function is changed to 1a+2b. Find the new optimal solution. I am using excel for this homework question so I need the formulas to help not just the answers and I also trying to figure desmos to graph the question.
Ch 2: Linear Programming Max 6A + 4B ST 2A + 1B <= 12 1A +...
Ch 2: Linear Programming Max 6A + 4B ST 2A + 1B <= 12 1A + 1B <= 10 1A <= 4 A, B >= 0 Solve the above model using Excel Solver. Write down the optimal solution value and values for each decision variable (i.e. variable ‘A’ and ‘B’). Write down the slack for each constraint Which constraints are binding constraints?
Consider the following linear program: Max 4A + 6B s.t. 9A + 3B ≥ 20 3A...
Consider the following linear program: Max 4A + 6B s.t. 9A + 3B ≥ 20 3A + 5B ≤ 15 2A ≤ 6 A, B ≥ 0
Solve the following linear program using the graphical solution procedure. Max 5A + 5B s.t 1A...
Solve the following linear program using the graphical solution procedure. Max 5A + 5B s.t 1A <100 1B<80 2A+4B<400 A,B>0
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A +...
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A + 15B ≤ 300    8A + 7B ≤ 168 10A + 14B ≤ 280    Solve this linear program graphically and determine the optimal quantities of A, B, and the    value of Z. Show the optimal area.
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A + 15B ≤...
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A + 15B ≤ 300    8A + 7B ≤ 168   10A + 14B ≤ 280    Solve this linear program graphically and determine the optimal quantities of A, B, and the    value of Z. Show the optimal area.
1. Consider the following linear program, where a and b are real-valued constants: max: x +...
1. Consider the following linear program, where a and b are real-valued constants: max: x + y; ax + by ≤ 1; x ≥ 0; y ≥ 0; A) Suppose a < 0 and b < 0. Which one of these statements is true? Group of answer choices i) The linear program has a finite feasible region ii) The linear program has an empty feasible region iii) The feasible region is infinite, but there is an optimal solution iv) The...
1. Consider the following linear program, where a and b are real-valued constants: max: x +...
1. Consider the following linear program, where a and b are real-valued constants: max: x + y; ax + by ≤ 1; x ≥ 0; y ≥ 0; A) Suppose a > 0 and b > 0. Which one of these statements is true? a) The linear program has a finite feasible region b) The linear program has an empty feasible region c) The feasible region is infinite, but there is an optimal solution d) The feasible region is infinite,...
Consider the following all-integer linear program: Max x1 + x2 s.t. 4x1 + 6x2 ≤ 22...
Consider the following all-integer linear program: Max x1 + x2 s.t. 4x1 + 6x2 ≤ 22 x1 + 5x2 ≤ 15 2x1 + x2 ≤ 9   x1, x2 ≥ 0 and integer Solve the LP Relaxation of this problem. The optimal solution to the LP Relaxation is x1 = ___, x2 = .____________ Its value is ___________ Find the optimal integer solution. The optimal solution to the LP Relaxation is x1 = _____x2 = __________ Its value is _______
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT