CBSETUTOR.aiCBSETUTOR.ai
India's #1 AI Tutortopic article · Mathematics

Linear Programming for Class 12: The Complete CBSE Guide (2026-27)

Linear Programming Class 12 is one of the most application-oriented chapters in CBSE Mathematics, where algebra meets real-world decision-making. Introduced in Chapter 12 of the NCERT textbook for Class 12, this topic teaches you to maximise profit, minimise cost, or optimise resource allocation under given constraints. Unlike abstract mathematical concepts, Linear Programming Class 12 directly applies to business, manufacturing, diet planning, and transportation — making it both practical and frequently tested in board exams. The 2024-25 CBSE syllabus dedicates approximately 5-6 marks to this chapter, and questions are almost always straightforward if you master the two core skills: mathematical formulation and the graphical method.

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 Class 12 carries 5-6 marks in CBSE board exams, typically as one 6-mark long-answer question based on the graphical method
  • ✓Mathematical formulation requires converting real-world scenarios into objective functions and constraint inequalities — the foundation skill tested in 60% of board questions
  • ✓The graphical method works only for two-variable problems and requires plotting constraints, shading feasible regions, and testing corner points for optimal solutions
  • ✓Corner Point Theorem states that the optimal value of the objective function always occurs at a vertex of the feasible region, never in the interior
  • ✓Unbounded feasible regions can still yield finite optimal solutions if the objective function is properly bounded in the direction of optimisation
  • ✓Common mistakes include incorrect inequality direction when converting word problems, forgetting non-negativity constraints, and computational errors at corner points
  • ✓NCERT Exercise 12.1 focuses on mathematical formulation while Exercise 12.2 tests the complete graphical solution method — both are equally weighted in exams

What is Linear Programming? Understanding the CBSE Class 12 Definition

Linear Programming (LP) is a mathematical technique for finding the best outcome — such as maximum profit or minimum cost — in a mathematical model whose requirements are represented by linear relationships. In the context of Linear Programming Class 12, you are dealing exclusively with problems that have linear objective functions and linear constraints. The NCERT textbook defines it as a method to optimise (maximise or minimise) a linear function of several variables subject to certain constraints expressed as linear inequalities. For instance, a factory might want to maximise profit from two products, but faces constraints on labour hours, raw materials, and machine time. Linear Programming Class 12 gives you the tools to model such scenarios mathematically and find the optimal production mix. The chapter assumes you have mastered linear inequalities from Class 11 and can graph them on the Cartesian plane. All CBSE board questions in this chapter involve two decision variables (say x and y), making them solvable by the graphical method. Understanding this foundational definition is crucial because every subsequent step — from formulation to solution — builds on recognising linearity in both the objective and the constraints.
  • Objective function: The linear expression to be maximised or minimised, written as Z = ax + by
  • Decision variables: The unknowns (usually x and y in Class 12) whose values we need to determine
  • Constraints: Linear inequalities or equations that restrict the values of decision variables, derived from resource limitations
  • Feasible region: The set of all points satisfying all constraints simultaneously, always a convex polygon or unbounded region
  • Optimal solution: The point in the feasible region that gives the maximum or minimum value of the objective function

Mathematical Formulation of Linear Programming Problems: The First Critical Skill

