India's #1 AI Tutorformula-sheet · Mathematics · Chapter 12

Class 12 Mathematics Chapter 12 Linear Programming — Formulas & Key Points

Linear Programming is a method to achieve the best outcome (maximum profit or minimum cost) in a mathematical model with linear relationships. Chapter 12 in NCERT Class 12 Mathematics introduces two core skills: converting real-world optimization problems into mathematical formulation (objective function and constraints) and solving two-variable problems using the graphical method. This formula sheet consolidates every formula, definition, and procedural step you need for CBSE board exams, along with common pitfalls and memory aids.

Your child's private AI tutor — trained on NCERT.

3-day free trial · ₹1 to start · Cancel anytime.

Start 3-day free trial →

Key takeaways

✓Linear Programming optimizes (maximizes or minimizes) a linear objective function subject to linear inequality constraints and non-negativity restrictions.
✓The graphical method works only for two-variable problems; plot constraints, identify feasible region, find corner points, evaluate objective function.
✓Corner Point Theorem states that optimal value always occurs at a corner (vertex) of the feasible region.
✓Feasible region is the common solution area satisfying all constraints simultaneously; can be bounded or unbounded.
✓Mathematical formulation requires converting word problems into: Objective function Z = ax + by, constraints as inequalities, and x ≥ 0, y ≥ 0.
✓Unbounded feasible regions may or may not have optimal solutions; check boundary behavior for maximum/minimum problems.
✓Most CBSE board questions (4-6 marks) involve formulation, graphical solution, and corner point evaluation for diet/manufacturing/allocation problems.

Core Definitions and Terminology

Understanding the precise language of Linear Programming is critical for correct mathematical formulation and interpretation. These definitions form the foundation of every LPP problem you will encounter in CBSE Class 12 Mathematics. An optimization problem aims to find the best solution from all feasible solutions. A linear function has degree one in all variables (no x², xy, √x terms). Constraints are the restrictions or limitations under which the objective must be optimized. The feasible region is the set of all points that satisfy all constraints simultaneously; it is always a convex polygon (or unbounded convex region) when constraints are linear. A corner point (or vertex or extreme point) is where two boundary lines of the feasible region intersect. The Corner Point Theorem guarantees that if an optimal solution exists, it occurs at one of these corner points.

Decision variables: the unknowns (usually x and y) representing quantities to be determined
Objective function: linear function Z = ax + by to be maximized or minimized
Constraints: linear inequalities or equations limiting the decision variables
Feasible solution: any point (x, y) satisfying all constraints and non-negativity conditions
Optimal solution: the feasible solution that gives the best (maximum or minimum) value of Z
Bounded feasible region: enclosed polygon with finite area; always yields optimal solution
Unbounded feasible region: extends infinitely in some direction; may or may not have optimal solution

Standard Form of a Linear Programming Problem

Every Linear Programming Problem in CBSE Class 12 Mathematics must be written in a standard mathematical form before applying the graphical method. This standardization ensures clarity and systematic solution. The standard form consists of three components presented in a specific order. First, clearly state whether you are maximizing or minimizing the objective function. Second, list all constraints as linear inequalities or equations. Third, explicitly state the non-negativity restrictions which are always present unless the problem context allows negative values. Most CBSE board exam questions worth four to six marks begin with a word problem requiring you to formulate the LPP in this standard form before solving graphically. Missing any component costs marks even if your graphical work is correct.

Objective function: Optimize Z = c₁x + c₂y (where c₁, c₂ are constants)
Subject to constraints: a₁x + b₁y (≤, =, or ≥) d₁; a₂x + b₂y (≤, =, or ≥) d₂;...; aₙx + bₙy (≤, =, or ≥) dₙ
Non-negativity restrictions: x ≥ 0, y ≥ 0 (always required unless problem states otherwise)
Inequality direction: '≤' for at-most / upper-limit constraints; '≥' for at-least / lower-limit constraints
Constants on right side: always write constraints with variables on left, constant on right

Mathematical Formulation from Word Problems

