(a) Determine the feasible region graphically for the following inequalities.
x1 + x2 ≤ 4
4x1 + 3x2 ≤ 12
−x1 + x2 ≥ 1
x1 + x2 ≤ 6
x1, x2 ≥ 0
(b) Which constraints are redundant? Reduce the system to the smallest number of constraints defining the feasible region.
(c) For each extreme point of the feasible region, state an example of an objective function which is maximised at that point.
Get Answers For Free
Most questions answered within 1 hours.