Question: 1.Consider the following all-integer linear program: Min 1x 1 + 2x 2 s.t. C1 1x 1 + 4x 2 < 21 C2 2x 1 +
1.Consider the following all-integer linear program:
Min 1x1 + 2x2 s.t.
C1 1x1+ 4x2 < 21
C2 2x1+ 1x2 > 7
C3 3x1+ 1.5x2 < 21
-2x1 + 6x2>0
x1, x2 > 0
a.Graph the constraints for this problem. b.Solve the LP problem and identify the feasible region, corner point solutions, and the optimal solution. c.Suppose the objective function is changed to max 5x1 + 2x2. Find the optimal solution and the value of the objective function. d.Solve the above problem as an integer programming problem (Linear PwP)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
