Linear Programming Problems
Insert each constraint function and objective function based on your worksheet into the input. After that, find the intersection between two lines using "intersect" that lying on toolbar.
The objective function corresponds to the value to be maximized or minimized (M in this case).
The feasible region determined by the set of inequalities is the unshaded region.
Drag the slide bar for M up and down to determine which vertex of the feasible region yields the maximum value of M.
Which yields the minimum?
Created by Kathryn Brenneman
for MA 114 Finite Mathematics at North Carolina State University, Fall 2011