Question

2a. Consider the following problem. Maximize 17-Gri +80 Subject to 5x1 + 2x2 320 i 212 10 and Construct the dual problem for the above primal problem solve both the primal problem and the dual problem graphically. Identify the corner- point feasible (CPF) solutions and comer-point infeasible solutions for both problems. Calculate the objective function values for all these values. Identify the optimal solution for Z. I 피 University 2b. For each of the following linear programming models write down the dual problem and, give your recommendation on which is the more efficient way (probably) to obtain an optimal solution: by applying the simplex method directly to this primal problem or by applying the simplex method directly to the dual problem instead. Explain. i. Maximize Z=10x1-4x2 + 7x3 subject to X1 223xs s 25 5x1 +x2 + 2x3 s 40 2x1 -x2 xs 20 and Maximize subject to ı + 3x2 + 2r3 + 3xs +xss6 Z = 2X1 + 5X2 + 3X3 + 4X4 + X5. 11. and xy 2 0, forj 1. 2. 3, 4, 5

Answer 1

Constuct the ferlloon problim O coim Dual 29,t 29 87 y20 an |20|10 | 0|0|M | terction Ar |О | 0 -M zj.gl7M2에 3M-101-Mİ ide:', Column M-20, -5
​​​​​​
ileration _.2 10 20100 M 129ヶ:1,352 28M | 2018m mrn ratio -3.5 , Enteing-, Departing: A), ke elemi nr nelw i-terotion-3 C200 20 2 lo Jente Optimal Salutiom s aved torh vale ence of vauabl a

Maximize z.lox,-4xst ד23 sle- 8x1-2,+ 213 231-72+3 +S520 t teratio- | 2ヴ S3 56 百 Hence thod -fails to et optimal basre -feasibl Saluton

and x,20 -for , 3 lct 37, 3319 6 2 5 S1 0 95 Ratio Heme, ma thod fails to get epirnal baser faasibl Salution optima