.
Next, two new subproblems are created by adding the respective constraints, 
and 
.| Mixed Integer Programming - Branching | Previous | Next |
| To demonstrate the MIP algorithm, consider the following
integer programming problem.
|
|
| The optimal solution for the LP-relaxation, determined graphically, is: | |
|
|
| The next step in the MIP algorithm is to branch on the first integer-restricted variable that has a noninteger value in the LP-relaxation. | |
| In this case, the branching variable is .
Next, two new subproblems are created by adding the respective constraints,
and . |
|