Question: Consider the following linear programme: Min 2x1 + 2x2 a. show the feasible region. s.t. 1x + 3x2 12 3x1 + 1x2 13 1x11x2=3 X1,
Consider the following linear programme: Min 2x1 + 2x2
a. show the feasible region. s.t. 1x + 3x2 12 3x1 + 1x2 13 1x11x2=3 X1, X2 0
b. what are the extreme points of the feasible region?
c. Find the optimal solution using the graphical solution procedure.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
