Confirming your payment

Skip to content

Opening your dashboard

Class 12 Maths Chapter 12: Linear Programming Solutions

10 textbook questions with step-by-step answers, free to read, for CBSE 2026-27.

Jump to an exercise

1 exercise in Ch 12

The numbered NCERT exercises, so you can open the one you were set rather than scrolling for it.

AI Tutor

Get talked through Ch 12, not just shown the answer

Reading a finished solution is not the same as being able to do it. The AI tutor takes one question at a time and works it with you, in your own words, until you can.

  • Ask it out loud, in your own words
  • It gives you the next step, not the answer
  • Stuck on part (ii)? Start there
Ch 12 solutions

10 questions with solutions

3 marks · Easy difficulty

Exercise 12.1

Open Exercise 12.1
  1. 1

    Question 1

    Maximise Z=3x+4yZ = 3x + 4y

    Subject to the constraints:
    x+y≤4, x≥0, y≥0x + y \leq 4, \, x \geq 0, \, y \geq 0.

    Easy
    3 marks
    Solve with AI
    Written solution
    Solution:

    The feasible region determined by the constraints, x+y≤4,x≥0,y≥0x + y \leq 4, x \geq 0, y \geq 0, is given below.

    Class 12 Maths Linear Programming

    The corner points of the feasible region are O(0,0),A(4,0),O(0, 0), A(4, 0), and B(0,4)B(0, 4). The values of ZZ at these points are given below:

    Corner pointZ=3x+4yZ = 3x + 4y
    O(0,0)O(0, 0)0
    A(4,0)A(4, 0)12
    B(0,4)B(0, 4)16

    Hence, the maximum value of ZZ is 16 at the point B(0,4)B(0, 4).

  2. 2

    Question 2

    Minimise Z=−3x+4yZ = -3x + 4y

    Subject to the constraints:

    x+2y≤8,3x+2y≤12,x≥0,y≥0x + 2y \leq 8, \quad 3x + 2y \leq 12, \quad x \geq 0, \quad y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution
    Solution:

    The feasible region determined by the system of constraints,
    x+2y≤8, 3x+2y≤12, x≥0, y≥0x + 2y \leq 8, \, 3x + 2y \leq 12, \, x \geq 0, \, y \geq 0, is given below.

    Class 12 Maths Linear Programming

    The corner points of the feasible region are O(0,0),A(4,0),B(2,3),O(0, 0), A(4, 0), B(2, 3), and C(0,4)C(0, 4). The values of ZZ at these corner points are given below:

    Corner pointZ=−3x+4yZ = -3x + 4y
    O(0,0)O(0, 0)0
    A(4,0)A(4, 0)-12
    B(2,3)B(2, 3)6
    C(0,4)C(0, 4)16

    Hence, the minimum value of ZZ is -12 at the point A(4,0)A(4, 0).


  3. 3

    Question 3

    Maximise Z=5x+3yZ = 5x + 3y

    Subject to the constraints:

    3x+5y≤15,5x+2y≤10,x≥0,y≥03x + 5y \leq 15, \quad 5x + 2y \leq 10, \quad x \geq 0, \quad y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution
    Solution:

    The feasible region determined by the system of constraints,
    3x+5y≤15, 5x+2y≤10, x≥0, y≥03x + 5y \leq 15, \, 5x + 2y \leq 10, \, x \geq 0, \, y \geq 0, is given below.

    Class 12 Maths Linear Programming

    The corner points of the feasible region are O(0,0),A(2,0),B(0,3),O(0, 0), A(2, 0), B(0, 3), and C(2019,4519)C \left( \frac{20}{19}, \frac{45}{19} \right). The values of ZZ at these corner points are given below:

    Corner pointZ=5x+3yZ = 5x + 3y
    O(0,0)O(0, 0)0
    A(2,0)A(2, 0)10
    B(0,3)B(0, 3)9
    C(2019,4519)C \left( \frac{20}{19}, \frac{45}{19} \right)23519\frac{235}{19}

    Hence, the maximum value of ZZ is 23519\frac{235}{19} at the point (2019,4519)\left( \frac{20}{19}, \frac{45}{19} \right).

  4. 4

    Question 4

    Minimise Z=3x+5yZ = 3x + 5y

    Subject to the constraints:

    x+3y≥3,x+y≥2,x≥0,y≥0x + 3y \geq 3, \quad x + y \geq 2, \quad x \geq 0, \quad y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution
    Solution:

    The feasible region determined by the system of constraints,
    x+3y≥3, x+y≥2, x≥0, y≥0x + 3y \geq 3, \, x + y \geq 2, \, x \geq 0, \, y \geq 0, is given below. Class 12 Maths Linear Programming

    It can be seen that the feasible region is unbounded.
    The corner points of the feasible region are A(3,0),B(32,12),A(3, 0), B\left(\frac{3}{2}, \frac{1}{2}\right), and C(0,2)C(0, 2).
    The values of ZZ at these corner points are given below:

    Corner pointZ=3x+5yZ = 3x + 5y
    A(3,0)A(3, 0)9
    B(32,12)B\left(\frac{3}{2}, \frac{1}{2}\right)7 (Smallest)
    C(0,2)C(0, 2)10

    7 may or may not be the minimum value of ZZ because the feasible region is unbounded.

    For this purpose, we draw the graph of the inequality, 3x+5y<73x + 5y < 7, and check whether the resulting half-plane has common points with the feasible region or not.

    Hence, it can be seen that the feasible region has no common point with 3x+5y<73x + 5y < 7.

    Thus, the minimum value of ZZ is 7 at point B(32,12)B\left(\frac{3}{2}, \frac{1}{2}\right).


  5. 5

    Question 5

    Maximise Z=3x+2yZ = 3x + 2y

    Subject to the constraints:

    x+2y≤10,3x+y≤15,x≥0,y≥0x + 2y \leq 10, \quad 3x + y \leq 15, \quad x \geq 0, \quad y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution
    Solution:

    The feasible region determined by the system of constraints,
    x+2y≤10, 3x+y≤15, x≥0, y≥0x + 2y \leq 10, \, 3x + y \leq 15, \, x \geq 0, \, y \geq 0, is given below.

    Class 12 Maths Linear Programming

    The corner points of the feasible region are A(5,0),B(4,3),C(0,5),A(5, 0), B(4, 3), C(0, 5), and D(0,0)D(0, 0).
    The values of ZZ at these corner points are given below:

    Corner pointZ=3x+2yZ = 3x + 2y
    A(5,0)A(5, 0)15
    B(4,3)B(4, 3)18 (Maximum)
    C(0,5)C(0, 5)10
    D(0,0)D(0, 0)0

    Hence, the maximum value of ZZ is 18 at points B(4,3)B(4, 3).


  6. 6

    Question 6

    Minimise Z=x+2yZ = x + 2y

    Subject to the constraints:

    2x+y≥3,x+2y≥6,x≥0,y≥02x + y \geq 3, \quad x + 2y \geq 6, \quad x \geq 0, \quad y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution
    Solution:

    The feasible region determined by the constraints,
    2x+y≥3, x+2y≥6, x≥0, y≥02x + y \geq 3, \, x + 2y \geq 6, \, x \geq 0, \, y \geq 0, is given below.

    Class 12 Maths Linear Programming

    The corner points of the feasible region are A(6,0)A(6, 0) and B(0,3)B(0, 3).
    The values of ZZ at the corner points are given below:

    Corner pointZ=x+2yZ = x + 2y
    A(6,0)A(6, 0)6
    B(0,3)B(0, 3)6

    Here, the values of ZZ at points AA and BB are the same. If we take any other point, such as (2,2)(2, 2) on line x+2y=6x + 2y = 6, then Z=6Z = 6.

    Hence, the minimum value of ZZ occurs for more than 2 points.

    The feasible region is unbounded, so we check the open half-plane x+2y<6x + 2y < 6: it has no point in common with the feasible region. Therefore, the minimum value of ZZ is 6, attained at every point of the line segment joining A(6,0)A(6, 0) and B(0,3)B(0, 3).

  7. 7

    Question 7

    Minimise and Maximise Z=5x+10yZ = 5x + 10y

    Subject to the constraints:

    x+2y≤120,x+y≥60,x−2y≥0,x≥0,y≥0x + 2y \leq 120, \quad x + y \geq 60, \quad x - 2y \geq 0, \quad x \geq 0, \quad y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution
    Solution:

    The feasible region determined by the constraints,
    x+2y≤120, x+y≥60, x−2y≥0, x≥0, y≥0x + 2y \leq 120, \, x + y \geq 60, \, x - 2y \geq 0, \, x \geq 0, \, y \geq 0, is given below.

    Class 12 Maths Linear Programming

    The corner points of the feasible region are A(60,0)A(60, 0), B(120,0)B(120, 0), C(60,30)C(60, 30), and D(40,20)D(40, 20).
    The values of ZZ at these corner points are given below:

    Corner pointZ=5x+10yZ = 5x + 10y
    A(60,0)A(60, 0)300Minimum
    B(120,0)B(120, 0)600Maximum
    C(60,30)C(60, 30)600Maximum
    D(40,20)D(40, 20)400

    The minimum value of ZZ is 300 at (60,0)(60, 0) and the maximum value of ZZ is 600 at all the points on the line segment joining (120,0)(120, 0) and (60,30)(60, 30).


  8. 8

    Question 8

    Minimise and Maximise Z=x+2yZ = x + 2y subject to the constraints:

    x+2y≥100,2x−y≤0,2x+y≤200,x≥0,y≥0x + 2y \geq 100, \quad 2x - y \leq 0, \quad 2x + y \leq 200, \quad x \geq 0, \quad y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution

    Solution:

    The feasible region determined by the constraints, x+2y≥100, 2x−y≤0, 2x+y≤200, x≥0, y≥0x + 2y \geq 100, \, 2x - y \leq 0, \, 2x + y \leq 200, \, x \geq 0, \, y \geq 0, is given below.

    Class 12 Maths Linear Programming

    Corner points of the feasible region:
    • A(0,50),B(20,40),C(50,100),D(0,200)A(0, 50), B(20, 40), C(50, 100), D(0, 200) are the corner points of the feasible region.

    The values of Z=x+2yZ = x + 2y at these corner points are given below:

    Corner PointZ=x+2yZ = x + 2yMinimum/Maximum
    A(0, 50)100Minimum
    B(20, 40)100Minimum
    C(50, 100)250
    D(0, 200)400Maximum

    The maximum value of ZZ is 400 at points (0,200)(0, 200), and the minimum value of ZZ is 100 at all the points on the line segment joining the points (0,50)(0, 50) and (20,40)(20, 40).


  9. 9

    Question 9

    Maximise Z=−x+2yZ = -x + 2y, subject to the constraints:

    x≥3,x+y≥5,x+2y≥6,y≥0x \geq 3, \quad x + y \geq 5, \quad x + 2y \geq 6, \quad y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution

    Solution:

    The feasible region determined by the constraints, x≥3, x+y≥5, x+2y≥6, y≥0x \geq 3, \, x + y \geq 5, \, x + 2y \geq 6, \, y \geq 0, is given below.

    Class 12 Maths Linear Programming

    Here, it can be seen that the feasible region is unbounded.

    The values of ZZ at corner points A(6, 0), B(4, 1), and C(3, 2) are given below:

    Corner PointZ=−x+2yZ = -x + 2y
    A(6, 0)Z=−6Z = -6
    B(4, 1)Z=−2Z = -2
    C(3, 2)Z=1Z = 1

    Since the feasible region is unbounded, Z=1Z = 1 may or may not be the maximum value.

    For this purpose, we graph the inequality, −x+2y>1-x + 2y > 1, and check whether the resulting half-plane has points in common with the feasible region or not.

    Here, the resulting feasible region has points in common with the feasible region.

    Hence, Z=1Z = 1 is not the maximum value.

    Thus, ZZ has no maximum value.


  10. 10

    Question 10

    Maximise Z=x+yZ = x + y, subject to the constraints:

    x−y≤−1,−x+y≤0,x,y≥0x - y \leq -1, \quad -x + y \leq 0, \quad x, y \geq 0
    Easy
    3 marks
    Solve with AI
    Written solution

    Solution:

    The region determined by the constraints:

    x−y≤−1,−x+y≤0,x,y≥0x - y \leq -1, \quad -x + y \leq 0, \quad x, y \geq 0

    is given below.

    Class 12 Maths Linear Programming

    There is no feasible region, and therefore, ZZ has no maximum value.

