Exercises · Grade 12
Linear programming and constrained optimization — Grade 12 math exercises
Open an exercise and the tutor guides you step by step: it asks questions and checks each step, without giving the answer.
- Exercise 1 — Translate a resource model into inequalities (easy)
- Exercise 2 — Find the vertices of a bounded feasible polygon (easy)
- Exercise 3 — Describe a whole edge of optimal solutions (easy)
- Exercise 4 — Minimize a blend cost on an unbounded region (medium)
- Exercise 5 — Distinguish infeasibility from an unbounded objective (medium)
- Exercise 6 — Check slack and redundant constraints (medium)
- Exercise 7 — State the valid range of a sensitivity formula (medium)
- Exercise 8 — Respect indivisible quantities (hard)
- Exercise 9 — Compare worst-case and average-case objectives (hard)
- Exercise 10 — Plan for a capacity that may be reduced (hard)