Consider the following four LP formulations. Using a graphical approach in each case, determine
(a) Which formulation has more than one optimal solution.
(b) Which formulation has an unbounded solution.
(c) Which formulation is infeasible.
(d) Which formulation has a unique optimal solution

Transcribed Image Text:

Formulation 1 Formulation 3 maximize: 3X+1Y maximize: 2X+3Y subject to: 2X + Y £6 subject to: X+27 a 12 S 20 3) 8X+ 7 F>56 2 Y<7 2y >5 2X>7 X<9 х, у >0 X, Y>0 Formulation 2 Formulation 4 maximize: 3X + 6¥ maximize: 3X+4¥ subject to: IX + 6¥ £42 subject to: 3X+7 is 21 X+2Y s10 IX+ Y<6 X£4 X+Y>2 2 Y<9 2X>2 X, Y>0 X, Y>0