Question: Consider the following all-integer linear program. Max 1 x 1 + 1 x 2 s.t. 5 x 1 + 6 x 2 41 1 x
Consider the following all-integer linear program.
| Max | 1x1 | + | 1x2 | |
| s.t. | ||||
| 5x1 | + | 6x2 | 41 | |
| 1x1 | + | 7x2 | 28 | |
| 2x1 | + | 1x2 | 15 | |
| x1, x2 0 and integer (a) Graph the constraints for this problem. Use dots to indicate all feasible integer solutions. On the coordinate plane, the horizontal axis is labeled x and the vertical axis is labeled x. A region bounded by a series of connected line segments and several points are on the graph.
(b) Solve the LP Relaxation of this problem. ____________at (x1, x2) =(_____________) (c) Find the optimal integer solution. ____________at (x1, x2) =(_____________) | ||||
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