Converting a word problem into mathematical formulation is a structured three-step process that appears in nearly every CBSE Class 12 Mathematics board exam. Step one: identify decision variables by finding what quantities need to be determined (usually production quantities, amounts, or allocations). Assign them x and y. Step two: frame the objective function by translating profit, cost, revenue, distance, or other quantity to be optimized into Z = ax + by form using the per-unit coefficients given in the problem. Step three: translate every restriction, limitation, or requirement into a linear inequality or equation. Resource availability becomes ≤ constraint, minimum requirement becomes ≥ constraint. Finally, append x ≥ 0, y ≥ 0. Common CBSE contexts include diet problems (minimize cost subject to nutritional requirements), manufacturing problems (maximize profit subject to resource constraints), and transportation problems (minimize distance subject to supply-demand constraints). Practice identifying these patterns to speed up formulation during exams.

Read the problem carefully and underline key quantities: what is being produced/allocated, what is being optimized, what are the limits
Create a table listing decision variables in columns and constraints in rows with their coefficients
Identify profit/cost/revenue per unit for objective function coefficients
Resource constraints (time, material, labor available): use ≤ inequality
Minimum requirement constraints (nutrition, quality standards): use ≥ inequality
Check units: all terms in one constraint must have the same unit (hours with hours, kg with kg)

Graphical Method — Complete Step-by-Step Procedure

The graphical method is the only technique taught in NCERT Class 12 Mathematics for solving Linear Programming Problems with two variables. It provides a visual representation of the feasible region and systematically finds the optimal solution. This method is reliable for two-variable problems and forms the core of board exam questions worth six marks. The procedure has seven distinct steps that must be followed in sequence. Step 1: Formulate the LPP in standard form (already covered above). Step 2: Convert each inequality constraint into an equation by replacing ≤ or ≥ with = to find the boundary line. Step 3: Plot each boundary line on the xy-plane by finding two intercepts (set x=0 to find y-intercept, set y=0 to find x-intercept) or any two convenient points. Step 4: Determine which side of each line satisfies the inequality by testing the origin (0,0) or another test point. Shade the feasible half-plane for each constraint. Step 5: Identify the feasible region as the common shaded area satisfying all constraints simultaneously along with x ≥ 0, y ≥ 0. Step 6: Find all corner points (vertices) of the feasible region by solving pairs of intersecting boundary line equations. Step 7: Evaluate the objective function Z at each corner point and select the point giving maximum (for maximization) or minimum (for minimization) value of Z. That point is the optimal solution.

Always draw axes with appropriate scale to accommodate all intercepts clearly
Mark x ≥ 0 and y ≥ 0 by restricting graph to first quadrant (unless problem allows negative values)
For ax + by ≤ c: shade the region towards origin if origin satisfies the inequality, away if it does not
For ax + by ≥ c: shade the region away from origin if origin does not satisfy the inequality
Corner points: intersection of two constraints, intersection of constraint with x-axis (y=0), intersection of constraint with y-axis (x=0)
If feasible region is unbounded, check if maximum or minimum actually exists by examining boundary behavior

Corner Point Theorem and Optimization

The Corner Point Theorem is the theoretical foundation of the graphical method taught in NCERT Class 12 Mathematics Chapter 12 Linear Programming. It states that for a bounded feasible region, the optimal value (maximum or minimum) of the objective function Z = ax + by always occurs at one or more corner points of the feasible region. This powerful result means we do not need to test every point in the (infinite) feasible region; we only evaluate Z at the finite number of corner points. In case of a tie (two or more corner points yielding the same optimal Z), the optimal value occurs at every point on the line segment joining those corner points, giving infinitely many optimal solutions. For unbounded feasible regions, the theorem still holds for the minimum value, but maximum value may not exist at all. The theorem simplifies optimization to an algebraic exercise: find coordinates of all corner points by solving simultaneous equations, substitute into Z, compare values. This is why CBSE board examiners award separate marks for correctly identifying corner points and for correctly evaluating Z at each point.

Bounded feasible region (closed polygon): optimal solution always exists at a corner point
Unbounded feasible region: minimum may exist at corner point, maximum may be unbounded (no finite maximum)
If two adjacent corner points yield the same optimal Z, every point on the edge connecting them is also optimal
To find corner points: solve each pair of intersecting boundary line equations simultaneously
Verify each corner point lies within the feasible region (satisfies all original inequalities)
For exam: present corner points in a table with columns: Corner Point, x-coordinate, y-coordinate, Z = ax + by

Formulas and Key Expressions — Quick Reference Table

