,
so it cannot be fathomed by any test. Thus, we need to branch and bound
on this subproblem, with
as the branching variable. To branch, two new subproblems are created by
adding the respective constraints, 
and 
.| Mixed Integer Programming - Exploring Right Node | Previous | Next |
|
| After selecting the right node ("x1 >= 3"), the optimal solution for
its LP-relaxation is highlighted (in purple). This solution (7.5) is greater
than the current incumbent (6, highlighted in blue), is feasible for the
LP-relaxation, and includes a noninteger value for ,
so it cannot be fathomed by any test. Thus, we need to branch and bound
on this subproblem, with
as the branching variable. To branch, two new subproblems are created by
adding the respective constraints,
and . |