Question: Consider the following optimization problem: MAX: X1 + X2 Subject to: -4X1 + 4X2 1 -8X1 + 10X2 15 X1, X2 0
Consider the following optimization problem:
MAX: X1 + X2
Subject to:
-4X1 + 4X2 ≤ 1
-8X1 + 10X2 ≥ 15
X1, X2 ≥ 0
a. What is the optimal solution to the problem?
b. Now suppose that X1 and X2 must be integers. What is the optimal solution?
c. What general principle of integer programming is illustrated by this question?
Step by Step Solution
3.39 Rating (168 Votes )
There are 3 Steps involved in it
X 1 X 2 625 65 1 1 1275 4 4 1 1 8 10 15 15 Errata ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
1049-B-M-L-M-A-D-A (540).xlsx
300 KBs Excel File