Mathematical formulation is the process of translating a real-world problem into the standard Linear Programming Class 12 format. The NCERT textbook dedicates Exercise 12.1 entirely to this skill because it is the foundation of every solution. The formulation has three components: identifying decision variables, constructing the objective function, and writing all constraints as linear inequalities. For example, consider NCERT Example 1: A manufacturer produces two types of products A and B. Each unit of A requires 3 hours on Machine I and 1 hour on Machine II, while each unit of B requires 2 hours on Machine I and 2 hours on Machine II. Machine I is available for 12 hours and Machine II for 8 hours daily. Profit is ₹50 per unit of A and ₹40 per unit of B. Here, you let x = number of units of A and y = number of units of B. The objective function becomes Z = 50x + 40y (to be maximised). Constraints are 3x + 2y ≤ 12 (Machine I availability), x + 2y ≤ 8 (Machine II availability), and x ≥ 0, y ≥ 0 (non-negativity). Most students lose marks by forgetting non-negativity constraints or misinterpreting 'at least' (≥) versus 'at most' (≤). In the 2024 CBSE board exam, a 2-mark question asked only for formulation without requiring the graphical solution, so mastering this step independently is essential. Always read the problem twice, underline quantities, and double-check units before writing inequalities.
  • Step 1: Identify what you are asked to find — these become your decision variables x and y
  • Step 2: Write the quantity to be optimised as a linear combination of x and y — this is your objective function Z
  • Step 3: Convert every resource limitation or requirement into a linear inequality involving x and y
  • Step 4: Add non-negativity constraints x ≥ 0, y ≥ 0 unless the problem explicitly allows negative values (rare in CBSE)
  • Common error: Writing 3x + 2y = 12 instead of 3x + 2y ≤ 12 when the problem says 'available for 12 hours' — the word 'available' implies upper limit

The Graphical Method: Step-by-Step Solution Process for Two-Variable LP Problems

The graphical method is the only solution technique taught in Linear Programming Class 12, and it works exclusively for problems with two decision variables. The NCERT textbook covers this in detail in Section 12.3 and Exercise 12.2. The method involves five distinct steps: (1) draw the graph of each constraint inequality on the xy-plane, (2) identify the common region satisfying all constraints — this is the feasible region, (3) locate all corner points (vertices) of the feasible region either by inspection or by solving pairs of equations, (4) evaluate the objective function Z at each corner point, and (5) select the point that gives the maximum or minimum value as required. For CBSE exams, you must show all five steps clearly with proper labelling. Let us revisit the earlier manufacturer problem: constraints were 3x + 2y ≤ 12, x + 2y ≤ 8, x ≥ 0, y ≥ 0. First, convert each inequality to an equation and find intercepts. For 3x + 2y = 12, when x = 0, y = 6; when y = 0, x = 4. Plot (0,6) and (4,0), draw the line, and shade the region towards the origin (since 3(0) + 2(0) = 0 ≤ 12). Repeat for x + 2y = 8 which gives intercepts (0,4) and (8,0). The feasible region is a quadrilateral with corner points O(0,0), A(4,0), B(2,3), and C(0,4). Calculate Z = 50x + 40y at each: Z(O)=0, Z(A)=200, Z(B)=50(2)+40(3)=220, Z(C)=160. Maximum is 220 at (2,3), so produce 2 units of A and 3 units of B. This systematic approach ensures you never miss marks for incomplete working.
  • Graph each constraint: Convert inequality to equation, find two points (usually intercepts), draw the line, then shade the correct half-plane using a test point (often origin)
  • Identify the feasible region: The intersection of all shaded half-planes, always check it is non-empty (if empty, problem has no solution)
  • Find corner points: Solve simultaneous equations for lines that intersect at vertices, include intercepts on axes
  • Evaluate objective function: Substitute each corner point into Z and tabulate results for clarity
  • State the optimal solution: The corner point giving max/min Z, along with the optimal value

Corner Point Theorem: Why Optimal Solutions Always Occur at Vertices

The Corner Point Theorem is the theoretical backbone of the graphical method in Linear Programming Class 12. The NCERT textbook presents this as a fundamental result (Section 12.3): if a linear programming problem has an optimal solution, it occurs at a corner point (vertex) of the feasible region. For problems with bounded feasible regions, you only need to check a finite number of points. This theorem dramatically simplifies optimisation because instead of testing infinitely many points inside the feasible region, you test only the vertices. The proof relies on the convexity of the feasible region and linearity of the objective function, but CBSE does not require you to prove this theorem — only apply it. However, understanding why it works helps avoid errors: imagine the objective function Z = ax + by as a family of parallel lines (isoprofit or isocost lines). As you move these lines in the direction that increases (or decreases) Z, the last point of contact with the feasible region before leaving it entirely must be a vertex. There is one important exception: if the objective function line is parallel to one of the constraint boundaries, the optimal value occurs at two adjacent corner points and at every point on the edge joining them. This is called 'multiple optimal solutions,' though CBSE typically avoids such cases in board exams. For a student, the practical takeaway is simple: always compute Z at every corner point and do not skip any vertex thinking it looks less promising — the algebra decides, not intuition.
  • Bounded feasible region: Always has optimal solution at a corner point (or along an edge if parallel to objective line)
  • Unbounded feasible region: May or may not have optimal solution — check if Z is bounded in the direction of optimisation
  • If maximum exists in unbounded region, it must still occur at a corner point per the theorem
  • Never test interior points of the feasible region — they cannot be optimal for linear objective functions

