01 · Learn the idea
Translate resources
A workshop plans x posters and y models. A poster takes 2 work units and 1 material unit; a model takes 1 work unit and 3 material units. The limits are 12 work units and 15 material units. With nonnegative quantities, the system is 2x+y≤12, x+3y≤15, x≥0, y≥0. Actual products require integer counts.
Graph solid boundaries and shade the common region. The non-axis boundaries meet at (4.2, 3.6), found by substitution. The continuous polygon has vertices(0, 0), (6, 0), (4.2, 3.6), (0, 5). A feasible region can have noninteger vertices even when the real plan needs whole products.
02 · Build understanding
Test rather than guess
Test (4, 3): work 11 and material 13, so it passes. Test (5, 3): work 13, so it fails despite satisfying the material limit. Test (3, 4): work 10 and material 15, so it passes. Use a table to list integer pairs in the region. Then change the material boundary to a strict inequality and explain which boundary plans disappear.
Apply and explain
Your turn
Submit equations, a labeled feasible-region graph, all integer candidates with x=3 or 4, and a recommended feasible plan. Explain how each constraint affects the choice.
Use paper or explain your thinking aloud before opening the solution.
Check your reasoning
For x=3, integers y=0 through 4 work; for x=4, y=0 through 3 work. An acceptable recommendation satisfies every inequality, not merely one.
- Resource inequalities
- Boundary styles
- Intersection shading
- Candidate substitution
- Integer/context distinction
Ready to practice?
Try the questions, get feedback, and review your reasoning.
Choose a plan inside every constraint practice →