Notes · Class 12 · CBSE · Commerce Mathematics
Linear Programming notes
Revision notes for the chapter: the key points, definitions and exam tips to remember.
Linear programming finds the best (maximum or minimum) value of a linear objective under linear constraints.
KEY TERMS
- Objective function Z = ax + by.
- Constraints: linear inequalities; non-negativity x, y ≥ 0.
- Feasible region: common region satisfying all constraints. Each point is a feasible solution.
- Optimal solution: feasible point giving the best Z.
CORNER POINT METHOD
- 1.Draw the constraint lines and shade the feasible region.
- 2.Find the corner points.
- 3.Evaluate Z at each corner.
- 4.Bounded region: max and min are at corner points.
- 5.Unbounded region: check with an extra inequality (e.g. ax + by > M) whether the max/min truly exists.
TYPES OF PROBLEMS
- Manufacturing, diet, transportation, allocation.
Memory hook: "The best answer always sits on a corner."
Linear Programming: practice questionsLinear Programming cheat sheet
More Class 12 · CBSE · Commerce Mathematics notes
Practise Linear Programming
Sign up free to practise the full chapter after revising. Questions you get wrong come back until you've mastered them.
Start practising freeFree to start · No credit card needed