This applet is intended to solve Linear Programming problems of two variables.
To enter your inequalities into the program, simply enter the coefficients into the fields in the top-left, then press the "Add" button, which will add the inequality to the list of inequalities to graph on the far right. The checkbox labeled "x,y >= 0" automatically adds those two inequalities to the list you enter.
You must also enter the governing Maximum or Minimum equation in the space below the "Add" and "Clear" buttons.
When you're done entering your inequalities, press the "Solve" button and a graph of the Feasability Set should pop up in the bottom-left. The Max (or Min) value will appear in the field labeled "Solution" and the Max/Min point will be circled in red on the graph. The boxes labeled "Found at" and "All Points" list the points at which the Max/Min was found and all points of intersection, respectively.
Note 1: The Max's and Min's reported by this program are the largest and smallest values calculated by inserting the points of intersection on the graph into the Max/Min equation. Therefore, non-closed Feasibility Sets may yield technically incorrect solutions, when Infinity or Negative Infinity are the actual answers. Just bear in mind what the Max's and Min's are really calculations of.
Note 2: Because Max's and Min's are calculated this way, non-closed Feasibility Sets that span more than one quadrant of the Cartesian plane won't have correct Max's and Min's either. The true Max's and Min's here may also be Infinity and Negative Infinity, which go beyond the scope of this program.
Thank you, and enjoy.