| Mixed Integer Programming - Solving Subproblems | Previous | Next |
| The next step of the MIP branch-and-bound algorithm is to obtain a bound for each of these subproblem branches. That is, solve the LP-relaxation for each subproblem. This is usually done by beginning at the previous solution and applying the dual simplex method to find the new optimal solution. However, since these problems have only two variables, they can be solved graphically. | |
| Solve the first subproblem graphically.
|
Solve the second subproblem graphically.
|