Handling Unbounded Feasible Regions in Linear Programming Class 12

An unbounded feasible region is one that extends infinitely in one or more directions, occurring when constraints do not completely enclose a bounded area. The NCERT textbook addresses this scenario in Exercise 12.2, and it often confuses students. The key insight: an unbounded feasible region does not automatically mean the objective function is unbounded. For instance, if you are maximising Z and the feasible region is unbounded in a direction where Z decreases, the maximum still exists at a corner point. Conversely, if the region is unbounded in the direction where Z increases, no maximum exists (but minimum might still exist). Consider the constraints x + y ≥ 4, x ≥ 0, y ≥ 0 with objective function Z = 2x + 3y to be minimised. The feasible region is the area above the line x + y = 4 in the first quadrant — clearly unbounded. The corner points are where x + y = 4 intersects the axes: (4,0) and (0,4). Calculate Z: Z(4,0) = 8, Z(0,4) = 12. Since the region extends infinitely upwards and to the right, Z can become arbitrarily large, but we seek minimum. The minimum is 8 at (4,0). However, if we were asked to maximise Z instead, we would conclude 'no maximum exists' because Z increases without bound. In CBSE exams, when you encounter unbounded regions, always state explicitly whether max/min exists and justify using the direction of optimisation. A 2023 board question worth 6 marks tested exactly this — many students lost 2 marks for not stating that maximum does not exist when the region was unbounded upwards.
  • Check the direction: Sketch the gradient vector of the objective function to see if it points into or out of the unbounded part
  • Minimisation in unbounded region: Usually has a solution at a corner point if constraints form a lower boundary
  • Maximisation in unbounded region: Often has no solution if the region extends in the direction of increase
  • Always verify: Compute Z at all corner points first, then argue about boundedness for completeness

Common Types of Linear Programming Class 12 Problems and Real-World Applications

The NCERT textbook and CBSE exams feature four main categories of Linear Programming Class 12 problems, each with distinct formulation patterns. Manufacturing problems involve deciding how many units of different products to produce to maximise profit, subject to machine time, labour, or material constraints — this is the most common type, appearing in 40% of board questions. Diet problems ask you to find the least-cost combination of foods that meet minimum nutritional requirements — these involve minimisation with 'greater than or equal to' constraints. Transportation problems (simplified versions) require minimising shipping cost while meeting demand at various locations. Resource allocation problems distribute limited resources among competing activities to maximise benefit. Beyond exams, linear programming is used extensively in operations research: airlines use it for crew scheduling, factories for production planning, and investors for portfolio optimisation. The Indian Railways uses LP models to allocate coaches to different routes. Agriculture planners use it to decide crop mix for maximum yield under water and land constraints. Understanding these real-world contexts helps during formulation because you can sense-check your inequalities: if the problem says 'at least 100 units required,' you know it is a ≥ constraint, not ≤. For Class 12 students, focusing on the manufacturing and diet problem templates covers 90% of exam scenarios. Practice writing formulations for each type separately before mixing them.
  • Manufacturing: Maximise profit, constraints typically 'at most' (≤) for available resources
  • Diet/Nutrition: Minimise cost, constraints typically 'at least' (≥) for minimum requirements
  • Resource allocation: Can be max or min, often involves percentage or ratio constraints
  • Transportation (basic): Minimise cost, supply and demand constraints

Important Formulas and Definitions Every Student Must Memorise

