Operations Management: Optimization and Linear Programming – #221

Question: Consider the following integer linear programming problem

The solution to the Linear programming relaxation is: x1 = 5.714, x2= 2.571.

What is the upper bound for the value of the objective function?

What is the value of the objective function for the rounded down solution?

Is the rounded down solution feasible?


log in

reset password

Back to
log in