Consider our prototype example with the unit profit of item tex2html_wrap_inline1429 being 600ドル instead of 200ドル. Under this modification, the problem isoprofit lines become:
displaymath1643
and they are parallel to the line corresponding to the first problem constraint:
displaymath1645
Therefore, if we try to apply the optimizing technique of the previous paragraph in this case, we get the situation depicted below (Figure 4), i.e., every point in the line segment CD is an optimal point, providing the optimal objective value of 24,000ドル.
[画像:figure252]
Figure 4: An
LP with many optimal solutions
It is worth-noticing that even in this case of many optimal solutions, we have two of them corresponding to ``corner'' points of the feasible region, namely points C and D.