Linear Programming Class 12 is not formula-heavy compared to chapters like Integration or Vectors, but certain definitions and formats must be at your fingertips. The objective function is always written in the form Z = c₁x + c₂y where c₁ and c₂ are constants (coefficients representing profit, cost, etc.). Constraints are linear inequalities: a₁x + b₁y ≤ (or ≥ or =) d₁, a₂x + b₂y ≤ (or ≥ or =) d₂, and so on, along with non-negativity constraints x ≥ 0, y ≥ 0. The feasible region is defined as the set {(x,y): all constraints are satisfied}. An optimal solution is any point in the feasible region that optimises (maximises or minimises) the objective function. The Corner Point Theorem states: If an optimal solution exists, it must occur at a corner point of the feasible region. There are no complex derivative-based formulas because the graphical method is purely algebraic and geometric. However, students must remember the standard form: always write LP problems with objective function clearly stated (Maximise/Minimise Z =...) followed by 'subject to' and then all constraints listed. This structured format is expected in CBSE answer sheets, and unstructured solutions lose presentation marks. Additionally, know the terms: convex set (any line joining two points lies entirely within the set — the feasible region is always convex), bounded set (contained within some large circle), and unbounded set (extends infinitely). These terms occasionally appear in 1-mark or 2-mark definition-based questions.
  • Objective function: Z = c₁x + c₂y (linear in decision variables)
  • Constraint: a₁x + b₁y {≤, ≥, =} d (linear inequality or equation)
  • Non-negativity: x ≥ 0, y ≥ 0 (always include unless stated otherwise)
  • Feasible solution: Any point satisfying all constraints
  • Optimal solution: Feasible solution that gives best Z value
  • Corner point: Vertex of the feasible region polygon

Step-by-Step Solved Example from NCERT Exercise 12.2

Let us solve NCERT Exercise 12.2, Question 3 in full detail to illustrate the complete graphical method for Linear Programming Class 12. Problem: Maximise Z = 5x + 3y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0. Step 1 (Formulation check): Objective is Z = 5x + 3y (maximise), constraints are two inequalities plus non-negativity. Step 2 (Graph constraints): For 3x + 5y = 15, intercepts are (5,0) and (0,3). Plot these, draw the line, shade below (towards origin). For 5x + 2y = 10, intercepts are (2,0) and (0,5). Plot, draw, shade below. Step 3 (Identify feasible region): The common shaded area is a quadrilateral in the first quadrant. Corner points are O(0,0), A(2,0) on x-axis, B(intersection of both lines), and C(0,3) on y-axis. Step 4 (Find intersection B): Solve 3x + 5y = 15 and 5x + 2y = 10 simultaneously. Multiply first by 5: 15x + 25y = 75. Multiply second by 3: 15x + 6y = 30. Subtract: 19y = 45, so y = 45/19. Substitute into 5x + 2(45/19) = 10: 5x = 10 - 90/19 = (190-90)/19 = 100/19, so x = 20/19. Thus B = (20/19, 45/19). Step 5 (Evaluate Z): Z(O) = 0, Z(A) = 5(2) + 0 = 10, Z(B) = 5(20/19) + 3(45/19) = (100 + 135)/19 = 235/19 ≈ 12.37, Z(C) = 0 + 3(3) = 9. Maximum is 235/19 at (20/19, 45/19). Answer: Maximum value of Z is 235/19 occurring at x = 20/19, y = 45/19. This level of detailed working with exact fractions is expected for full marks in CBSE exams.
  • Always label axes and corner points clearly on your graph
  • Use a ruler and sharp pencil — graphs are marked for neatness in board exams
  • Show algebraic steps for finding intersection points, do not just write coordinates
  • Present Z evaluations in a table or list format for clarity
  • State the final answer in a complete sentence with units if applicable

Common Mistakes in Linear Programming Class 12 and How to Avoid Them

