Question: Consider the following integer linear programming problem

Max Z = 3x₁ + 2x₂

Subject to: 3x₁ + 5x_{2 £} 30

4x₁ + 2x_2£ 28

x_{1 £} 8

x₁ ,x_{2 ³}0 and integer

The solution to the Linear programming relaxation is: x₁ = 5.714, x₂= 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?