Linear Programming Exploration

This applet provides a modifiable template that allows you to graph up to a maximum of 4 linear inequalities (constraints c, d, e, and f).
When graphing solution sets to systems of linear inequalities, it is automatically assumed (by default) that both [i]x[/i] and [i]y[/i] are greater than or equal to zero (see constraints [i]a[/i] and [i]b[/i]). [br][b][br]Begin by clicking OFF each of the buttons.[/b][br]1. Click on each constraint one at a time. What do you NOTICE?[br]2. Click on the SHOW buttons, one at a time. What do you NOTICE?[br]3. What are the maximum and minimum values?[br][b][color=#ff00ff]The feasible region will be shaded in pink. [/color][/b]What does this region represent?[br][br][b]Try another example.[/b][br]1. Change each of the following constraints as indicated below. Type it in as you see below. The program will change it.[br] c : 2x + 3y >= 12 [br] d : 7x + 4y >= 28[br] e : y <=6[br] f : x <= 5[br]What do you notice? How is this the same as the first example?[br]What are the minimum and maximum values?[br][br][color=#0000ff][b]Additional feature: [/b][/color]You can use the [b]INTERSECT[/b] tool to determine the point ([i]x[/i], [i]y[/i]) at which any two boundary lines intersect.

Information: Linear Programming Exploration