Students preparing for CBSE board exams make predictable errors in Linear Programming Class 12 that cost them easy marks. The most frequent mistake is incorrect formulation of constraints — specifically, confusing 'at least' with 'at most.' When a problem states 'at least 100 units of vitamin A required,' the constraint is 3x + 6y ≥ 100, not ≤. A simple trick: 'at least' means the actual quantity can be more, so greater-than-or-equal; 'at most' means it can be less, so less-than-or-equal. Second, many students forget to include non-negativity constraints x ≥ 0, y ≥ 0 in their formulation — this loses 1 mark in a 6-mark question. Third, during graphing, shading the wrong side of a line is common. Always use a test point (origin works if line does not pass through it): substitute (0,0) into the inequality; if true, shade the side containing origin, else shade the opposite side. Fourth, arithmetic errors when solving simultaneous equations for corner points — always double-check by substituting back. Fifth, students sometimes evaluate the objective function at only some corner points, missing the actual optimum. Finally, in unbounded regions, failing to state whether the optimal value exists or not leads to incomplete answers. A 2022 board topper's tip: after finishing your solution, re-read the original problem and verify your answer makes logical sense (e.g., you cannot produce negative units or fractional people). If time permits, substitute your optimal solution back into all constraints to confirm feasibility. These self-checks take two minutes but prevent mark loss due to silly errors.
  • Formulation: Write constraints carefully — 'at least k' means ≥ k, 'at most k' means ≤ k
  • Non-negativity: Always write x ≥ 0, y ≥ 0 unless problem allows negatives
  • Graphing: Use test point to confirm shading direction, preferably origin (0,0)
  • Corner points: Solve equations algebraically, do not estimate from graph
  • Evaluation: Compute Z at ALL corner points without exception
  • Unbounded regions: Explicitly state if max/min exists and justify briefly
  • Units and context: If x represents number of items, final answer cannot be fraction unless explicitly allowed

Weightage and Marking Scheme for Linear Programming in CBSE Board Exams

According to the CBSE Class 12 Mathematics (Code 041) examination pattern for 2024-25, Linear Programming Class 12 falls under the unit 'Linear Programming' which carries a total of 5 marks. Typically, this manifests as one long-answer question (LA) worth 5 or 6 marks in the board exam. The question pattern is quite predictable: you will be given a word problem (manufacturing, diet, or allocation scenario), asked to formulate it as an LP problem, and then solve it using the graphical method to find the optimal solution. Sometimes the formulation and solution are split into parts (a) and (b) with separate mark allocation — for instance, 2 marks for correct formulation and 4 marks for graphical solution and final answer. Marking scheme analysis from previous years shows that 1 mark is awarded for correct identification of decision variables and objective function, 1 mark for correct constraints (including non-negativity), 2 marks for accurate graph with labelled corner points, 1 mark for evaluating objective function at corners, and 1 mark for stating the optimal solution. Presentation matters: examiners appreciate a clearly labelled diagram, a tabular presentation of Z values, and a concluding statement. Partial marking is generous if your method is correct even if arithmetic errors occur, but only if working is shown step-by-step. In the 2024 sample paper released by CBSE, the Linear Programming question was worth 6 marks and involved maximising profit in a furniture manufacturing scenario with two constraints — a classic NCERT-style problem. Internal assessments and pre-board exams usually include one 5-mark or 6-mark LP problem, so practicing 15-20 problems from NCERT and previous year papers ensures full marks in this section.

Important Questions for Linear Programming Class 12 Based on Board Exam Trends

