Consider the following multiple-objective linear program:
Maximize Z1 = 4x1 + 6x2
Maximize Z2 = –4x1 + 2x2
Subject to: x1 – x2 ≥ –4
3x1 – 2x2 ≤ 6
x1 + x2 ≥ 5
x1 + x2 ≤ 10
x1, x2 ≥ 0
(a) Plot the feasible region in decision space for this problem.
(b) Plot the corresponding feasible region in objective space for this problem. For each extreme point indicate if it is a noninferior or a dominated solution.
(c) Use the constraint method (graphically) to generate an approximation of the noninferior set having 6 noninferior solutions evenly spaced along the Z1 axis.
(d) Use the constraint method (graphically) to generate an approximation of the noninferior set having 6 noninferior solutions evenly spaced along the Z2 axis.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.