From the board papers

Ch 12 in past CBSE papers

The same chapter as the board has actually asked it. These are worded differently from the textbook exercise, which is the point of reading them.

  1. 1

    Board paper question 1

    The objective function Z=ax+byZ=a x+b y of an LPP has maximum value 42 at ( 4,6 ) and minimum value 19 at (3,2)(3,2). Which of the following is true ?

    MCQEasyAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) a=9,b=1a=9, b=1

    • (B) a=5,b=2a=5, b=2

    • (C) a=3,b=5a=3, b=5

      Correct
    • (D) a=5,b=3a=5, b=3

    Ans. (c) a=3,b=5a=3, b=5

     Working: 4a+6b=42 (1); 3a+2b=19 (2)  Solving (1) & (2) ⇒a=3,b=5\begin{array}{r} \text { Working: } 4 a+6 b=42 \text { (1); } 3 a+2 b=19 \text { (2) } \\ \text { Solving (1) \& (2) } \Rightarrow a=3, b=5 \end{array}
  2. 2

    Board paper question 2

    The corner points of the feasible region of a linear programming problem are (0,4),(8,0)(0,4),(8,0) and (203,43)\left(\frac{20}{3}, \frac{4}{3}\right) If Z=30x+24yZ=30 x+24 y is the objective function, then (maximum value of Z - minimum value of Z ) is equal to:

    MCQMediumAsked 2024
    1 mark
    Solve with AI
    Answer
    • (A) 40

    • (B) 96

    • (C) 120

    • (D) 144

      Correct

    Ans. (d) 144

    Z=30x+24yZ = 30x + 24y

    At (0,4)(0,4): Z=30(0)+24(4)=96Z = 30(0) + 24(4) = 96 (Minimum)

    At (8,0)(8,0): Z=30(8)+24(0)=240Z = 30(8) + 24(0) = 240 (Maximum)

    At (20/3,4/3)(20/3, 4/3): Z=30(20/3)+24(4/3)=200+32=232Z = 30(20/3) + 24(4/3) = 200 + 32 = 232

    Zmax−Zmin=240−96=144Z_{max} - Z_{min} = 240 - 96 = 144

  3. 3

    Board paper question 3

    The corner points of the bounded feasible region determined by a system of linear constraints are (0,3),(1,1)(0,3),(1,1) and (3,0)(3,0). Let Z=px+qy\mathrm{Z}=p x+q y, where p,q>p, q> 0 . The condition on pp and qq so that the minimum of Z occurs at (3,0)(3,0) and (1,1)(1,1) is

    MCQMediumAsked 2024
    1 mark
    Solve with AI
    Answer
    • (A) p=2qp=2 q

    • (B) p=q2p=\frac{q}{2}

      Correct
    • (C) p=3qp=3 q

    • (D) p=qp=q

    Ans. Option (B) is correct.

     Explanation: Z=px+qy At (3,0),Z=3p and at (1,1),Z=p+q Equating, 3p=p+q⇒2p=q.\begin{array}{rlrl} \text { Explanation: } & & Z & =p x+q y \\ & \text { At }(3,0), & Z & =3 p \\ & \text { and at }(1,1), & Z & =p+q \\ \text { Equating, } & 3 p & =p+q \\ \Rightarrow & 2 p & =q . \end{array}
  4. 4

    Board paper question 4

    The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.

    Class 12 Maths Linear Programming

    Which of the following is not a constraint to the given Linear Programming Problem?

    MCQEasyAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) x+y≥2x+y \geq 2

    • (B) x+2y≤10x+2 y \leq 10

    • (C) x−y≥1x-y \geq 1

      Correct
    • (D) x−y≤1x-y \leq 1

    Option (C) is correct.

    Take any point inside the shaded region, for example (1,3)(1, 3), and test each inequality:

    (A) x+y=4≥2x + y = 4 \geq 2 ✓

    (B) x+2y=7≤10x + 2y = 7 \leq 10 ✓

    (C) x−y=−2x - y = -2, which is not ≥1\geq 1 ✗

    (D) x−y=−2≤1x - y = -2 \leq 1 ✓

    A constraint must hold at every feasible point, so x−y≥1x - y \geq 1 is not a constraint of this problem. The shaded region lies on the side of the line x−y=1x - y = 1 where x−y≤1x - y \leq 1 (option D).

    Hence, option (C) is correct.

  5. 5

    Board paper question 5

    A linear programming problem (LPP) along with the graph of its constraints is shown below. The corresponding objective function is Minimize: Z=3x+2y\mathrm{Z}=3 x+2 y The minimum value of the objective function is obtained at the corner point (2,0)(2,0).

    Class 12 Maths Linear Programming

    The optimal solution of the above linear programming problem ____\_\_\_\_

    MCQMediumAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) does not exist as the feasible region is unbounded.

    • (B) does not exist as the inequality 3x+2y<63 x+2 y<6 does not have any point in common with the feasible region.

    • (C) exists as the inequality 3x+2y>63 x+2 y>6 has infinitely many points in common with the feasible region.

    • (D) exists as the inequality 3x+2y<63 x+2 y<6 does not have any point in common with the feasible region.

      Correct

    Ans. Option (D) is correct.

  6. 6

    Board paper question 6

    The feasible region of a linear programming problem is bounded. The corresponding objective function is Z=6x−7y\mathrm{Z}=6 x-7 y.

    The objective function attains ____\_\_\_\_ in the feasible region.

    MCQEasyAsked 2024
    1 mark
    Solve with AI
    Answer
    • (A) only minimum

    • (B) only maximum

    • (C) both maximum and minimum

      Correct
    • (D) either maximum or minimum but not both

    Ans. Option (C) is correct.

    In linear programming, when the feasible region is bounded, the objective function can attain both a maximum and a minimum value. Since the feasible region is finite, the linear objective function will reach its extreme values at the vertices of the region.

    Thus, the correct answer is:

    Option (C): both maximum and minimum.

All 37 board paper questions for this chapter, solved the same way.

Common questions

Class 12 Maths Ch 12 questions students ask

How many questions are there in Class 12 Maths Ch 12?

10 questions, across 1 exercise (Exercise 12.1). Every one is solved step by step on this page.

Are these Class 12 Maths solutions free?

Yes. Every question and its full working is free to read, with no account needed.

Can I download the Class 12 Maths Ch 12 solutions as a PDF?

There is no PDF to download. Every solution is on this page instead, which means it is searchable, always the current syllabus, and readable on a phone. Use your browser's print option if you want it on paper.