Question: Consider the following all-integer linear program: Max 10x1 + 3x2 s.t. 6x1 + 7x2 40 3x1 + 1x2 11 x1, x2 0
Max 10x1 + 3x2
s.t.
6x1 + 7x2 ≤ 40
3x1 + 1x2 ≤ 11
x1, x2 ≥ 0 and integer
a. Formulate and solve the LP Relaxation of the problem. Solve it graphically, and round down to find a feasible solution. Specify an upper bound on the value of the optimal solution.
b. Solve the integer linear program graphically. Compare the value of this solution with the solution obtained in part (a).
c. Suppose the objective function changes to Max 3x1 + 6x2. Repeat parts (a) and (b).
Step by Step Solution
3.32 Rating (161 Votes )
There are 3 Steps involved in it
a The value of the optimal solution to the LP Relaxation is 367 and it is given by x 1 367 x 2 00 Si... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
148-M-O-G-L-P (139).docx
120 KBs Word File
