Course contentsShow
← Mathematics
Lesson 308 of 3,1218. Systems of Linear Equations and InequalitiesFree lesson

Applications: Maximization Problems

Apply linear programming to maximize profit, production, or other quantities given resource constraints.

Applications: Maximization Problems

What You'll Learn

You'll learn how to use linear programming to find the maximum profit, production, or output when facing real-world resource limits.

The Real-World Challenge

Imagine you run a bakery that makes cookies and brownies. You have limited flour, sugar, and oven time. Each treat requires different amounts of these resources and earns different profits. How do you decide what to bake to make the most money?

This is a maximization problem—you want to maximize something valuable (profit) while respecting constraints (your limited resources).

How Linear Programming Solves This

Linear programming turns this real-world problem into mathematics:

  1. Define variables: Let x = number of cookies, y = number of brownies
  2. Write the objective function: This is what you want to maximize. For example, if cookies earn 2andbrowniesearn2 and brownies earn 3, then P = 2x + 3y (your total profit)
  3. Write constraint inequalities: These represent your limits—flour, sugar, time, plus x ≥ 0 and y ≥ 0 (you can't make negative treats!)
  4. Graph the feasible region: This shows all possible production combinations
  5. Find corner points: Calculate coordinates of each vertex
  6. Evaluate the objective function: Plug each corner point into P = 2x + 3y
  7. Choose the maximum: The corner point giving the highest value is your answer

Why This Works

The Corner Point Theorem guarantees that the maximum value occurs at a vertex of the feasible region, so you only need to check those points—not every point inside the region.

Key Takeaway: Maximization problems use linear programming to find the best allocation of limited resources by evaluating the objective function at all corner points of the feasible region and selecting the largest value.