D14 - the objective function at any hanging box. After...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Summary The essential idea of branch-and-bound is to subdivide the feasible region to develop bounds z < z _ < z on z _ . For a maximization problem, the lower bound z is the highest value of any feasible integer point encountered. The upper bound is given by the optimal value of the associated linear program or by the largest value for
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the objective function at any hanging box. After considering a subdivision, we must branch to (move to) another subdivision and analyze it....
View Full Document

Ask a homework question - tutors are online