In this example, we first consider the first-priority goal, minimizing d 1-.

The relationship of d1- and d1+ to

the goal constraint is shown in Figure 9.2. The area below the goal constraint line x 1 + 2x2 = 40 represents
possible values for d1-, and the area above the line represents values
Figure 9.2. The first-priority goal: minimize d1-

Next, the third-priority goal, minimizing d 3+, is considered. Figure 9.4 shows the areas corresponding to
d3-and d3+. To minimize d3+, the area above the constraint line 4x1 + 3x2 = 120
Figure 9.4. The third-priority goal: minimize d3+

is eliminated. After considering the first three goals,we are left with the area between the line segments
AC and BC, which contains possible solution points that satisfy the first three goals.
Finally,we must consider the fourth-priority goal, minimizing d 1+. To achieve this final goal, the area
above the constraint line x1 + 2x2 = 40 must be eliminated. However, if we eliminate this area, then both
d2– and d3- must take on values. In other words, we cannot minimize d 1+ totally. without violating the first-
and second-priority goals. Therefore, we want to find a solution pointthat satisfies the first three goals but
achieves as much of the fourth-priority goal as possible.
Point C in Figure 9.5 is a solution that satisfies these conditions. Notice that if we move down the goal
constraint line 4x1 + 3x2 = 120 toward point D, d1+ is further minimized; however d2- takes on a value as
we move past point C. Thus, the minimization of d 1+ would be accomplished only at the expense of a
higher-ranked goal.
Figure 9.5. The fourth-priority goal (minimize d1+) and the solution