2017-04-10 SFXC F.5C Linear Programming 03
- 作者：
- johnmayhk
Suppose the polygon ABCDE is the feasible region R for certain constraints.
Drag P in R. See the changes of values of different expressions shown.
Click the check boxes for the lines.
With the help of the lines, or otherwise, find the maximum and minimum values of the expressions.