Confirming your payment

Skip to content

Opening your dashboard

Class 12 Maths Chapter 12 Linear Programming: Previous Year Questions

37 questions on Chapter 12, each solved step by step. Class 12 Maths, CBSE 2026-27.

37 questions with solutions

1–5 marks · Mixed difficulty

The first 31 solutions are on this page. This chapter is a long one, so the rest open on their own page to keep this one quick to load.

  1. 1

    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

    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

    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

    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

    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

    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.

  7. 7

    Question 7

    The solution set of the inequation 3x+2y>33 x+2 y>3 is

    MCQMediumAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) half plane containing the origin

    • (B) half plane not containing the origin

      Correct
    • (C) the point being on the line 3x+2y=33 x+2 y=3

    • (D) None of these

    Answer:

    (B) half plane not containing the origin

    Explanation:

    The inequality 3x+2y>33x + 2y > 3 represents a region in the coordinate plane.

    • The corresponding equation 3x+2y=33x + 2y = 3 defines a straight line.
    • The inequality 3x+2y>33x + 2y > 3 refers to the region above this line (excluding the line itself).

    To determine if the origin (0,0) is included in the solution set, substitute x=0x = 0 and y=0y = 0 into the inequality:

    3(0)+2(0)=0≯33(0) + 2(0) = 0 \not> 3

    Since the origin does not satisfy the inequality, the solution set is the half-plane above the line that does not contain the origin.

    Thus, the correct answer is (B).


  8. 8

    Question 8

    The solution set of the inequality 3x+5y<43 x+5 y<4 is

    MCQMediumAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) an open half-plane not containing the origin.

    • (B) an open half-plane containing the origin.

      Correct
    • (C) the whole XY -plane not containing the line 3x+5y=43 x+5 y=4.

    • (D) a closed half plane containing the origin.

    Concept Applied Solution set containing origin in open half plane Ans. Option (B) is correct. Explanation: The strict inequality represents an open half plane and it contains the origin as (0,0)(0,0) satisfies it.

  9. 9

    Question 9

    The corner points of the feasible region for the Linear Programming Problem are (0,2),(3,0),(6(0,2),(3,0),(6, 0),(6,8)0),(6,8) and (0,5)(0,5). Let the objective function is Z=4x+6yZ=4 x+6 y then the minimum value of the objective function occurs at

    MCQEasyAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) (0,2)(0,2) only

    • (B) (3,0)(3,0) only

    • (C) The mid-point on the line segment joining the points (0,2)(0,2) and (3,0)(3,0)

    • (D) Any point on the line segment joining the points (0,2)(0,2) and (3,0)(3,0)

      Correct

    Answer: (D)

    We are given the objective function:

    Z=4x+6yZ = 4x + 6y

    The corner points of the feasible region are:

    (0,2), (3,0), (6,0), (6,8), (0,5)(0,2),\ (3,0),\ (6,0),\ (6,8),\ (0,5)

    Now evaluate ZZ at each corner point:

    Corner PointValue of Z=4x+6yZ = 4x + 6y
    (0,2)(0,2)4(0)+6(2)=124(0)+6(2)=12
    (3,0)(3,0)4(3)+6(0)=124(3)+6(0)=12
    (6,0)(6,0)4(6)+6(0)=244(6)+6(0)=24
    (6,8)(6,8)4(6)+6(8)=724(6)+6(8)=72
    (0,5)(0,5)4(0)+6(5)=304(0)+6(5)=30

    The minimum value of ZZ is:

    1212

    This minimum occurs at both:

    (0,2)and(3,0)(0,2) \quad \text{and} \quad (3,0)

    Since the objective function has the same minimum value at two adjacent corner points, it will have the same minimum value at every point on the line segment joining those two points.

    Therefore, the minimum occurs at:

    Any point on the line segment joining (0,2) and (3,0)\boxed{\text{Any point on the line segment joining }(0,2)\text{ and }(3,0)}

    So the correct option is:

    (D)\boxed{\text{(D)}}
  10. 10

    Question 10

    The corner points of the shaded unbounded feasible region of an LPP are ( 0,4 ), ( 0.6,160.6,16 ) and (3,0)(3,0) as shown in the figure. The minimum value of the objective function Z=4x+6yZ=4 x+6 y occurs at

    Class 12 Maths Linear Programming

    MCQEasyAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) (0.6,1.6)(0.6,1.6) only

    • (B) (3,0)(3,0) only

    • (C) (0.6,1.6)(0.6,1.6) and (3,0)(3,0) only

    • (D) at every point of the line-segment joining the points (0.6,1.6)(0.6,1.6) and (3,0)(3,0)

      Correct

    Ans. Option (D) is correct. Explanation: The minimum value of the objective function occurs at two adjacent corner points ( 0.6,1.60.6,1.6 ) and ( 3,0 ) and there is no point in the half plane 4x+6y<124 x+6 y<12 in common with the feasible region. So, the minimum value occurs at every point of the line-segment joining the two points.

    Note: the corner point printed as (0.6,16)(0.6, 16) in the question should read (0.6,1.6)(0.6, 1.6), as in the options.

  11. 11

    Question 11

    A Linear Programming Problem is as follows:

    Minimise

    Z=2x+yZ=2 x+y

    Subject to the constraints

    x≥3,x≤9,y≥0x−y≥0,x+y≤14\begin{aligned} & x \geq 3, x \leq 9, y \geq 0 \\ & x-y \geq 0, x+y \leq 14 \end{aligned}

    The feasible region has

    MCQMediumAsked 2021
    1 mark
    Solve with AI
    Answer
    • (A) 5 corner points including (0,0)(0,0) and (9,5)(9,5)

    • (B) 5 corner points including (7,7)(7,7) and (3,3)(3,3)

      Correct
    • (C) 5 corner points including (14,0)(14,0) and (9,0)(9,0)

    • (D) 5 corner points including ( 3,6 ) and ( 9,5 )

    Ans. Option (B) is correct. Explanation:

    Class 12 Maths Linear Programming

    On plotting the constraints x=3,x=9,x=yx=3, x=9, x=y and x+y=14x+y=14, we get the following graph. From the graph given below it, clear that feasible region is ABCDEA , including corner points A(9,0)\mathrm{A}(9,0), B(3,0),C(3,3),D(7,7)\mathrm{B}(3,0), \mathrm{C}(3,3), \mathrm{D}(7,7) and E(9,5)\mathrm{E}(9,5). Thus feasible region has 5 corner points including (7,7)(7,7) and (3,3)(3,3).

  12. 12

    Question 12

    A Linear Programming Problem is as follows:

    Maximise/Minimise objective function Z=2x−y+5Z = 2x - y + 5

    Subject to the constraints

    3x+4y≤60x+3y≤30x≥0, y≥0\begin{aligned} 3x + 4y & \leq 60 \\ x + 3y & \leq 30 \\ x \geq 0, \ y & \geq 0 \end{aligned}

    If the corner points of the feasible region are A(0,10)A(0, 10), B(12,6)B(12, 6), C(20,0)C(20, 0) and O(0,0)O(0, 0), then which of the following is true?

    MCQEasyAsked 2021
    1 mark
    Solve with AI
    Answer
    • (A) Maximum value of ZZ is 40

    • (B) Minimum value of ZZ is -5

      Correct
    • (C) Difference of maximum and minimum values of ZZ is 35

    • (D) At two corner points, value of ZZ are equal

    Option (B) is correct. Explanation:

    Corner PointsValue of Z=2x−y+5Z = 2x - y + 5
    A(0,10)A(0,10)Z=2(0)−10+5=−5Z=2(0)-10+5=-5 (Minimum)
    B(12,6)B(12,6)Z=2(12)−6+5=23Z=2(12)-6+5=23
    C(20,0)C(20,0)Z=2(20)−0+5=45Z=2(20)-0+5=45 (Maximum)
    O(0,0)O(0,0)Z=2(0)−0+5=5Z=2(0)-0+5=5

    The minimum value of ZZ is −5-5 (at A) and the maximum is 4545 (at C). So (A) and (C) are false (maximum 45, difference 50), no two corner values are equal (D false), and (B) is true.

    Hence, option (B) is correct.

  13. 13

    Question 13

    The corner points of the feasible region determined by a set of constraints (linear inequalities) are P(0,5)P(0, 5), Q(3,5)Q(3, 5), R(4,0)R(4, 0) and S(4,1)S(4, 1), and the objective function is Z=ax+2byZ = ax + 2by, where a,b>0a, b > 0. The condition on aa and bb such that the maximum of ZZ occurs at both Q and S is

    (Adapted from CBSE 2021. The printed paper gave R(5,0)R(5, 0), which puts SS on the segment PRPR and leaves no correct option; RR is changed to (4,0)(4, 0).)

    MCQEasyAsked 2021
    1 mark
    Solve with AI
    Answer
    • (A) a−5b=0a-5 b=0

    • (B) a−3b=0a-3 b=0

    • (C) a−2b=0a-2 b=0

    • (D) a−8b=0a-8 b=0

      Correct

    Option (D) is correct.

    The values of Z=ax+2byZ = ax + 2by at the corner points are:

    Corner pointZ=ax+2byZ = ax + 2by
    P(0,5)P(0, 5)10b10b
    Q(3,5)Q(3, 5)3a+10b3a + 10b
    S(4,1)S(4, 1)4a+2b4a + 2b
    R(4,0)R(4, 0)4a4a

    For the maximum to occur at both Q and S, their values must be equal:

    3a+10b=4a+2b⟹a−8b=03a + 10b = 4a + 2b \quad \Longrightarrow \quad a - 8b = 0

    Check that this really is the maximum. With a=8ba = 8b:

    Z(P)=10b,Z(Q)=34b,Z(S)=34b,Z(R)=32bZ(P) = 10b, \quad Z(Q) = 34b, \quad Z(S) = 34b, \quad Z(R) = 32b

    so the largest value, 34b34b, occurs at Q and S (and along the edge QS joining them), as required.

    The other options do not work: with a=5ba = 5b, 3b3b or 2b2b, Z(Q)Z(Q) is larger than Z(S)Z(S) (25b>22b25b > 22b, 19b>14b19b > 14b, 16b>10b16b > 10b), so the maximum occurs at Q alone.

    Hence, option (D) is correct.

  14. 14

    Question 14

    For an L.P.P. the objective function is Z=4x+3y\mathrm{Z}=4 x+ 3 y, and the feasible region determined by a set of constraints (linear in equations) is shown in the graph.

    Class 12 Maths Linear Programming

    Which one of the following statements is true?

    MCQEasyAsked 2021
    1 mark
    Solve with AI
    Answer
    • (A) Maximum value of ZZ is at RR.

    • (B) Maximum value of Z is at Q .

      Correct
    • (C) Value of Z at R is less than the value at P .

    • (D) Value of Z at Q is less than the value at R .

    Answer:

    (B) Maximum value of Z is at Q.

    Explanation:

    In linear programming, the objective function ( Z = 4x + 3y ) will reach its maximum or minimum value at one of the vertices (corner points) of the feasible region.

    From the graph:

    • Point Q is the vertex where the feasible region is maximized in terms of ( Z ).
    • The objective function increases as we move towards Q since it is the point farthest in the direction of increasing ( Z ).

    Thus, the maximum value of ( Z ) occurs at point Q.

    Therefore, the correct answer is (B) Maximum value of Z is at Q.

  15. 15

    Question 15

    The corner points of the feasible region determined by the system of linear inequalities are (0,0),(4,0)(0,0),(4,0), (2,4)(2,4), and (0,5)(0,5). If the maximum value of Z=ax+Z=a x+ by, where a,b>0a, b>0 occurs at both (2,4)(2,4) and (4,0)(4,0), then

    MCQEasyAsked 2020
    1 mark
    Solve with AI
    Answer
    • (A) a=2ba=2 b

      Correct
    • (B) 2a=b2 a=b

    • (C) a=ba=b

    • (D) 3a=b3 a=b

    Ans. Option (A) is correct.

    Explanation:

    2a+4b=4a⇒2a=4ba=2b\begin{aligned} 2 a+4 b & =4 a \\ \Rightarrow \quad 2 a & =4 b \\ a & =2 b \end{aligned}
  16. 16

    Question 16

    A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24 .

    It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16.

    If the profit on a necklace is ₹100₹ 100 and that on a bracelet is ₹ 300 . Formulate on L.P.P. for finding how many of each should

    be produced daily to maximize the profit? It is being given that at least one of each must be produced.

    MediumAsked 2017
    2 marks
    Solve with AI
    Written solution

    Sol.Let xx necklaces and yy bracelets are manufactured ∴\therefore L.P.P. is Maximize profit,

    P=100x+300yP=100 x+300 y

    Subject to constraints

    x+y≤2412x+y≤16 or x+2y≤32\begin{aligned} x+y & \leq 24 \\ \frac{1}{2} x+y & \leq 16 \text { or } x+2 y \leq 32 \quad \end{aligned}

    x,y≥1x, y \geq 1


  17. 17

    Question 17

    If a 20 year old girl drives her car at 25 km/h25 \mathrm{~km} / \mathrm{h}, she has to spend ₹4/km₹ 4 / \mathrm{km} on petrol. If she drives her car at 40 km/h40 \mathrm{~km} / \mathrm{h}, the petrol cost increases to ₹5/km₹ 5 / \mathrm{km}. She has ₹ 200 to spend on petrol and wishes to find the maximum distance she can travel within one hour. Express the above problem as a Linear Programming Problem.

    EasyAsked 2016
    2 marks
    Solve with AI
    Written solution

    Sol

    Let the distance covered with speed of 25 km/h=x km25 \mathrm{~km} / \mathrm{h} =x \mathrm{~km} and the distance covered with speed of 40 km/h=y km40 \mathrm{~km} / \mathrm{h} =y \mathrm{~km} Total distance covered =z km=z \mathrm{~km} The L.P.P. of the above problem, therefore, is

     Maximize z=x+y\text { Maximize } z=x+y

    Subject to constraints

    4x+5y≤200x25+y40≤1\begin{aligned} & 4 x+5 y \leq 200 \\ & \frac{x}{25}+\frac{y}{40} \leq 1 \end{aligned}

    and

    x≥0,y≥0x \geq 0, y \geq 0
  18. 18

    Question 18

    Solve the following linear programming problem graphically: Minimize : Z=5x+10y\mathrm{Z}=5 x+10 y subject to constraints:

    x+2y≤120x+y≥60x−2y≥0x≥0,y≥0.\begin{aligned} x+2 y & \leq 120 \\ x+y & \geq 60 \\ x-2 y & \geq 0 \\ x & \geq 0, y \geq 0 . \end{aligned}
    MediumAsked 2017
    3 marks
    Solve with AI
    Written solution

    Sol.

    Class 12 Maths Linear Programming

    Class 12 Maths Linear Programming

    We are given the following constraints and need to find the feasible region and the value of Z=5x+10yZ = 5x + 10y at various corner points of the feasible region.

    (2) x+y=60⇒x60+y60=1x + y = 60 \Rightarrow \frac{x}{60} + \frac{y}{60} = 1

    For the constraints:

    xx060
    yy600

    (3) x−2y=0⇒x=2yx - 2y = 0 \Rightarrow x = 2y

    Feasible Region:

    The corner points of the feasible region are given as:

    • A(40,20)A(40, 20)
    • B(60,30)B(60, 30)
    • C(120,0)C(120, 0)
    • D(60,0)D(60, 0)
    PointCoordinatesZ=5x+10yZ = 5x + 10y
    A(40,20)(40, 20)5(40)+10(20)=4005(40) + 10(20) = 400
    B(60,30)(60, 30)5(60)+10(30)=6005(60) + 10(30) = 600
    C(120,0)(120, 0)5(120)+10(0)=6005(120) + 10(0) = 600
    D(60,0)(60, 0)5(60)+10(0)=3005(60) + 10(0) = 300
    Conclusion:

    The value of ZZ is minimum at point D(60,0)D(60, 0), and the minimum value is 300.

    Commonly Made Error:

    Some students make errors by incorrectly handling the inequality signs, leading to an incorrect feasible region.

    Answering Tip:

    Students should ensure to sketch the correct equation with proper signs. Use either ax+by≤cax + by \leq c or ax+by≥cax + by \geq c as per the problem's requirements to avoid mistakes in determining the feasible region.

  19. 19

    Question 19

    Solve the following Linear Programming Problem graphically: Minimize: z=x+2yz=x+2 y, subject to the constraints: x+2y≥100,2x−y≤0,2x+y≤200,x,y≥0x+2 y \geq 100,2 x-y \leq 0,2 x+y \leq 200, x, y \geq 0.

    EasyAsked 2023
    3 marks
    Solve with AI
    Written solution

    Sol. The feasible region determined by the constraints,

    x+2y≥100x+2 y \geq 100,

    2x−y≤0,2 x-y \leq 0,

    2x+y≤200,2 x+y \leq 200,

    x,y≥0x, y \geq 0, is given below.

    Class 12 Maths Linear Programming A(0,50),B(20,40),C(50,100)A(0,50), B(20,40), C(50,100) and D(0,200)D(0,200) are the corner points of the feasible region. The values of ZZ at these corner points are given below.

    | Corner point | Corresponding

    value of

    Z=x+2y\mathbf{Z}=\boldsymbol{x}+\mathbf{2} \boldsymbol{y} | | | :--- | :---: | :--- | | A(0,50)A(0,50) | 100 | Minimum | | B(20,40)B(20,40) | 100 | Minimum | | C(50,100)C(50,100) | 250 | | | D(0,200)D(0,200) | 400 | |

    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).


  20. 20

    Question 20

    Solve the following Linear Programming Problem graphically:

    Maximize: Z=−x+2y\mathrm{Z}=-x+2 y,

    Subject to the constraints: x≥3,x+y≥5x \geq 3, x+y \geq 5, x+2y≥6,y≥0x+2 y \geq 6, y \geq 0.

    EasyAsked 2023
    3 marks
    Solve with AI
    Written solution

    Sol. The feasible region determined by the constraints, x≥3,x+y≥5,x+2y≥6,y≥0x \geq 3, x+y \geq 5, x+2 y \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(3,2),B(4,1)A(3,2), B(4,1) and C(6,0)C(6,0) are given below.

    | Corner point | Corresponding value of

    Z=−x+2y\boldsymbol{Z}=-\boldsymbol{x}+\mathbf{2} \boldsymbol{y} | | :--- | :--- | | A(3,2)\mathrm{A}(3,2) | 1 ( may or may not be the

    maximum value) | | B(4,1)\mathrm{B}(4,1) | -2 | | C(6,0)\mathrm{C}(6,0) | -6 |

    Since the feasible region is unbounded, Z=1Z=1 may or may not be the maximum value. Now, we draw the graph of the inequality, −x+2y>1-x+2 y>1, and we check whether the resulting open half-plane has any point/s, in common with the feasible region or not. Here, the resulting open half plane has points in common with the feasible region. Hence, Z=1\mathrm{Z}=1 is not the maximum value. We conclude, ZZ has no maximum value.


  21. 21

    Question 21

    Each unit of Product A that a company produces, is sold for ₹100 with a production cost of ₹60 and each unit of Product B is sold for ₹150 with production cost of ₹90. On a given day, the company has a budget of ₹8000 to spend on production. The production process makes it such that they can only produce a maximum of 100 units each day. Also, the number of product B produced cannot be more than twice as many of Product A. Frame a linear programming problem to determine how many units of Product A and B should the company produce in a day in order to maximize their profit? (Note: No need to find the feasible region and optimal solution.)

    MediumAsked 2023
    3 marks
    Solve with AI
    Written solution

    Sol. Finds the profit on selling the products as: Profit for each unit of Product A sold =100−60=100-60 = ₹40

    Profit for each unit of Product B sold =150−90=150-90 = ₹60

    Takes xx and yy to be the numbers of Product A and Product B to be produced in a day respectively and frames the objective function as: Maximise Z=40x+60y\quad \mathrm{Z}=40 x+60 y

    Writes the constraints of the given linear programming problem as:

    60x+90y≤8000x+y≤100y≤2x or −2x+y≤0x,y≥0\begin{aligned} 60 x+90 y & \leq 8000 \\ x+y & \leq 100 \\ y & \leq 2 x \text { or }-2 x+y \leq 0 \\ x, y & \geq 0 \end{aligned}
  22. 22

    Question 22

    Shown below is the feasible region of a maximisation problem whose objective function is given by Z=5x+3y\mathrm{Z}=5 x+3 y.

    Class 12 Maths Linear Programming

    (i) List all the constraints the problem is subjected to.

    (ii) Find the optimal solution of the problem.


    EasyAsked 2023
    3 marks
    Solve with AI
    Written solution

    Sol. (i) Uses the graph of the feasible region and lists the constraints of the given maximisation problem as:

    3x+2y≤12x+2y≤8x,y≥0\begin{align*} 3 x+2 y & \leq 12 \\ x+2 y & \leq 8 \\ x, y & \geq 0 \tag{1} \end{align*}

    (ii) Finds the value of the objective function at corner points as:

    Corner pointz=5x+3yz=5 x+3 y
    (0,0)(0,0)0
    (0,4)(0,4)12
    (2,3)(2,3)19
    (4,0)(4,0)20

    Concludes that the objective function attains maximum value at (4,0)(4,0) and hence (4,0)(4,0) is the optimal solution.


  23. 23

    Question 23

    Solve the following Linear Programming Problem graphically: Minimize Z=3x+9yZ=3 x+9 y Subject to the constraints

    x+3y≤60x+3 y \leq 60 x+y≥10x≤yx≥0,y≥0.\begin{aligned} x+y & \geq 10 \\ x & \leq y \\ x & \geq 0, y \geq 0 . \end{aligned}
    EasyAsked 2023
    3 marks
    Solve with AI
    Written solution

    Sol. x+3y≤60x+y≥10\quad x+3 y \leq 60 \quad x+y \geq 10

    x≤yx \leq y
    x+3y=60x+y=10x=yx+3 y=60 \quad x+y=10 \quad x=y

    Class 12 Maths Linear Programming

    Corner points are A(0,10),B(5,5),C(15,15)A(0,10), B(5,5), C(15,15) and D(0,20)D (0,20)

    Corner pointZ=3x+9yZ=3x+9y
    A(0,10)A(0,10)90
    B(5,5)B(5,5)60
    C(15,15)C(15,15)180
    D(0,20)D(0,20)180

    Minimum value of Z=60Z=60

    Commonly Made Error

    Since there are three lines the students fail to identify the correct feasible region.

    Answering Tip

    Practice more problems on graphical solutions using a graph paper to avoid mistakes.


  24. 24

    Question 24

    Solve the following Linear Programming Problem graphically: Maximize Z=400x+300yZ=400 x+300 y subject to x+y≤200,x≤40,x≥20,y>0x+y \leq 200, x \leq 40, x \geq 20, y>0

    MediumAsked 2022
    3 marks
    Solve with AI
    Written solution

    Sol. We have Z=400x+300yZ=400 x+300 y subject to x+y≤200,x≤40,x≥20,y≥0x+y \leq 200, x \leq 40, x \geq 20, y \geq 0 The corner points of the feasible region are C(20,0)D(40,0),B(40,160),A(20,180)\mathrm{C}(20,0) \mathrm{D}(40,0), \mathrm{B}(40,160), \mathrm{A}(20,180) Feasible Region ABDCA

    Class 12 Maths Linear Programming

    Corner PointsZ=400x+300y\boldsymbol{Z}=\mathbf{4 0 0} \boldsymbol{x}+\mathbf{3 0 0} \boldsymbol{y}
    C(20,0)C(20,0)8000
    D(40,0)D(40,0)16000
    B(40,160)B(40,160)64000
    A(20,180)A(20,180)62000

    Maximum profit occurs at x=40,y=160x=40, y=160 and the maximum profit =₹64,000=₹ 64,000



    Note: the condition y>0y > 0 in the question should be read as y≥0y \geq 0, as used in this solution; with y>0y > 0 the corner points C(20,0)C(20, 0) and D(40,0)D(40, 0) would not be feasible.

  25. 25

    Question 25

    A furniture trader deals in only two items - chairs and tables. He has ₹50,000 to invest and a space to store at most 35 items. A chair costs him ₹1,000 and a table costs him ₹2,000. The trader earns a profit of ₹150 and ₹250 on a chair and table, respectively. Formulate the above problem as a LPP to maximise the profit and solve it graphically.

    MediumAsked 2019
    3 marks
    Solve with AI
    Written solution

    Sol:

    let the trader buy xx number of chairs and yy number of tables

    We have to maximise profit z=150x+250yz=150 x+250 y He has only ₹50000₹ 50000 to invest.

    ∴1000x+2000y≤50000⇒x+2y≤50\begin{aligned} & \therefore \quad 1000 x+2000 y \leq 50000 \\ & \Rightarrow \quad x+2 y \leq 50 \end{aligned}

    Also he has a storage space of at most 35 items

    ∴x+y≤35\therefore x+y \leq 35

    ∴\therefore Required LPP is Maximize z=150x+250yz=150 x+250 y subject to the constraints

    x+2y≤50x+y≤35\begin{array}{r} x+2 y \leq 50 \\ x+y \leq 35 \end{array} x⩾0y⩾0. (non-negativity constraints) x \geqslant 0 \quad y \geqslant 0 \text {. (non-negativity constraints) }

    converting x+2y⩽50x+2 y \leqslant 50 into an equation

    x+2y=50x+2 y=50
    xx050
    yy250

    (0,0)(0,0) satisfy the inequality. Converting x+y⩽35x+y \leqslant 35 into an equation

    x+y=35x+y=35
    xx035
    yy350

    (0,0)(0,0) satisfies the inequality solving both equations simultaneously we get (20,15)(20,15) feasible region is OBED

    Corner Pointsz=150x+250yz=150 x+250 y
    O(0,0)O(0,0)0+00+0=0= 0
    D(35,0)D(35,0)35×15035 \times 150=5250=5250
    B(0,25)B(0,25)25×25025 \times 250=6250=6250
    E(20,15)E(20,15)20×150+15×25020 \times 150+15 \times 250=6750=6750

    For maximum profit he should buy 20 chairs and 15 tables; the maximum profit is ₹6750.

    Class 12 Maths Linear Programming


  26. 26

    Question 26

    A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type AA requires 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type BB require 8 minutes each for cutting and 8 minutes each for assembling. Given that total time for cutting is 3 hours 20 minutes and for assembling 4 hours. The profit for type AA souvenir is ₹100₹ 100 each and for type BB souvenir, profit is ₹120₹ 120 each. How many souvenirs of each type should the company manufacture in order to maximize the profit ? Formulate the problem as an LPP and solve it graphically.

    EasyAsked 2020
    3 marks
    Solve with AI
    Written solution

    Sol. Let the company manufacture ' xx ' number of souvenirs of Type A And, ' yy ' number of souvenirs of Type B ∴\therefore LPP is: Maximise P=100x+120yP=100 x+120 y \quad subject to 5x+8y≤200\quad 5 x+8 y \leq 200 10x+8y≤24010 x+8 y \leq 240 x≥0,y≥0x \geq 0, y \geq 0

    Correct Graph

    Class 12 Maths Linear Programming

    P(A)=₹3,000P(B)=₹3,200 (Max.) P(C)=₹2,400\begin{aligned} & P(A)=₹ 3,000 \\ & P(B)=₹ 3,200 \text { (Max.) } \\ & P(C)=₹ 2,400 \end{aligned}
    For maximum profit,
    No. of souvenirs of Type A=8A=8
    No. of souvenirs of Type B=20B=20

    Commonly Made Error Mostly students carelessly ignore the hour to

    minute conversion and go wrong.

    Answering Tip

    Read the question carefully and get used with the unit conversions.


  27. 27

    Question 27

    A manufacturer has three machines I, II and III installed in his factory. Machine I and II are capable of being operated for atmost 12 hours whereas machine III must be operated for atleast 5 hours a day. He produces only two items M and N each requiring the use of all the three machines. The number of hours required for producing 1 unit of M and N on three machines are given in the following table:

    | Items | Number of hours required on

    machines | | | | :--- | :---: | :---: | :---: | | | I | II | III | | M | 1 | 2 | 1 | | N | 2 | 1 | 1.25 |

    He makes a profit of ₹ 600 and ₹ 400 on one unit of items M and N respectively. How many units of each item should he produce so as to maximize his profit assuming that he can sell all the items that he produced. What will be the maximum profit ?


    MediumAsked 2020
    3 marks
    Solve with AI
    Written solution
    Problem Statement

    A manufacturer has three machines (I, II, and III) installed in his factory. Machine I and II can be operated for at most 12 hours, while machine III must be operated for at least 5 hours a day. He produces two items, M and N, each requiring the use of all three machines.

    The number of hours required for producing 1 unit of M and N on the three machines are given in the following table:

    ItemsMachine I (hrs)Machine II (hrs)Machine III (hrs)
    M121
    N211.25

    The manufacturer makes a profit of ₹600 for each unit of M and ₹400 for each unit of N. The goal is to determine how many units of each item should be produced to maximize the profit, assuming that all the items produced can be sold.

    Step 1: Define Variables

    Let:

    • xx be the number of units of item M produced.
    • yy be the number of units of item N produced.
    Step 2: Objective Function (Profit)

    The profit per unit of M is ₹600, and the profit per unit of N is ₹400. Therefore, the objective function (total profit) is:

    Z=600x+400yZ = 600x + 400y

    where ZZ is the total profit.

    Step 3: Constraints
    1. Machine I hours constraint: Machine I can be operated for a maximum of 12 hours per day. The total hours for machine I are:

      1x+2y≤121x + 2y \leq 12
    2. Machine II hours constraint: Machine II can be operated for a maximum of 12 hours per day. The total hours for machine II are:

      2x+1y≤122x + 1y \leq 12
    3. Machine III hours constraint: Machine III must be operated for at least 5 hours per day. The total hours for machine III are:

      1x+1.25y≥51x + 1.25y \geq 5
    4. Non-negativity constraints: The number of units produced must be non-negative:

      x≥0,y≥0x \geq 0, \quad y \geq 0
    Step 4: Solve the Linear Programming Problem

    We need to maximize:

    Z=600x+400yZ = 600x + 400y

    subject to the constraints:

    1. 1x+2y≤121x + 2y \leq 12
    2. 2x+1y≤122x + 1y \leq 12
    3. 1x+1.25y≥51x + 1.25y \geq 5
    4. x≥0x \geq 0, y≥0y \geq 0
    Step 5: Graphical Method Step 5.1: Plot the Constraints

    The lines representing the constraints are:

    • 1x+2y=121x + 2y = 12 intersects the x-axis at x=12x = 12 and the y-axis at y=6y = 6.
    • 2x+1y=122x + 1y = 12 intersects the x-axis at x=6x = 6 and the y-axis at y=12y = 12.
    • 1x+1.25y=51x + 1.25y = 5 intersects the x-axis at x=5x = 5 and the y-axis at y=4y = 4.
    Step 5.2: Find the Feasible Region

    The feasible region is bounded, with corner points (5,0)(5,0), (6,0)(6,0), (4,4)(4,4), (0,6)(0,6) and (0,4)(0,4); (4,4)(4,4) is where x+2y=12x + 2y = 12 meets 2x+y=122x + y = 12.

    Step 5.3: Evaluate the Objective Function at Corner Points

    Z(5,0)=3000Z(5,0) = 3000, Z(6,0)=3600Z(6,0) = 3600, Z(4,4)=4000Z(4,4) = 4000, Z(0,6)=2400Z(0,6) = 2400, Z(0,4)=1600Z(0,4) = 1600. So the optimal solution is:

    • x=4x = 4 units of M
    • y=4y = 4 units of N
    Step 6: Calculate the Maximum Profit

    Substitute x=4x = 4 and y=4y = 4 into the objective function:

    Z=600(4)+400(4)=2400+1600=4000Z = 600(4) + 400(4) = 2400 + 1600 = 4000 Final Answer:

    The manufacturer should produce 4 units of M and 4 units of N to maximize profit, and the maximum profit is ₹4000. Class 12 Maths Linear Programming


  28. 28

    Question 28

    Two tailors A and B earn ₹ 150 and ₹ 200 per day respectively. A can stitch 6 shirts and 4 pants per day, while BB can stitch 10 shirts and 4 pants per day. Form a L.P.P. to minimize the labour cost of produce (stitch) at least 60 shirts and 32 pants and solve it graphically.

    EasyAsked 2021
    3 marks
    Solve with AI
    Written solution

    Sol. Let tailor A works for xx days and tailor B works for yy days

    Objective function: To minimize labour cost Z=150x+200yZ=150 x+200 y (in ₹) Subject to constraints

    6x+10y≥60 i.e., 3x+5y≥304x+4y≥32 i.e., x+y≥8x≥0,y≥0\begin{aligned} 6 x+10 y & \geq 60 \text { i.e., } 3 x+5 y \geq 30 \\ 4 x+4 y & \geq 32 \text { i.e., } x+y \geq 8 \\ x & \geq 0, y \geq 0 \end{aligned}

    Consider equations to draw the graph and then we will shade feasible region

    3x+5y=30x+y=8\begin{aligned} 3 x+5 y & =30 \\ x+y & =8 \end{aligned}

    Corner points of feasible region are A(10,0)A(10,0), B(5,3)B(5,3) and C(0,8)C(0,8)

    Value of Z at these corner points

    Z(A)=1500Z(B)=1350Z(C)=1600\begin{aligned} & Z_{(A)}=1500 \\ & Z_{(B)}=1350 \\ & Z_{(C)}=1600 \end{aligned}

    Class 12 Maths Linear Programming

    So minimum value of ZZ is ₹1350₹ 1350 when tailor AA works for 5 days and tailor BB works for 3 days. To check draw 150x+200y<1350150 x+200 y<1350 i.e., 3x+4y<273 x+4 y<27 As there is no region common with feasible region so minimum value is ₹ 1350 . [Marking Scheme SQP, 2020-21] (Modified)

    Commonly Made Error

    Mostly students fail to draw the optimal line correctly.

    Answering Tip

    Δ\Delta Practice more problems on LPP involving unbounded feasible region.


  29. 29

    Question 29

    Solve the following linear programming problem graphically:

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

    Subject to the constraints:

    x−y≥0x - y \geq 0

    x−2y≥−2x - 2y \geq -2

    x≥0, y≥0x \geq 0, \, y \geq 0

    EasyAsked 2025
    3 marks
    Solve with AI
    Written solution
    Solution:

    Class 12 Maths Linear Programming

    Corner PointValue of Z=x+2yZ = x + 2y
    O(0,0)O(0,0)0
    A(2,2)A(2,2)6

    Since the feasible region is unbounded, plot x+2y>6x + 2y > 6, which has a common region with the feasible region. Thus, ZZ has no maximum value.


  30. 30

    Question 30

    Solve the following linear programming problem graphically

    Maximise z=500x+300yz = 500x + 300y, subject to constraints:

    x+2y≤12x + 2y \leq 12

    2x+y≤122x + y \leq 12

    4x+5y≥204x + 5y \geq 20

    x≥0, y≥0x \geq 0, \, y \geq 0

    MediumAsked 2024
    3 marks
    Solve with AI
    Written solution

    Ans. Max z=500x+300yz = 500x + 300y

    Class 12 Maths Linear Programming

    Corner PointZ
    A (0,4)1200
    B (0,6)1800
    C (4,4)3200
    D (6,0)3000
    E (5,0)2500

    Max z = 3200 at x=4x = 4, y=4y = 4


  31. 31

    Question 31

    Solve the following Linear Programming Problem graphically:

    Maximize: P=70x+40yP=70 x+40 y

    Subject to:

    3x+2y≤93x+y≤9x≥0,y≥0\begin{aligned} 3 x+2 y & \leq 9 \\ 3 x+y & \leq 9 \\ x & \geq 0, y \geq 0 \end{aligned}
    EasyAsked 2023
    5 marks
    Solve with AI
    Written solution

    Sol. Maximize: P=70x+40yP=70 x+40 y

    3x+2y≤9,3x+y≤9x≥0,y≥03x+2y=9\begin{aligned} & 3 x+2 y \leq 9,3 x+y \leq 9 \\ & \quad x \geq 0, y \geq 0 \\ & 3 x+2 y=9 \end{aligned}

    3x+y=93 x+y=9

    xx03
    yy92\frac{9}{2}0
    xx03
    yy90

    Feasible area is OABO

    P=70x+40y At O(0,0)P=70×0+40×0=0 At A(3,0)P=70×3+40×0=210 At B(0,92)P=70×0+40×92=180\begin{array}{ll} & P=70 x+40 y \\ \text { At } O(0,0) & P=70 \times 0+40 \times 0=0 \\ \text { At } A(3,0) & P=70 \times 3+40 \times 0=210 \\ \text { At } B\left(0, \frac{9}{2}\right) & P=70 \times 0+40 \times \frac{9}{2}=180 \end{array}

    Maximise at (3,0)(3,0) x=3x=3 and y=0y=0 Maximum value =210=210

    Class 12 Maths Linear Programming

  32. 32

    Question 32

    Solve the following Linear Programming Problem graphically:

    Minimise: Z=60x+80y\quad \mathrm{Z}=60 x+80 y Subject to constraints:

    3x+4y≥85x+2y≥11x,y≥0\begin{aligned} 3 x+4 y & \geq 8 \\ 5 x+2 y & \geq 11 \\ x, y & \geq 0 \quad \end{aligned}
    EasyAsked 2023
    5 marks
  33. 33

    Question 33

    The corner points of the feasible region determined by the system of linear constraints are as shown below: Class 12 Maths Linear Programming

    Answer each of the following:

    (i) Let Z=3x−4y\mathrm{Z}=3 x-4 y be the objective function. Find the maximum and minimum value of Z and also the corresponding points at which the maximum and minimum value occurs.

    (ii) Let Z=px+qy\mathrm{Z}=p x+q y, where p,q>0p, q>0 be the objective function. Find the condition on pp and qq so that the maximum value of ZZ occurs at B(4,10)B(4,10) and C(6,8)C(6,8). Also mention the number of optimal solutions in this case.

    EasyAsked 2020
    5 marks
  34. 34

    Question 34

    A manufacturer makes two types of toys AA and BB. Three machine are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:

    Types of ToysMachines
    IIIIII
    A201010
    B102030

    The machines I, II and III are available for a maximum of 3 hours, 2 hours and 2 hours 30 minutes respectively. The profit on each toy of type A is ₹50 and that of type B is ₹60. Formulate the above problem as a L.P.P. and solve it graphically to maximize profit.


    EasyAsked 2019
    5 marks
  35. 35

    Question 35

    A factory manufactures two types of screws AA and BB, each type requiring the use of two machines, an automatic and a hand-operated. It takes 4 minutes on the automatic and 6 minutes on the hand-operated machines to manufacture a packet of screws' ′{ }^{\prime} ' while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a packet of screws ' B\mathbf{B} '. Each machine is available for at most 4 hours on any day. The manufacturer can sell a packet of screws ' AA ' at a profit of 70 paise and screws ' BB ' at a profit of ₹ 1 . Assuming that he can sell all the screws he manufactures, how many packets of each type should the factory owner produce in a day in order to maximize his profit ? Formulate the above L.P.P. and solve it graphically and find the maximum profit.

    EasyAsked 2018
    5 marks
  36. 36

    Question 36

    This section comprises of case-study/passage-based questions. These case study questions have three sub-parts of marks 1, 1, 2 respectively. I. Read the following text and answer the following questions on the basis of the same: Seema rides her bike at 25 km/h25 \mathrm{~km} / \mathrm{h}. She has to spend ₹ 2 per km on diesel and if she rides it at faster speed of 40 km/h40 \mathrm{~km} / \mathrm{h}, the diesel cost increases to ₹5 per km. She has ₹100 to spend on diesel and wishes to maximize the distance she can travel within one hour. Let she travels x kmx \mathrm{~km} with speed 25 km/h25 \mathrm{~km} / \mathrm{h} and y kmy \mathrm{~km} with speed 40 km/h40 \mathrm{~km} / \mathrm{h}.

    Class 12 Maths Linear Programming

    1. Write the objective function for given LPP.

    2. Write the set of constraints for given LPP.

    3. Draw the graph for feasible region.

    OR

    Write the corner points of feasible region and find maximum value of objective function.

    EasyAsked 2023
    5 marks
  37. 37

    Question 37

    Read the following text and answer the following questions on the basis of the same: Let R be the feasible region (convex polygon) for a linear programming problem and let Z=ax+byZ=a x+b y be the objective function. When ZZ has an optimal value (maximum or minimum), where the variables xx and yy are subject to constraints described by linear inequalities, this optimal value must occur at a corner points (vertex) of the feasible region.

    1. The corner points of the feasible region determined by the system of linear constraints are (0,0),(0,40)(0,0),(0,40), (20,40),(60,20),(60,0)(20,40),(60,20),(60,0). The objective function is
    Z=4x+3y.Z=4 x+3 y .

    Compare the quantity in Column AA and Column BB.

    Column AAColumn BB
    Maximum of ZZ325
    1. What do you understand by optimal solution?

    2. Solve the following LPP graphically:

    Max.

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

    subject to

    x+y≤4x≥0,y≥0\begin{aligned} x+y & \leq 4 \\ x & \geq 0, y \geq 0 \end{aligned}

    OR

    Draw the graph of given LPP and find the corner points of feasible region.

    Minimize

    Z=200x+500yZ=200 x+500 y

    Subject to constraints:

    x+2y≥103x+4y≤24x≥0,y≥0\begin{aligned} x+2 y & \geq 10 \\ 3 x+4 y & \leq 24 \\ x & \geq 0, y \geq 0 \end{aligned}
    MediumAsked 2020
    5 marks