Please answer parts A-C:
Consider the following all-integer linear program. Max 5x + 8x2 s.t. 6x2 + 5x2 5 25 11x1 + 4x2 S 44 1x1 + 2xy S8 X1, X2 2 0 and integer (a) Graph the constraints for this problem. Use points to indicate all feasible integer solutions. X2 X2 Save X2 9 8! 8 8 6 6 6 6 4 2 2 X1 X1 X1 X1 6 8 4 6 8 4 6 8 4 6 8 (b) Find the optimal solution to the LP Relaxation. (Round your answers to three decimal places.) at (X2, X2) = Using this solution, round down to find a feasible integer solution. x) ( at (X2, X2) =
(c) Find the optimal integer solution. at (X1, X2) = (I Is it the same as the solution obtained in part (b) by rounding down? Yes No
Please answer parts A-C:
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Please answer parts A-C:
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!