Page 235 -

AN ALGEBRAIC OVERVIEW OF THE SIMPLEX METHOD 215

points*6–*9 are basic solutions that are not feasible. The basic solution found by
setting x 2 ¼ 0 and s 1 ¼ 0 corresponds to point*9 ; the basic feasible solution found
by setting x 1 ¼ 0 and x 2 ¼ 0 corresponds to point*1 in the feasible region.

x 2
60 7

50

40 Warehouse Capacity

30 6

5 4 8 Display Units
20

3
10 Feasible
Region Assembly Time
9
1 2
x 1
10 20 30 40 50

The graph in Figure 5.1 shows only the basic feasible solutions for the HighTech
problem; note that each of these solutions is an extreme point of the feasible region. In
Chapter 2 we showed that the optimal solution to a linear programming problem can be

Figure 5.1 Feasible Region and Extreme Points for the HighTech Industries Problem

x 2
60

50

40 Warehouse Capacity
Portable 30

5 4 Display Units
20

3
10 Feasible
Region Assembly Time

1 2
x 1
10 20 30 40 50
Deskpro

Copyright 2014 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s). Editorial review has
deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.