Given the LPP:
Max z=-2x1+x2-x3
St: x1+x2+x3<=6
-x1+2x2<=4
x1,x2<=0
What is the new optimal, if any, when the
a) RHS is replaced by [3 4]
b) Column a2 is changed from[1 2] to [2 5]
c) Column a1 is changed from[1 -1] to [0 -1]
d) First constraint is changed to x2-x3<=6 ?
e) New activity x6>=0 having c6=1 and a6=[-1 2] is introduced ?
Given primal problem is :
Maximize z = -2x1+x2-x3
St: x1+x2+x3 6
-x1+2x2 4
x1,x2 0
a) After replacing RHS by [3 4], the new primal problem is :
Maximize z = -2x1+x2-x3
St: x1+x2+x3 3
-x1+2x2 4
x1,x2 0
b) After changing column a2 from [1 2] to [2 5], the new primal problem is :
Maximize z = -2x1+x2-x3
St: x1+2x2+x3 3
-x1+5x2 4
x1,x2 0
c) After changing column a1 from [1 -1] to [0 -1], the new primal problem is :
Maximize z = -2x1+x2-x3
St: x2+x3 3
-x1+2x2 4
x1,x2 0
e) After introducing new activity x6 0 having c6=1 and a6=[-1 2], the new primal problem is :
Maximize z = -2x1+x2-x3+x6
St: x1+x2+x3-x6 3
-x1+2x2+2x6 4
x1,x2,x6 0
Given the LPP: Max z=-2x1+x2-x3 St: x1+x2+x3<=6 -x1+2x2<=4 x1,x2<=0 What is the new optimal, if any,...
Q4. (Sensitivity Analysis: Adding a new constraint) (3 marks) Consider the following LP max z= 6x1+x2 s.t.xi + x2 S5 2x1 + x2 s6 with the following final optimal Simplex tableau basis x1 r2 S2 rhs 0 0 18 0.5 0.5 0.5 0.5 x1 where sı and s2 are the slack variables in the first and second constraints, respectively (a) Please find the optimal solution if we add the new constraint 3x1 + x2 S 10 into the LP (b)...
Consider the following LPP: Maximize z = 50x1 + 20x2 + 30x3 subject to 2x1 + x2 + 3x3 + 90 (Resource A) x1 + 2x2 + x3 + 50 (Resource B) x1 + x2 + x3 + 80 (Resource C) x1, x2 , x3 > 0 The final simplex table is Basis cj x1 x2 x3 s1 s2 s3 Solution 50 20 30 0 0 0 x1 50 1 -1 0 1 -1 0 40 x3 30 0...
Consider the mathematical program max 3x1 x2 +3x3 s.t. 2X1 + X2 + X3 +X4-2 x1 + 2x2 + 3x3 + 2xs 5 2x1 + 2x2 + x3 + 3x6 = 6 Three feasible solutions ((a) through (c)) are listed below. (b) xo) (0.9, 0, 0, 0.2,2.05, 1.4) (c) xo) (0.3, 0.1, 0.4, 0.9, 1.65, 1.6) Please choose one appropriate interior point from the list, and use the Karmarkar's Method at the interior point and determine the optimal solution.
Problem 1 (20 pts) Consider the mathematical program max 3x1+x2 +3x3 s.t. 2x1 +x2 + x3 +x2 x1 + 2x2 + 3x3 +2xs 5 2x 2x2 +x3 +3x6-6 Xy X2, X3, X4, Xs, X620 Three feasible solutions ((a) through (c)) are listed below. (0.3, 0.1, 0.4, 0.9, 1.65, 1.6) (c) x Please choose one appropriate interior point from the list, and use the Karmarkar's Method at the interior point and determine the optimal solution. 25 Problem 1 (20 pts) Consider...
Find the duals of the following LP. (a) Max Z--2x1 + x2 - 4xz + 3x4 st. x1 + x2 + 3x2 + 2x4 S4 X1 -X3 + X, 2-1 2x1 + x2 32 X1 + 2x2 + x3 + 2x4 = 2 X2, X3, X, 20 (b) Min Z=0.4x1 +0.5x2 st. 0.3x2 +0.1x, 32.7 0.5x7 +0.5x2 = 6 0.6x, +0.4x, 26 X1, X220
Determine the Dual of the following Linear Programming Problems Max 4x1 - 22 + 2.T3 Subiect to: 2x1 + x2 7 Min 4 + 2x2 - T3 Subject to: x1 + 2x2-6 Max 4x1 - 22 + 2.T3 Subiect to: 2x1 + x2 7 Min 4 + 2x2 - T3 Subject to: x1 + 2x2-6
Use the simplex algorithm to find all optimal solutions to the following LP. max z=2x1+x2 s.t. 4x1 + 2x2 ≤ 4 −2x1 + x2 ≤ 2 x1 ≥1 x1,x2 ≥0
Q3. (Dual Simplex Method) (2 marks) Use the dual Simplex method to solve the following LP model: max z= 2x1 +4x2 +9x3 x1 x2 x3 S 1 -x1+ X2 +2x3 S -4 x2+ X1,X2,X3 S 0 Q3. (Dual Simplex Method) (2 marks) Use the dual Simplex method to solve the following LP model: max z= 2x1 +4x2 +9x3 x1 x2 x3 S 1 -x1+ X2 +2x3 S -4 x2+ X1,X2,X3 S 0
Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks) Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks)
Problem 1 (20 pts) Consider the mathematical program max 3x1+x2 +3x3 s.t. 2x1 +x2 + x3 +x2 x1 + 2x2 + 3x3 +2xs 5 2x 2x2 +x3 +3x6-6 Xy X2, X3, X4, Xs, X620 Three feasible solutions ((a) through (c)) are listed below. (0.3, 0.1, 0.4, 0.9, 1.65, 1.6) (c) x Please choose one appropriate interior point from the list, and use the Karmarkar's Method at the interior point and determine the optimal solution. 25