因为我和我的同学答案不同,所以问问各位看,希望对这两个题目有更多理解。
Branch and bound
Use the branch-and-bound method to find the optimal
solution to the following IP:
max z =7x1 + 3x2
s.t. 2x1 + x2 <= 9
s.t. 3x1 + 2x2 <= 13
x1, x2 => 0; x1, x2 integer
Cutting Plane
3 Consider the following IP:
max z =2x1 - 4x2
s.t. 2x1 + x2 <= 5
- 4x1 + 4x2 <= 5
x1, x2 => 0; x1, x2 integer
The optimal tableau for this IP’s linear programming
relaxation is given in Table 88. Use the cutting plane
algorithm to find the optimal solution.
z x1 x2 s1 s2 rhs
1 0 0 -2/3 -5/6 -15/2
0 1 0 1/3 -1/12 5/4
0 0 1 1/3 1/6 5/2
谢谢大家啊~~~~javascript:void(0)