Question: Simple linear program Consider the following linear program: max 2x1 + x2, subject to 12x1 + 3x2 60, 3x1 x2 7, x2 10, x1 0,
Simple linear program Consider the following linear program: max 2x1 + x2, subject to 12x1 + 3x2 60, 3x1 x2 7, x2 10, x1 0, x2 free. (a) Draw a graph of the constraints and shade in the feasible region. Label the vertices of this region with their coordinates. (b) Define a c vector such that this LP (i) has a unique optimal solution. (ii) has two corners that are optimal. (iii) is unbounded 6
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
