Essay
Given the following all-integer linear program:
Max
3x1 + 2x2
s.t.
3x1 + x2 ≤ 9
x1 + 3x2 ≤ 7
−x1 + x2 ≤ 1
x1, x2 ≥ 0 and integer
a.
Solve the problem as a linear program ignoring the integer constraints. Show that the optimal solution to the linear program gives fractional values for both x1 and x2.
b.
What is the solution obtained by rounding fractions greater than of equal to 1/2 to the next larger number? Show that this solution is not a feasible solution.
c.
What is the solution obtained by rounding down all fractions? Is it feasible?
d.
Enumerate all points in the linear programming feasible region in which both x1 and x2 are integers, and show that the feasible solution obtained in (c) is not optimal and that in fact the optimal integer is not obtained by any form of rounding.
Correct Answer:

Verified
Correct Answer:
Verified
Q1: Why are 0 - 1 variables sometimes
Q4: The graph of a problem that requires
Q5: Grush Consulting has five projects to consider.
Q8: If the LP relaxation of an integer
Q9: Dual prices cannot be used for integer
Q10: Solve the following problem graphically.<br>Max<br>5X + 6Y<br>s.t.<br>17X
Q11: Rounded solutions to linear programs must be
Q21: In an all-integer linear program,<br>A)all objective function
Q23: Which of the following is the most
Q24: If a problem has only less-than-or-equal-to constraints