Professional Documents
Culture Documents
(20, 0)
S
2 S + 3 E <= 30
(0, 10)
(15, 0)
S
2/3 S + 2 E <= 16
(0, 8)
(24, 0)
S
(0, 16)
16/3 S + 4 E <= 64
(12, 0)
S
(0, 16)
(0, 40/3)
(0, 10)
(0, 8)
(0, 8)
(6, 6)
(9, 4)
(0, 0) (12, 0)
S
Z = 560
(0, 8)
(6, 6)
(9, 4)
Z = 400
(0, 0) (12, 0)
S
(16, 0) X
(8, 0) X
(0, 12)
(12, 0) X
(0, 20)
Z=9K
(8, 4)
Z=4K
(16, 0)
X
1. The set of feasible plans is called the feasible set or feasible region. It is always
polygonal or polyhedral.
6. Geometrically, an inactive constraint is one that does not pass through the
optimal solution.
7. There may be more than one optimal solution to a linear program, i.e., there
may be multiple optima.