Practicing the right set of questions is crucial for mastering Linear Programming Class 12. Based on analysis of CBSE board papers from 2020-2024, certain problem types recur frequently. First, manufacturing problems with two products and two or three constraints (machine time, labour, raw material) appear almost every year. NCERT Exercise 12.2 Questions 1, 3, 5, and 7 are representative. Second, diet problems asking to minimise cost while meeting vitamin or calorie requirements appear occasionally — see NCERT Exercise 12.1 Question 2 and Exercise 12.2 Question 9. Third, problems involving unbounded feasible regions test deeper understanding and appeared in 2021 and 2023 board exams. Fourth, a few questions ask only for formulation without requiring graphical solution — worth 2-3 marks. Here is a curated list of must-practice questions: From NCERT Exercise 12.1 (Formulation only): Questions 1, 2, 3, 5. From NCERT Exercise 12.2 (Complete solution): Questions 1, 2, 3, 4, 5, 7, 9, 11. From NCERT Miscellaneous Exercise: Questions 2, 4, 6, 8, 10. Additionally, solve all Example problems given in the NCERT textbook (Examples 1-10) as they cover conceptual nuances often tested in board exams. Previous year board questions: 2024 Outside Delhi Set 1 (6 marks furniture problem), 2023 Delhi Set 2 (5 marks unbounded region), 2022 Compartment (5 marks diet problem). Supplementary sources: CBSE sample papers for 2025 and 2026 released on the official website contain one LP question each. For students aiming for 95%+, attempting problems from RS Aggarwal or RD Sharma (Chapter on Linear Programming) provides extra rigour, though NCERT alone suffices for scoring full marks. Practice 3-4 problems daily in the two weeks before exams to build speed — a well-practiced student should solve a 6-mark LP problem in 12-15 minutes.
  • NCERT Exercise 12.1: Focus on Questions 1, 2, 3, 5 for formulation practice
  • NCERT Exercise 12.2: Solve Questions 1, 2, 3, 4, 5, 7, 9, 11 for complete graphical method
  • NCERT Miscellaneous: Attempt Questions 2, 4, 6, 8, 10 for mixed problem types
  • Previous Year Papers: 2020-2024 all sets — LP question patterns are highly consistent
  • CBSE Sample Papers: 2025 and 2026 sample papers each contain one representative 6-mark problem
  • Time yourself: Aim to complete one 6-mark problem in 12-15 minutes during practice

How CBSETUTOR.ai Helps Students Master Linear Programming Class 12

For students who find Linear Programming Class 12 challenging or want personalised practice beyond the textbook, CBSETUTOR.ai offers a 24×7 AI tutor that has ingested every NCERT textbook for Classes 6-12, including the complete Mathematics syllabus. Unlike generic video lectures, CBSETUTOR.ai allows you to upload a photo of any LP problem — whether from your school worksheet, coaching material, or previous year paper — and get step-by-step solutions explained in simple language. The AI tutor breaks down the graphical method into granular steps, shows you exactly how to plot constraints, guides you through solving simultaneous equations for corner points, and highlights common mistakes specific to your working. For example, if you incorrectly shade the feasible region, the AI will identify that specific error and explain the test-point method. One unique feature is adaptive question generation: after you solve a few problems, the AI generates similar problems with slight variations (different coefficients, different constraint combinations) to strengthen your conceptual grip. Parents across India are using CBSETUTOR.ai because it offers the equivalent of an on-demand Maths tutor at ₹999 per month — one flat price covering all subjects and all classes from 6 to 12. There is a 3-day free trial with no credit card required, so students can explore whether the AI teaching style suits them. For Linear Programming specifically, students report that practising 10-12 problems interactively with instant feedback builds confidence much faster than passively watching videos. The AI also tracks which types of LP problems you struggle with (formulation errors, graphing mistakes, corner-point calculation) and adjusts practice accordingly. This targeted approach is particularly helpful in the final revision phase before boards when you need to plug specific gaps rather than re-study the entire chapter.
  • Upload any Linear Programming Class 12 problem via photo and get instant step-by-step solutions
  • AI identifies YOUR specific mistakes — whether in formulation, graphing, or calculation — and explains corrections
  • Adaptive practice: AI generates customised LP problems based on your performance to target weak areas
  • Covers entire CBSE syllabus for Classes 6-12, all subjects, at ₹999/month flat — no hidden charges
  • 3-day free trial, no credit card required — try it risk-free before your next Maths exam

Quick Revision Checklist for Linear Programming Class 12 Before Exams

