Question: INTEGER LINEAR PROGRAMMING BV X1 X2 S2 RHS Z 100 0 300 600 $1 1 20 40 X2 1 1 1 2 52 100 1
INTEGER LINEAR PROGRAMMING


BV X1 X2 S2 RHS Z 100 0 300 600 $1 1 20 40 X2 1 1 1 2 52 100 1 -400 200 Z 600 40 X2 2 52 200 NOTE: AS YOU CAN SEE THE RHS INTEGER VALUE, THEREFORE YOU MAY GET THE FINAL ANSWER ACTIVITY: 1.IDENTIFY AND DISCUSS A REAL-LIFE SCENARIO OR AN INDUSTRY PROBLEM THAT CAN BE SOLVE USING THE LINEAR PROGRAMMING SOLUTION.2 Solve the following: Solve using Branch and Bound (40 points) Objective (Max) 2X1 + 3X2 Constraints 1 2X1 + 4X2 5 10 Constraints 2 3X1 + 6X2 5 11 X1 & X2 2 0 and integer Solve using Cutting Plane (40 points) Objective (Max) 2X1 + 3X2 Constraints 1 2X1 + 4X2 5 10 Constraints 2 3X1 + 6X2 5 11 X1 8: X2 2 0 """ Page Break"""
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
