Question
Consider the following all-integer linear program. Max 1 x 1 + 1 x 2 s.t. 4 x 1 + 7 x 2 35 1 x
Consider the following all-integer linear program.
| Max | 1x1 | + | 1x2 | |
| s.t. | ||||
| 4x1 | + | 7x2 | 35 | |
| 1x1 | + | 5x2 | 15 | |
| 2x1 | + | 1x2 | 15 | |
| x1, x2 0 and integer |
(a)Graph the constraints for this problem. Use dots to indicate all feasible integer solutions.
(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
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Continuous Pseudometrics
Authors: W W Comfort ,S Negrepontis
1st Edition
0824762940, 978-0824762940