In the final week before your CBSE board exam, use this condensed revision checklist to ensure you have covered all critical aspects of Linear Programming Class 12. First, memorise the definitions: objective function, constraints, feasible region, optimal solution, corner point. Write them out once from memory. Second, practice formulation: take any five word problems, write decision variables, objective function, and all constraints in under 5 minutes each without looking at solutions. Third, review the graphical method steps: can you list all five steps (graph constraints, find feasible region, identify corners, evaluate Z, state optimal) without referring to notes? Fourth, solve one complete problem end-to-end with graph, ensuring you use a ruler and label everything. Fifth, revise corner cases: unbounded regions (when does max/min exist?), multiple optimal solutions (parallel objective line to constraint), infeasible problems (no common region). Sixth, practice corner-point calculations: solve 3-4 pairs of simultaneous equations to get exact fractional coordinates without calculator errors. Seventh, attempt one previous year board question under timed conditions (15 minutes for 6 marks). Eighth, review your school's internal assessment or pre-board paper — did you make any silly mistakes? Note them and consciously avoid them. On the night before the exam, do NOT attempt new difficult problems; instead, skim through solved NCERT examples and your own error log. During the exam, read the LP problem twice, underline key numbers and keywords ('at least', 'at most', 'maximise', 'minimise'), and allocate your 15 minutes wisely: 3 minutes formulation, 2 minutes graphing, 3 minutes finding corners, 2 minutes evaluating Z, 1 minute writing conclusion, 4 minutes buffer for checking. This structured time management ensures you do not run out of time and can claim full marks for a well-presented solution.
  • Day 7 before exam: Revise definitions, solve 5 formulation-only problems
  • Day 5-6: Solve 3-4 complete graphical method problems from NCERT Exercise 12.2
  • Day 3-4: Attempt 2 previous year board questions under exam conditions
  • Day 2: Review all mistakes made in practice, create a one-page formula/checklist sheet
  • Day 1: Light revision — read NCERT examples, no new problems, relax and sleep well
  • Exam day: Allocate 15 minutes for 6-mark LP question, always draw graph neatly with ruler

Frequently asked questions

