Linear Programming

1
Linear Programming
2
Example
3
Define the Variables
x
Number of cars built
y
Number of trucks built

• Does it matter?

4
Constraints and Feasible Region
Non-Negative
Constraints

• Cars x-axis
• Trucks y-axis

Wheels Seats Gas Tanks
Vertices of the Boundary
Graph the System
True
Test Point (0,0)
True
True
Feasible Region
5
Critical Points and Conclusion
Write an equation to represent Ottos total
profit (P) if he makes 1 on each car and 2 on
each truck
P x 2y
Test every critical point in the profit equation
to see which combination of cars and trucks will
maximize the profit
CONCLUSION
Otto should build 3 cars and 4 trucks for 11.