1. Linear Programming

2. Example

3. x:x:Number of cars built Define the Variables Does it matter? y:y:Number of trucks built

4. Constraints and Feasible Region Constraints Vertices of the Boundary Cars: x-axis Trucks: y-axis Feasible Region Graph the System: True Test Point (0,0) Wheels: Seats: Gas Tanks: Non- Negative

5. Critical Points and Conclusion Otto should build 3 cars and 4 trucks for $11. CONCLUSION: Write an equation to represent Otto’s 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