(Choose 1 answer)
(See picture)
A. (i)
B. (ii)
C. (iv)
D. (iii)
min 2x_{1}-3x_{2} subject to x_{1}+x_{2}\le1 3x_{1}-4x_{2}<-2 x_{2}\le-1
(i)maxsubject to -\lambda_{1}+2\lambda_{2}+\lambda_{3} \lambda_{1}+3\lambda_{2}=-2 \lambda_{1}-4\lambda_{2}+\lambda_{3}=3 \lambda_{1}\ge0,\lambda_{2}\ge0,\lambda_{3}\ge0
Find the dual optimization problem to the following linear programming
(iii) max subject to \lambda_{1}+2\lambda_{2}-\lambda_{3} \lambda_{1}+3\lambda_{2} \lambda_{1}-4\lambda_{2}+\lambda_{3} \lambda_{1}\ge0,\lambda_{2}\ge0,
(ii) max subject to -\lambda_{1}+2\lambda_{2}+\lambda_{3} \lambda_{1}+3\lambda_{2}=2 \lambda_{1}-4\lambda_{2}+\lambda_{2}=-3 \lambda_{1}\ge0,\lambda_{2}\ge0,\lambda_{3}\ge0
(iv) max \lambda_{1}+2\lambda_{2}-\lambda_{3} subject to \lambda_{1}+3\lambda_{2} \lambda_{1}-4\lambda_{2}+\lambda_{2} \lambda_{1}\ge0,\lambda_{2}\ge0,.
an tot ni
Et (14