How many marks does Linear Programming Class 12 carry in the CBSE board exam?+
Linear Programming Class 12 typically carries 5-6 marks in the CBSE board exam, usually appearing as one long-answer question. According to the 2024-25 marking scheme, the unit 'Linear Programming' is allocated 5 marks total, which may be structured as a single 5-mark question or occasionally split into a 6-mark question depending on the year. This represents about 6-7% of the total 80-mark theory paper.
Is the graphical method the only technique tested in Linear Programming Class 12?+
Yes, the CBSE Class 12 syllabus and NCERT textbook cover only the graphical method for solving linear programming problems. This method works exclusively for two-variable problems (x and y). Advanced techniques like the Simplex Method used for three or more variables are taught in undergraduate operations research courses, not in Class 12. All board exam questions involve exactly two decision variables solvable by graphing.
What is the most common mistake students make in Linear Programming formulation?+
The most common mistake is incorrectly translating 'at least' and 'at most' phrases into inequality symbols. When a problem states 'at least 100 units required,' students sometimes write ≤ instead of the correct ≥. Remember: 'at least k' means the quantity can be k or more, so use ≥ k; 'at most k' means k or less, so use ≤ k. Forgetting non-negativity constraints (x ≥ 0, y ≥ 0) is the second most common error, costing 1 mark.
Can the optimal solution occur at a point inside the feasible region instead of at a corner?+
No, the Corner Point Theorem guarantees that if an optimal solution exists for a linear programming problem, it must occur at a corner point (vertex) of the feasible region, never at an interior point. The only exception is when the objective function line is parallel to a constraint edge, in which case every point on that edge segment joining two adjacent corners is optimal. However, even then, the optimal value is achieved at the corner points themselves.
How do I decide which side of the constraint line to shade when graphing?+
Use the test-point method: after drawing the constraint line, choose any point not on the line (the origin (0,0) is easiest if the line does not pass through it). Substitute this point's coordinates into the inequality. If the inequality is satisfied, shade the side containing that test point; if not, shade the opposite side. For example, for 3x + 2y ≤ 12, test (0,0): 3(0) + 2(0) = 0 ≤ 12 is true, so shade the side containing the origin.
What should I do if the feasible region is unbounded in a Linear Programming Class 12 problem?+
First, identify all corner points algebraically as usual. Second, evaluate the objective function Z at each corner point. Third, determine whether you are maximising or minimising. If minimising and the unbounded region extends in a direction where Z increases, the minimum exists at the corner point with the smallest Z. If maximising and the region extends in the direction where Z increases, no maximum exists — you must explicitly state 'maximum does not exist' in your answer and justify it briefly to earn full marks.
Are calculators allowed in the CBSE board exam for solving Linear Programming problems?+
No, calculators are not permitted in CBSE Class 12 Mathematics board exams. All calculations for Linear Programming Class 12 — including solving simultaneous equations and evaluating the objective function — must be done manually. This is why examiners often design problems with convenient numbers or accept exact fractional answers. Always show complete working; marks are awarded for method even if minor arithmetic errors occur.
Will my child fall behind if the school uses additional reference books instead of only NCERT for Linear Programming?+
No, but the NCERT textbook should remain the primary resource for Linear Programming Class 12 because CBSE board exams are designed strictly according to the NCERT syllabus and question style. Reference books like RS Aggarwal or RD Sharma can provide additional practice problems, but the formulation approach, terminology, and graphical method steps must align with NCERT. Schools may use supplementary material for practice, but exam preparation should focus on mastering all NCERT exercises (12.1, 12.2, and Miscellaneous) first.
How much time should I spend on the Linear Programming question during the board exam?+
For a 6-mark Linear Programming question, allocate approximately 15 minutes out of the 3-hour exam. Break it down: 3 minutes for formulation, 2 minutes for drawing accurate constraint graphs, 3 minutes for finding corner points algebraically, 2 minutes for evaluating the objective function at each corner, 1 minute for writing the final conclusion, and 4 minutes as buffer for checking your work. If a question is worth 5 marks, reduce the time proportionally to 12-13 minutes. Practicing under timed conditions helps build this discipline.
Do I need to draw the graph on proper graph paper for full marks in Linear Programming Class 12?+
While graph paper is ideal for accuracy, CBSE board exams provide plain answer sheets without graph paper. You are expected to draw a neat freehand graph using a ruler for straight lines and clearly labelling axes, intercepts, and corner points. Use a sharp pencil, label the origin, mark the scale on axes, and ensure the feasible region is lightly shaded or hatched so corner points remain visible. Examiners award 1-2 marks for the quality of the graph, so neatness and clear labelling matter.
Can a Linear Programming problem have no solution or infinitely many solutions?+
Yes. A problem has no solution if the constraints are contradictory, resulting in an empty feasible region (e.g., x + y ≤ 2 and x + y ≥ 5 simultaneously with x,y ≥ 0 — no points satisfy both). A problem has infinitely many solutions if the objective function line is parallel to one of the binding constraint edges; then every point on that edge segment is optimal. However, CBSE board exams rarely test these edge cases in Class 12; most problems are designed to have a unique optimal solution at a corner point.
Is it necessary to write the final answer for Linear Programming in a complete sentence?+
Yes, writing a concluding sentence improves presentation and ensures you earn the final mark. For example, instead of just writing 'x = 20/19, y = 45/19, Z = 235/19,' write: 'The maximum value of Z is 235/19, which occurs at x = 20/19 and y = 45/19.' If the problem has context (e.g., products A and B), include it: 'The manufacturer should produce 20/19 units of product A and 45/19 units of product B to achieve maximum profit of ₹12.37 (approximately).' This clarity is rewarded by examiners, especially when marking schemes allocate 1 mark for 'conclusion.'

Related resources

Relations and Functions for Class 12: The Complete CBSE Guide (2026-27)Inverse Trigonometric Functions for Class 12: The Complete CBSE Guide (2026-27)Matrices for Class 12: The Complete CBSE Guide (2026-27)Determinants for Class 12: The Complete CBSE Guide (2026-27)AI Tutor for Class 12: The Smart Alternative to TuitionAI Tutor for Class 12 Accountancy: Learn Faster with Instant HelpClass 9 Coordinate Geometry Chapter 3: Cartesian System & Plotting PointsNumber Systems for Class 9: The Complete CBSE Guide (2026-27)

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
Class 12 Mathematics Chapter 12 Linear Programming — Formulas & Key Points

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 →
CBSETUTOR.ai · Free tutor
Your 24×7 AI tutor
Hi! I'm your CBSETUTOR.ai — an AI tutor that has ingested every NCERT book for Class 6 to 12. To get started, tell me which class you're in and which subject you'd like help with today (e.g. "Class 9, Physics").