D14 - the objective function at any ‘‘hanging’’ box...

Info icon This 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
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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern