What is the optimal solution to the problem now suppose


Consider the following optimization problem:

Max: X1 + X2

Subject to: -4 X1 + 4 X2 <= 1

-8 X1 + 10 X2 >= 15

X1, X2 > 0

Part a: What is the optimal solution to the problem?

Part b: Now suppose that X1 and X2 must be integers. What is the optimal solution?

Part c: What general principle of integer programming is illustrated by this question?

Request for Solution File

Ask an Expert for Answer!!
Financial Accounting: What is the optimal solution to the problem now suppose
Reference No:- TGS01708527

Expected delivery within 24 Hours