This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Branch and Bound
Alternative is cutting plane approach
sequentially introduces new constraints
To force the basic feasible solutions to be integers. Currently commercial codes combine the two
Will solve the old LP as an IP using B&B
Max. z = x1 + 2*x2;
x1 + 3*x2 ≤ 16,
x1 + x2 ≤ 7,
x1, x2 ≥ 0,
x1, x2 integers Best illustrated with a B&B diagram MIE376 Mathematical Programming 5 ...
View Full Document
This note was uploaded on 07/10/2011 for the course MIE 376 taught by Professor Daniel during the Spring '11 term at University of Toronto- Toronto.
- Spring '11