Below is a consolidated table of every formula, expression, and standard result you must remember for CBSE Class 12 Mathematics Chapter 12 Linear Programming board exams. These are not derivable on the spot; they must be memorized and practiced. The table format helps quick last-minute revision. Bookmark this section for the night before your exam. Each formula is presented with its name, the exact mathematical statement, and the context or condition under which it applies. While Linear Programming does not have as many formulas as Calculus or Algebra chapters, the precision of formulation and the systematic graphical procedure steps constitute the formulaic knowledge for this chapter. Ensure you can write the standard form, execute each graphical method step, and apply the corner point theorem without hesitation. These are the building blocks of every LPP solution in your board exam and NCERT Class 12 Mathematics solutions.

Objective function always written as Z = c₁x + c₂y where c₁, c₂ are constants derived from problem context
Constraint inequality ax + by ≤ c means boundary line is ax + by = c and feasible half-plane includes the line
Non-negativity: x ≥ 0 restricts solution to right of y-axis; y ≥ 0 restricts solution above x-axis; together first quadrant
Intercepts for line ax + by = c: x-intercept (c/a, 0) when y=0; y-intercept (0, c/b) when x=0
Slope of ax + by = c is -a/b; use to check parallelism or perpendicularity if needed

Common Mistakes and Sign Conventions

CBSE board exam answer scripts reveal recurring errors in Linear Programming solutions that cost students easy marks. Recognizing and avoiding these pitfalls is as important as knowing the formulas themselves. First, many students forget to write non-negativity restrictions x ≥ 0, y ≥ 0 explicitly; even though implied, examiners deduct marks if omitted. Second, inequality direction errors: 'at most' translates to ≤, 'at least' to ≥, 'exactly' to =; mixing these reverses the feasible region. Third, when converting word problems, ensure profit/cost coefficients are correctly assigned to x and y in the objective function. Fourth, after plotting, students sometimes shade the wrong half-plane; always verify by testing a point (usually origin). Fifth, corner points must be verified to lie in the feasible region; solving two boundary equations may yield a point outside the actual feasible area. Sixth, for unbounded regions, stating that maximum is unbounded requires checking boundary behavior, not just empty corner point evaluation. Seventh, units mismatch in formulation: if one constraint is in hours and another in minutes, convert to common unit. Eighth, presenting the final answer: state the optimal solution as a complete sentence — 'Maximum profit is ₹500 when x=10 and y=20' not just 'Z=500'.

Inequality reversal mistake: 'at most 10' is x ≤ 10, not x ≥ 10
Non-negativity omission: always write x ≥ 0, y ≥ 0 even if obvious
Graph scale errors: choose scale so all corner points fit; label axes clearly with variable names
Sign error in objective function: profit is maximized (Z = profit), cost is minimized (Z = cost)
Corner point outside feasible region: always substitute back into original inequalities to verify
Unbounded maximum claim: if region is unbounded upwards and you are maximizing, Z may have no finite maximum; must verify
Final answer format: write complete sentence with units and variable values, not just Z-value

Three Solved Mini-Examples Applying Key Formulas

Worked examples demonstrate how to apply Linear Programming formulation and graphical method in real CBSE exam scenarios. Each example below is solved step-by-step, mirroring the mark allocation in board exams. Study these carefully and practice similar problems from NCERT Class 12 Mathematics Chapter 12 exercise questions and CBSE sample papers. Example 1 is a manufacturing maximization problem, Example 2 is a diet minimization problem, and Example 3 illustrates an unbounded feasible region case. These three patterns cover the majority of board exam question types. For additional practice and instant doubt resolution, students can upload their Linear Programming problems on CBSETUTOR.ai where an AI tutor provides step-by-step solutions 24×7. At just ₹999 per month for all subjects and classes 6 to 12, it is an affordable way to ensure no concept remains unclear, especially during board exam preparation when timely help matters most. A three-day free trial lets you test the platform before committing.

Memory Tricks and Mnemonics for Quick Recall

Mnemonics and memory aids help retain the procedural steps and formulation rules of Linear Programming, especially under exam pressure. Use the acronym 'FOCUS' to remember the graphical method steps: F = Formulate in standard form; O = Obtain boundary lines by converting inequalities to equations; C = Chart the graph by plotting intercepts; U = Uncover feasible region by testing and shading; S = Solve for corner points and evaluate Z at each. For inequality direction, remember 'A-LE' and 'A-GE': 'At most' → Less than or Equal ≤; 'At least' → Greater than or Equal ≥. For non-negativity, think 'First quadrant only' unless told otherwise. To avoid missing constraints, use the checklist mnemonic 'OCEAN': Objective function written? Constraints all listed? Each inequality direction checked? All non-negativity conditions stated? Number of corner points equals number of boundary intersections in feasible region? These simple memory devices reduce careless errors and speed up revision during the last week before CBSE Class 12 Mathematics board exams. Practice recalling them without looking at notes to build automaticity.

