Consider the following all-integer linear program. 1x₁ + 1x₂ Max s.t. 4x₁ + 7x₂ ≤ 35 1x₁ + 5x₂ ≤ 20 2x₁ + 1x₂ ≤ 15 X₁, X
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Consider the following all-integer linear program. 1x₁ + 1x₂ Max s.t. 4x₁ + 7x₂ ≤ 35 1x₁ + 5x₂ ≤ 20 2x₁ + 1x₂ ≤ 15 X₁, X
solutions. X2 X₂ 8 6 (b) Solve the LP Relaxation of this problem. at (x₁, x₂) = ( (c) Find the optimal integer solution. at (x₁, x₂) = 8 8 6 2 2 8 X2 8 6 4 2 2 6 8 X1 X2 8 4 6 8 X1
Consider the following all-integer linear program. 1x₁ + 1x₂ Max s.t. 4x₁ + 7x₂ ≤ 35 1x₁ + 5x₂ ≤ 20 2x₁ + 1x₂ ≤ 15 X₁, X₂20 and integer (a) Graph the constraints for this problem. Use dots to indicate all feasible integer