Question: Problem Consider the following IP Problem: Max Z =1007X1 +90x2 ST 10X1 +7x2 ==0, and integer The optimal tableau for this IP's linear programming relaxation

Problem Consider the following IP Problem: Max Z =1007X1 +90x2 ST 10X1 +7x2 ==0, and integer The optimal tableau for this IP's linear programming relaxation is given in below. using branch and bound method to find the optimal solution by using the third (X1) constraint. Z=746,15 X1=30/13 x2=70/13
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
