Use Branch and Bound method to solve the following Integer linear programming problem Minimize Z=9*x1+10*x2 subject to
Fantastic news! We've Found the answer you've been seeking!
Question:
Use Branch and Bound method to solve the following Integer linear programming problem
Minimize Z=9*x1+10*x2
subject to x1 ≤ 9,
x2 ≤ 8,
4*x1+3*x2 ≥ 40
x1, x2 ≥ 0 and are integers
Related Book For
Introduction to Operations Research
ISBN: 978-1259162985
10th edition
Authors: Frederick S. Hillier, Gerald J. Lieberman
Posted Date: