Question: 4. Consider the integer programming model below. Max Z = X1 + x2 S.t. 3x1 + 2x2 = 8 5 X2 = X1, X2 >

4. Consider the integer programming model below.

4. Consider the integer programming model below. Max Z = X1 + x2 S.t. 3x1 + 2x2 = 8 5 X2 = X1, X2 > 0 X1, X2 integer Use branch and bound method to solve the problem as described in part a, b, c, d below. a. State your Subproblem 1 and solve it graphically. (6 P) b. State your Subproblem 2 and solve it graphically. (6 P) c. State your Subproblem 3 and solve it graphically. (6 P) d. Did you find an optimal solution at your current stage? (6 P) If yes state your optimal solution, ** ( x1, x2 ) and Z*. If no, state your lower and upper bound for Z. 4. Consider the integer programming model below. Max Z = X1 + x2 S.t. 3x1 + 2x2 = 8 5 X2 = X1, X2 > 0 X1, X2 integer Use branch and bound method to solve the problem as described in part a, b, c, d below. a. State your Subproblem 1 and solve it graphically. (6 P) b. State your Subproblem 2 and solve it graphically. (6 P) c. State your Subproblem 3 and solve it graphically. (6 P) d. Did you find an optimal solution at your current stage? (6 P) If yes state your optimal solution, ** ( x1, x2 ) and Z*. If no, state your lower and upper bound for Z

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!