FOCUS: Formulate, Obtain boundaries, Chart graph, Uncover feasible region, Solve corner points
A-LE / A-GE: At most → ≤, At least → ≥
OCEAN checklist: Objective? Constraints? Each direction? All non-negativity? Number of corners?
Shade rule: For ≤ origin test true → shade origin side; For ≥ origin test false → shade away from origin
Corner mnemonic: 'Lines meet at corners' — solve pairs of boundary equations
Optimization rhyme: 'Max seeks peak, Min seeks valley' — evaluate Z at every corner, pick highest for max, lowest for min

Last-Minute Revision Box — One-Glance Summary

This concise box consolidates the entire chapter into rapid-recall points for the final hour before your CBSE Class 12 Mathematics board exam. Read this section once, close your eyes, and mentally rehearse each point. If you can recall all items below, you are exam-ready for Chapter 12 Linear Programming. Linear Programming optimizes a linear objective Z = ax + by subject to linear constraints and x ≥ 0, y ≥ 0. Mathematical formulation: identify decision variables, write objective function, translate word constraints into inequalities, append non-negativity. Graphical method (2 variables only): convert inequalities to equations, plot boundary lines using intercepts, test origin to determine feasible half-plane, shade common feasible region in first quadrant, find corner points by solving boundary intersections, evaluate Z at each corner, select max or min as required. Corner Point Theorem: optimal value always at a corner of bounded feasible region. Unbounded region: minimum may exist, maximum may be unbounded. Common mistakes: forgetting x ≥ 0, y ≥ 0; wrong inequality direction (at most ↔ ≤, at least ↔ ≥); shading wrong side; not verifying corner points; incomplete final answer. Present answer as full sentence with units and variable values. Practice NCERT exercise 12.1 and 12.2 thoroughly; most board questions mirror these patterns. Keep graph paper, ruler, and sharp pencil ready for neat diagrams in the exam.

Standard form: Optimize Z = ax + by subject to linear inequalities and x ≥ 0, y ≥ 0
Graphical method: plot boundaries, shade feasible region, find corners, evaluate Z, pick optimal corner
Corner Point Theorem: optimal at a vertex (bounded region); unbounded may have no max
Formulation from word problem: decision variables → objective → constraints → non-negativity
At most → ≤; At least → ≥; Exactly → =
Always verify corner points satisfy all original inequalities; always state final answer with units and variable values
NCERT exercise 12.1 (formulation practice) and 12.2 (graphical method) are your primary question sources

Frequently asked questions

What is the Corner Point Theorem in CBSE Class 12 Linear Programming?+

The Corner Point Theorem states that for a bounded feasible region, the optimal value (maximum or minimum) of the objective function Z always occurs at one or more corner points (vertices) of the feasible region. This allows us to evaluate Z at a finite number of corners instead of testing infinite points in the region, making the graphical method practical and systematic for board exams.

How do I convert 'at most' and 'at least' into inequalities?+

'At most k' means the quantity cannot exceed k, so use ≤ k. 'At least k' means the quantity must be k or more, so use ≥ k. For example, 'at most 10 hours available' becomes x + y ≤ 10; 'at least 5 units required' becomes x + y ≥ 5. This is a frequent source of marks in formulation steps.

Why do we always write x ≥ 0 and y ≥ 0 in Linear Programming problems?+

Non-negativity restrictions x ≥ 0 and y ≥ 0 ensure decision variables represent real-world quantities like production amounts, distances, or costs, which cannot be negative. These restrictions confine the feasible region to the first quadrant of the graph. CBSE examiners expect you to state them explicitly; omitting them loses marks even if the rest of your solution is correct.

What is the difference between bounded and unbounded feasible regions?+

A bounded feasible region is a closed polygon with finite area, guaranteeing that both maximum and minimum values of Z exist at corner points. An unbounded feasible region extends infinitely in some direction; it always has a minimum at a corner point, but the maximum may be unbounded (no finite maximum). Recognizing this distinction is critical when answering optimization questions in the board exam.

