The student will be able to solve systems of linear equations and linear programming problems, including setting up a system of constraints, graphing the system, and identifying the optimum values.
Two straight lines y=mx+c and y=nx+d are displayed.
The x coordinate of the point at which the lines intersect (indicated by the green arrow) will be the solution to the equation: mx+c = nx+d
Move points B and C. When do the fruits change?
How many solutions can such equations have? At most? At least?
Modified by Steven Lapinski, Created with GeoGebra
This link takes you to a linear programming problem with a complete solution, created by EDC, funded by the NSF. edc.org