Question: Question 2 (14 marks) Consider the following integer linear program (ILP): max 100.x1 + 64.x2 s.t 50x1 +31x2 -4 X1, C2 > 0 11, 12

Question 2 (14 marks) Consider the following

Question 2 (14 marks) Consider the following integer linear program (ILP): max 100.x1 + 64.x2 s.t 50x1 +31x2 -4 X1, C2 > 0 11, 12 E Z (a) By using the graphical method, solve the linear program that results by ignoring the integer constraints (this is called the linear programming relaxation of the program). (b) By trial and error, find the optimal solution when the integer constraint is included. (c) One potential method for solving an ILP is to solve the corresponding linear program relaxation before rounding the answers to the nearest integer. Do you think this is an effective method? Give reasons for your

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!