Question

Problem 2. (20 marks) Consider the following integer linear programming problem: max T^2 s.t. 2T1 + 2T2 < 121 + 212 < 7 T1, T2 > 0 and are integers. Use binary representation of the variables to reformulate this integer LP problem into a binary integer LP problem. (Note: You can work on the constraints to reduce the range of your choices. For example, (21, 12) (1,2) is not a feasible solution; You can draw a figure to help you if you want.) (b) Use the binary integer branch-and-bound algorithm to solve the problem developed above. Write down the optimal solution and the optimal value for the original integer LP problem.

          Problem 2. (20 marks) Consider the following integer linear programming problem:
max T^2 s.t. 2T1 + 2T2 < 121 + 212 < 7 T1, T2 > 0 and are integers.
Use binary representation of the variables to reformulate this integer LP problem into a binary integer LP problem. (Note: You can work on the constraints to reduce the range of your choices. For example, (21, 12) (1,2) is not a feasible solution; You can draw a figure to help you if you want.)
(b) Use the binary integer branch-and-bound algorithm to solve the problem developed above.
Write down the optimal solution and the optimal value for the original integer LP problem.

problern 2 20 marks consider the following integer linear programming problem max t2 st 2t1 2r2 1 21 212 7 i1 te 0 and are integers use binary representation of the variables to reformulate 35716

Added by Brooke P.

Question

Please give Ace some feedback