Applications: Minimization Problems
What you'll learn: How to use linear programming to find the lowest possible cost, waste, or time while still meeting all necessary requirements.
The Core Idea
While maximization problems help you earn the most or produce the most, minimization problems help you spend the least or waste the least. You're still working with constraints (your "must-have" requirements), a feasible region, and an objective function—but now your goal is to find the smallest value at the corner points.
Think of it like planning a diet: you need at least a certain amount of protein and vitamins each day (constraints), but you want to minimize your total cost or calories (objective function).
The Process
-
Identify what you're minimizing – cost, time, materials, waste, etc. This becomes your objective function, often written as
C = ax + bywhere you want the smallestC. -
Write your constraints – these are your minimum requirements ("at least 10 grams of protein," "no fewer than 3 workers," etc.). They become inequalities.
-
Graph the feasible region – shade where all constraints overlap.
-
Find corner points – identify all vertices of the feasible region.
-
Evaluate the objective function – plug each corner point into your minimization formula and choose the point giving the lowest value.
Example in Plain English
A factory must produce at least 50 units of Product A and 30 units of Product B daily. Product A costs 3. Find the cheapest way to meet these minimums.
Your objective: Minimize C = 2A + 3B
Your constraints: A ≥ 50, B ≥ 30
The corner point (50, 30) gives C = 2(50) + 3(30) = $190 — your minimum cost.
Key Takeaway: Minimization problems use linear programming to find the lowest value of your objective function at a corner point of the feasible region, ensuring all minimum requirements are met.