Question: Consider the following problem (P): Maximize z = x1 + 3x2 (0) subject to x1 + 2x2 4 (1) x1 + x2 > 0 =
Consider the following problem (P): Maximize z = x1 + 3x2 (0) subject to x1 + 2x2 4 (1) x1 + x2 > 0 = x1 + x2 1 (2) 1 |x1| 2 integer (3) x2 0 integer (4) (a) Find the 4 possible values of x1 from constraint (3). (b) Using the results in (a) and constraint (1), find the smallest upper bound for x2. (c) Using the results in (a) and (b), or otherwise, reformulate problem (P) as an Integer Linear Programming Problem. Find the smallest value for each big-M constant, if any
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
