Constraint and optimization setup
Linear inequalities · Stage 3
Recognize the pattern
A linear objective reaches its maximum at a feasible vertex.
Useful ruleFeasible region
Build on: ALG-13
Try it before reading the solution
Maximize 3x + 2y for x,y ≥ 0 and x + y ≤ 4. What is the maximum?
This teaching example is original and is not an official SAT question.
Reasoning
Vertices are (0,0), (4,0), (0,4); their values are 0, 12, 8.
Answer12
03 · Next step
See membership →Ready for adaptive practice
Practice questions remain in English, as on the SAT.