Question: The following ILP problem has LP relaxation optimal solution x = ( 0 , 0 , 0 . 5 2 3 8 , 0 ,

The following ILP problem has LP relaxation optimal solution x =(0,0,0.5238,0,0).
min 4x1+5x2+12x3+7x4+6x5
s.t.6x1+8x2+21x3+6x4+5x5>=11
x1+ x2+2x3+ x4>=1
2x2+5x3+ x5>=2
x1,..., x5=0 or 1
(a)(7 pts) Determine the best bound on the ILP optimal objective function value available from
relaxation results.
(b)(7 pts) Determine whether the LP relaxation optimum solves the ILP above. If not, round to a
feasible solution to the ILP either by moving all binary variables at fractional values in the LP
relaxation optimum up to 1 or by moving all down to 0.
(c)(6pts) Combine parts (a) and (b) to determine the best upper and lower bounds on the ILP
optimal objective function value

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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

Students Have Also Explored These Related General Management Questions!