Question: Consider the following Integer Programming (IP) Problem. max z=40 x 1 +27 x 2 s.t. 10 x 1 +7 x 2 38 (IP) x 1
Consider the following Integer Programming (IP) Problem.
maxz=40x1+27x2 s.t.10x1+7x238(IP) x1x2 x1Z+,x2Z+
(1) Solve the LP relaxation of integer program (IP) by graphical method and determine an optimal solution and the optimal objective value of the LP relaxation.
(2) Obtain an optimal solution of integer program (IP) by Branch-and-Bound method. You have to show all the steps and summarize results in Branch-and-Bound tree.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
