Confirming your payment

Skip to content

Opening your dashboard

Class 12 Maths Ch 12 Ex 12.1: Linear Programming Solutions

10 questions from Exercise 12.1 of Class 12 Maths Chapter 12, Linear Programming, each solved step by step. Free to read, CBSE 2026-27.

Ex 12.1 solutions

10 questions with solutions

3 marks · Easy difficulty

  1. 1

    Exercise 12.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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

    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

    Exercise 12.1 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 Exercise 12.1

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

AI Tutor

Stuck on one of these? Work it through out loud

A finished solution tells you the answer. The AI tutor takes one question of Ex 12.1 at a time and works it with you until you can do the next one on your own.

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

What students ask about Ex 12.1

How many questions are in Ex 12.1 of Class 12 Maths?

Ex 12.1 has 10 questions. Every one is solved step by step on this page, free to read.

How many marks is Ex 12.1 worth?

The 10 questions here carry 30 marks between them, at easy difficulty overall. Marks are shown on each question so you can see what a full answer needs.

Are these Ex 12.1 solutions free?

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

Can I download Ex 12.1 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 2026-27 syllabus, and readable on a phone. Use your browser's print option if you want it on paper.