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

1 Expert Approved Answer
Step: 1 Unlock

X 1 X 2 625 65 1 1 1275 4 4 1 1 8 10 15 15 Errata ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Excel file Icon

1049-B-M-L-M-A-D-A (540).xlsx

300 KBs Excel File

Students Have Also Explored These Related Management Leadership Questions!