How do I find corner points of the feasible region graphically?+

Corner points occur where two boundary lines intersect. First, convert each inequality constraint to an equation. Then solve each pair of boundary equations simultaneously to find intersection coordinates. Also check intersections of boundaries with the x-axis (set y=0) and y-axis (set x=0). Verify each candidate point satisfies all original inequalities to confirm it lies in the feasible region. Present corner points in a table for clarity in your exam answer.

Can the optimal solution occur at more than one point?+

Yes. If two adjacent corner points yield the same optimal value of Z, then every point on the line segment joining them is also an optimal solution, giving infinitely many optimal solutions. This happens when the objective function line is parallel to one edge of the feasible region. State this explicitly if it occurs in your board exam answer to earn full marks.

What are the most common mistakes students make in Linear Programming board exams?+

Common errors include: forgetting to write x ≥ 0, y ≥ 0 explicitly; using wrong inequality direction (mixing ≤ and ≥); shading the incorrect half-plane; not verifying corner points lie within the feasible region; omitting units or variable values in the final answer; mixing units in formulation (e.g., hours and minutes); and failing to check if an unbounded maximum exists. Practicing NCERT exercises carefully prevents these mistakes.

How many marks is Chapter 12 Linear Programming worth in CBSE Class 12 board exams?+

Typically one question of 6 marks appears in the CBSE Class 12 Mathematics board exam, sometimes split into formulation (2-3 marks) and graphical solution (3-4 marks). Occasionally a 4-mark question on graphical method alone is asked. In either format, neat graph, clearly labeled corner points, and complete final answer statement are essential for full marks. Practice prior year papers to see exact mark allocation patterns.

Is the graphical method the only technique required for CBSE Class 12 Linear Programming?+

Yes, NCERT Class 12 Mathematics Chapter 12 covers only the graphical method, which is limited to two-variable problems. More advanced techniques like the Simplex method (for more than two variables) are not in the CBSE syllabus for Class 12. Focus your preparation entirely on formulation, plotting, identifying feasible region, corner point evaluation, and applying the Corner Point Theorem as per NCERT exercises and board exam patterns.

How does CBSETUTOR.ai help with Linear Programming doubts and practice?+

CBSETUTOR.ai offers 24×7 AI-powered tutoring for CBSE Class 12 Mathematics, including Chapter 12 Linear Programming. Students can upload photos of their graph or formulation, and the AI tutor provides instant step-by-step solutions, highlights mistakes, and suggests corrections. At ₹999 per month for all subjects and classes 6-12, with a 3-day free trial, it is an affordable and flexible tool for clearing doubts anytime, especially during late-night revision sessions before board exams.

Related resources

CBSE Class 12 Mathematics Chapter 12 Linear Programming Worksheet with Answers Important Questions: CBSE Class 12 Mathematics Chapter 12 Linear Programming Important Questions: CBSE Class 12 Mathematics Chapter 11 Three Dimensional Geometry Class 12 Mathematics Chapter 11 Three Dimensional Geometry — Formulas & Key Points AI Tutor for Class 12: The Smart Alternative to Tuition AI Tutor for Class 12 Accountancy: Learn Faster with Instant Help Class 9 Coordinate Geometry Chapter 3: Cartesian System & Plotting Points Class 9 Mathematics Chapter 2 Polynomials — Formulas & Key Points

Keep learning — related guides

Class 12Mathematics

Class 12 Mathematics Chapter 13 Probability — Formulas & Key Points

Class 12Mathematics

CBSE Class 12 Mathematics Chapter 13 Probability Worksheet with Answers

Class 12Mathematics

Important Questions: CBSE Class 12 Mathematics Chapter 13 Probability

Class 12Mathematics

Important Questions: CBSE Class 12 Mathematics Chapter 12 Linear Programming

Class 12Mathematics

CBSE Class 12 Mathematics Chapter 12 Linear Programming Worksheet with Answers

Class 12Mathematics

CBSE Class 12 Mathematics Chapter 11 Three Dimensional Geometry Worksheet with Answers

Ready to give your Class 12 child the tutor that never sleeps?

CBSETUTOR.ai covers every chapter in the Class 12 NCERT syllabus — Maths, Science, Social Science, English, Hindi and more. 24×7. Patient. Unlimited. 3-day free trial.

Start your child's 3-day free trial →