Notes · JEE Preparation 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 JEE Preparation Mathematics notes
- Sets
- Relations and Functions (Class 11)
- Trigonometric Functions
- Complex Numbers and Quadratic Equations
- Linear Inequalities
- Permutations and Combinations
- Binomial Theorem
- Sequences and Series
- Straight Lines
- Conic Sections
- Introduction to Three Dimensional Geometry
- Limits and Derivatives
- Statistics
- Probability (Class 11)
- Relations and Functions (Class 12)
- Inverse Trigonometric Functions
- Matrices
- Determinants
- Continuity and Differentiability
- Application of Derivatives
- Integrals
- Application of Integrals
- Differential Equations
- Vector Algebra
- Three Dimensional Geometry
- Linear Programming
- Probability (Class 12)
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