Consider the following linear program: Max 2X + 3Y s.t. 5X +5Y ≤ 400 -1X+ 1Y ≥ 10 1X + 3Y ≥ 90 X, Y ≥ 0
a. Use the graphical solution procedure to find the optimal solution.
b. Conduct a sensitivity analysis to determine the range of optimality for the objective function coefficients X & Y.
c. What are the binding constraints?
d. If the right-hand-side of the binding constraints are marginally increased, what will be the Dual Value?
(a)
Problem is
|
||||||||||||||||||||||||
subject to | ||||||||||||||||||||||||
|
||||||||||||||||||||||||
and x1,x2≥0; |
Hint to draw constraints
1. To draw constraint 5x1+5x2≤4000→(1)
Treat it as 5x1+5x2=4000
When x1=0 then x2=?
⇒5(0)+5x2=4000
⇒5x2=4000
⇒x2=40005=800
When x2=0 then x1=?
⇒5x1+5(0)=4000
⇒5x1=4000
⇒x1=40005=800
x1 | 0 | 800 |
x2 | 800 | 0 |
2. To draw constraint -x1+x2≥10→(2)
Treat it as -x1+x2=10
When x1=0 then x2=?
⇒-(0)+x2=10
⇒x2=10
When x2=0 then x1=?
⇒-x1+(0)=10
⇒-x1=10
⇒x1=-10
x1 | 0 | -10 |
x2 | 10 | 0 |
3. To draw constraint x1+3x2≥90→(3)
Treat it as x1+3x2=90
When x1=0 then x2=?
⇒(0)+3x2=90
⇒3x2=90
⇒x2=903=30
When x2=0 then x1=?
⇒x1+3(0)=90
⇒x1=90
x1 | 0 | 90 |
x2 | 30 | 0 |
The value of the objective function at each of these extreme points
is as follows:
Extreme Point Coordinates (x1,x2) |
Lines through Extreme Point | Objective function value z=2x1+3x2 |
A(0,30) | 3→x1+3x2≥90 4→x1≥0 |
2(0)+3(30)=90 |
B(0,800) | 1→5x1+5x2≤4000 4→x1≥0 |
2(0)+3(800)=2400 |
C(395,405) | 1→5x1+5x2≤4000 2→-x1+x2≥10 |
2(395)+3(405)=2005 |
D(15,25) | 2→-x1+x2≥10 3→x1+3x2≥90 |
2(15)+3(25)=105 |
The maximum value of the objective function z=2400 occurs at the
extreme point (0,800).
Hence, the optimal solution to the given LP problem is :
x1=0,x2=800 and max z=2400.
(b)
Range of optimality for objective function coefficient X=Objective function coefficient -Allowable decrease to Objective function coefficient +Allowable increase
=2-infinity to 2+1
= -infinity to 3
Range of optimality for objective function coefficient Y=Objective function coefficient -Allowable decrease to Objective function coefficient +Allowable increase
=3-1 to 3+infinity
= 2 to infinity
Sensitivity report :
(c)
The binding constraints are the ones that have one or more feasible optimal solutions on their equation. Hence, a binding solution is the one that contributes to the feasible region and the optimal solution and feasible region changes with changes in binding constraints.
Hence, in the above solutions, all the constraints are contributing except X2 >= 0
Hence, binding constraints are,
5x1 + 5x2 <= 400
-x1 + x2 >= 10
x1 + 3x2 >= 90
X1 >= 0
(d) From the answer report,constraint 1 is binding.
If the RHS of constraint is marginally increased ,the dual price will remain same and is equal to 0.6.
Sensitivity report with allowable increase =infinity(very high value) and shadow price/dual price=0
Consider the following linear program: Max 2X + 3Y s.t. 5X +5Y ≤ 400 -1X+ 1Y...
Consider the following integer program Max 2x+3y s.t 6x+7y23 x-y<12 xy0 x,y: integer Let V1 denote the optimal objective value of the above optimization problem. Let V2 denote the optimal objective value of the optimization problem obtained by dropping "x,y: integer" constraint. Similarly, let V3 denote the optimal objective value of the optimization problem obtained by dropping "x-y<-12" constraint which one of the following statements is correct? a. V2 V1 and V3<-V1 b. V1 V2 and V1<-V3 c. V2V1 but...
Consider the following linear program Max 3xl +2x2 S.t 1x1 + 1x2 〈 10 3x1 1x2 〈 24 1xl t 2x2< 16 And xl, x2> 0. a) Use Excel Solver to find the optimal solution to this problem. State the optimal values of xl, x2, and Z. b) Assume that the objective function coefficient for xl changes from 3 to 5. Does the optimal solution change? c) Assume that the objective function coefficient for x1 remains 3, but the objective...
Given the following linear program that maximizes revenue (assume x and y cannot be negative): Max Z = 15x + 20y s.t. 5x + 5y ≤ 40 4x + y ≤ 4 What is the maximum revenue at the optimal solution? $185 $120 $80 $200
Question 3 Solve the following linear program: Max 3x+2y s.t. 2x+2y <8 A 3x+2y < 12 B 1x+0.5y < 3C x,y> 0 w How much slack is in constraint B? 2 units of slack O 10 units of slack O 2 units of surplus 10 units of surplus
Graphical Method of Linear Programming 3. Find the minimum value of the objective function z = 5x + 7y, where x = 0 and y 0, subject to the constraints a. 2x + 3y 26 b. -x + y S4 c. 3x-y = 15 d. 2x + 5y = 27.
Find the complete optimal solution to this linear programming problem (using Excel) and enter the optimal x value. Max 5X + 6Y s.t. 3X + Y <= 15 X + 2Y <= 12 3X + 2Y <= 24 X , Y >= 0 Find the complete optimal solution to this linear programming problem using Excel and type in the optimal value of X below (X*=?). Max 2X + 3Y s.t. 4X + 9Y <= 72 10X + 11Y <= 110...
Question 4 (3 points) Set up and solve the following simple linear optimization model: MAX: 14.9 x + 23.8 y subject to: 2x + 2y = 20 3x 2 17 5x + 1y s 78 x.y 20 What is the value of the objective function at the optimal solution? Round your answer to one decimal place. Your Answer: Answer Question 5 (8 points) -
2. Consider the following linear model where C1 has not yet been defined. Max s.t. z = C1x1 + x2 X1 + x2 = 6 X1 + 2.5x2 < 10 X1 > 0, x2 > 0 Use the graphical approach that we covered to find the optimal solution, x*=(x1, xỉ) for all values of -00 < ci so. Hint: First draw the feasible region and notice that there are only a few corner points that can be the optimal solution....
For the following linear programming problem a. change to standard for; b. use graphical approach to find complete optimal solutions(X, Y and optimal objective function value) Max 5X+6Y s.t. 3X+Y <= 15 X+2Y <= 12 3X+2Y <= 24 X, Y >= 0
1. (20 pts.) Consider the following linear program: max 4x4 +xz+5x3 +3x4 s.t. *1 -X2 -X3 +3X, 51 5x +xz+3X3 +8X555 -X2 +2x2+3x3 -5x53 It is claimed that the solution x* = (0,14,0,5) is an optimal solution to the problem. Give a proof of the claim. Do not use the simplex method to solve this problem.