Linear Programming Class 12 Notes PDF 2026-27 | Applied Mathematics Chapter 14 Skip to content
Smart Notes for Every Exam · instant PDF download after payment +91 92520 37565
Class 12 · Applied Mathematics · Chapter 14

Linear Programming: complete notes

Neat, exam-ready notebook-style notes for Linear Programming, following your NCERT book. This chapter is part of the complete Complete Applied Maths Notes for Class 12 (CBSE 241, 2026-27, Board 2027).

Ruchi AgarwalVinay WadhwaniSubject experts: Ruchi Agarwal (B.Tech, M.Tech) and Vinay Wadhwani (B.Tech Electrical Engineering)

Cover of Complete Applied Maths Notes for Class 12 (CBSE 241, 2026-27, Board 2027)
Get all 14 chapters of Class 12 Applied Mathematics
US$2.99US$3.9920% off
Free sample

Free: NCERT solutions for Class 12 Maths Chapter 12: Linear Programming →

Test yourself: Chapter 14 online MCQ test, free: 13 questions, 15 minutes, instant score and solutions →

Board questions: Linear Programming: CBSE previous year questions with solutions →

Free preview: Linear Programming notes

A quick look at the chapter from our Class 12 Applied Mathematics notes. The full chapter notes have the detailed explanations, diagrams and practice questions with answers.

Linear Programming Terms, types ★manufacturing, diet, transport Formulation ★★variables, Z, constraints Corner-point method ★★bounded, unbounded Iso-profit / iso-costmultiple, no solution
Chapter map from the notes

Topics in this chapter ★★★ very important · ★★ important · ★ asked sometimes

  1. 14.1 Linear programming problems and their formulation ★★
  2. 14.2 Solving graphically: the corner-point method ★★
  3. 14.3 Iso-profit / iso-cost method and special cases

Last-night summary

  • LPP: decision variables, linear objective, linear constraints, non-negativity.
  • Formulate from a data table: "at most" \(\le\), "at least" \(\ge\).
  • Corner-point method: shade, find vertices, table of \(Z\); bounded ⇒ max and min exist.
  • Unbounded: check the open half-plane before declaring an optimum.
  • Special cases: multiple optima (edge parallel to \(Z\)), unbounded, infeasible.
  • A: A bounded feasible region gives both a maximum and a minimum. R: They occur at corner points of the region.
  • A: Every LPP has an optimal solution. R: Optimal values occur at corner points.
  • A: Min \(Z=5x-2y\) on \(2x+3y\ge1\), \(x,y\ge0\) does not exist. R: The half-plane \(5x-2y<-\frac23\) meets the feasible region.
  • A: Max \(Z=-x+2y\) on \(-0.5x+y\le2\), \(x-y\le-1\), \(x,y\ge0\) has infinitely many optimal points. R: The objective line is parallel to a boundary edge of the region.
  • A: \(x\ge0\), \(y\ge0\) are non-negativity constraints. R: Quantities produced cannot be negative.
  • A: For a maximum, the iso-profit line is moved away from the origin. R: For positive coefficients, \(Z\) increases as the line moves away from O.

What is inside the full chapter notes

  • Concept notes with methods, graphs and worked examples
  • CBSE support material "Check your progress" (Q1–9), fully solved
  • CBSE PYQs 2024–2026, fully solved
  • Quick-reference sheet (p. 8); practice A–G, 20 MCQs, 6 A–R, answers, summary
See real pages (free sample)

What you get in the pack

All chapters in this pack

  1. Numbers, Quantification and Numerical Applications
  2. Numerical Inequalities
  3. Matrices
  4. Determinants
  5. Differentiation
  6. Applications of Derivatives
  7. Integrals
  8. Differential Equations
  9. Probability Distributions
  10. Inferential Statistics
  11. Time-based Data
  12. Perpetuity, Sinking Funds and EMI
  13. Returns, Growth and Depreciation
  14. Linear Programming
← Returns, Growth and Depreciation

Prices shown in US dollars. Show prices in: ₹ INR · US$ USD