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 3 1 -1 2 0 10 s3 0 0 -1 0 0 -1 1 30 zj 50 40 30 20 10 0 2300 cj-zj 0 -20 0 -20 -10 0 a. What is the range of optimality for the contribution rate of the variable x1? b. Obtain the range of feasibility for the Resource A.
a) Range of optimality for the contribution rate of variable x1 is following:
Lower limit = 50-10 = 40
Upper limit = 50+infinity = infinity
b) Range of feasibility for resource A is following:
Lower limit = 90-90 = 0
Upper limit = 90+10 = 100
Consider the following LPP: Maximize z = 50x1 + 20x2 + 30x3 subject to 2x1 + x2 + 3x3 + 90 (Resource A) x1 + 2x2 + x3 +...
Consider the following problem: Maximize z+ 2x1+5x2+3x3 subject to x1-2x2+3x3>=20, and 2x1+4x2+x3=50 using the Big-M and two phase method.
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)
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 ?
Solve the system X1 + 2x2 – 3x3 = 5 2x1 + x2 – 3x3 = 13 - X1 + X2 = -8 1 x= 1), sec 0 a. b. N x=s3 sec -5 0 X=S SEC -1 O O d. X=t 1 1 1 tec Oe. x= -1, sec 0
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...
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.
Solve the system X1 + 2x2 - 3x3 = 5 2x1 + x2 – 3x3 = = 13 - X1 + X2 = -8 O a. x= 1, SEC 0 Ob. tec x=1 1 Ос. 2 x= 3, SEC -5 0 d. 1 x=0 -1 gree -1 SEC x=s -1 0 Of. 1 X=S 0 -1 SEC 0
Solve the system X1 + 2x2 – 3x3 = 5 2x1 + x2 – 3x3 = 13 - X1 + x2 = -8 [1 X=t1 tec 1 a. b. SEC Oc. 1 - -- 1. Jeee -2 -0. x=t0 O d. -1 , SEC e. SEC o f. X=S 2 3 ], sec -5
4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54 x1 + x2 = 3 and X120, X2 0. DI (a) Solve this problem graphically. (b) Using the Big M method, construct the complete first simplex tableau for the simplex method and identify the corresponding initial (artificial) BF solution. Also identify the initial entering basic variable and the leaving basic variable. I (c) Continue from part (b) to work through the simplex method step...
(1 point) Use the simplex method to maximize P = 2x1 + 3x2 + x3 subject to -X -X1 + X2 + 4x2 + 2x2 + 10x35 10 + 6x3 9 + 10x3 S 11 X X120 x220 x3 20 P=