prettylady99
Oct 30, 2009, 12:51 PM
Max x1+ x2
s.t.
x1 + 3x2 ≤ 9
−4 x1 + x2 ≥ −9
4 x1 + x2 ≥ 3
x1, x2 ≥ 0, and
x1, x2 integer
1. Plot the feasible region for this problem.
2. What is the optimal solution?
3. What is the optimal solution to the linear programming (LP) relaxation? (The LP relaxation of an integer programming problem is the LP obtained by ignoring the integrality constraints.)
s.t.
x1 + 3x2 ≤ 9
−4 x1 + x2 ≥ −9
4 x1 + x2 ≥ 3
x1, x2 ≥ 0, and
x1, x2 integer
1. Plot the feasible region for this problem.
2. What is the optimal solution?
3. What is the optimal solution to the linear programming (LP) relaxation? (The LP relaxation of an integer programming problem is the LP obtained by ignoring the integrality constraints.)





