Use the
branch-and-bound algorithm to solve the following integer
programming problem. Draw a branch-and-bound tree to illustrate
your steps. Solve every linear programming problem
geometrically.
min
?x1?3x2
s.t.
x1+x2?1.5
x1,
x2
?
0
and
integral





