Confirming your payment

Skip to content

Opening your dashboard

Class 12 Maths Chapter 12 Linear Programming: Practice Questions

30 questions on Chapter 12, each worked through on its own page with the AI tutor. Class 12 Maths, CBSE 2026-27.

30 questions

1–5 marks · Mixed difficulty

  1. 1

    Question 1

    The maximum value of Z=4x+yZ = 4x + y for a L.P.P. whose feasible region is given below is:

    Class 12 Maths Linear Programming

    MCQEasy
    1 mark
  2. 2

    Question 2

    For the linear programming problem (LPP), the objective function is Z=4x+3yZ = 4x + 3y and the feasible region determined by a set of constraints is shown in the graph:

    Class 12 Maths Linear Programming

    Which of the following statements is true?

    MCQEasy
    1 mark
  3. 3

    Question 3

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

    MCQEasy
    1 mark
  4. 4

    Question 4

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

    MCQEasy
    1 mark
  5. 5

    Question 5

    A linear programming problem along with the graph of its constraints is shown below. The corresponding objective function is:Minimise: Z=3x+2y\text{Minimise:\ }Z=3x+2yThe 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 ……………\dots\dots\dots\dots\dots

    MCQEasy
    1 mark
  6. 6

    Question 6

    If a 20 year old girl drives her car at 25 km/h, she has to spend ₹ 4/km on petrol. If she drives her car at 40 km/h, the petrol cost increases to ₹ 5/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.

    Medium
    2 marks
  7. 7

    Question 7

    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 and that on a bracelet is ₹ 300. Formulate an LPP for finding how many of each should be produced daily to maximise the profit? It is being given that at least one of each must be produced.

    Medium
    2 marks
  8. 8

    Question 8

    The corner points of the feasible region determined by the system of linear constraints are as shown in the following figure:

    Class 12 Maths Linear Programming

    (i) If Z=3x−4yZ = 3x - 4y be the objective function, then find the maximum value of ZZ.

    (ii) If Z=px+qyZ = px + qy where p,q>0p, q > 0 be the objective function. Find the condition on pp and qq so that maximum value of ZZ occurs at B(4,10)B(4, 10) and C(6,8)C(6, 8).

    Medium
    3 marks
  9. 9

    Question 9

    Solve the following Linear Programming Problem graphically:

    Minimise:

    Z=x+2yZ=x+2y

    Subject to the constraints:

    x+2y≥100,x+2y\ge100, 2x−y≤0,2x-y\le0, 2x+y≤200,2x+y\le200, x,y≥0.x,y\ge0.
    Medium
    3 marks
  10. 10

    Question 10

    Solve the following Linear Programming Problem graphically:

    Minimise

    Z=3x+9yZ=3x+9y

    Subject to the constraints:

    x+3y≤60x+3y\le60 x+y≥10x+y\ge10 x≤yx\le y x≥0,y≥0x\ge0,\quad y\ge0
    Hard
    3 marks
  11. 11

    Question 11

    Solve the following Linear Programming Problem graphically:

    Maximise

    Z=300x+600yZ=300x+600y

    Subject to:

    x+2y≤12x+2y\le12 2x+y≤122x+y\le12 x+54y≥5x+\frac54y\ge5 x≥0,y≥0x\ge0,\quad y\ge0
    Hard
    5 marks
  12. 12

    Question 12

    Solve the following LPP graphically:

    Maximise Z=60x+40y\text{Maximise\ }Z=60x+40y

    Subject to:

    x+2y≤12

    2x+y≤122x+y\le12

    (x+\frac{5}{4}y\ge 5)

    x≥0,y≥0x\ge0,\quad y\ge0

    Hard
    5 marks
  13. 13

    Question 13

    Read the following text and answer the questions on the basis of the same.

    Seema rides her bike at 25 km/h. She has to spend ₹ 2 per km on diesel, and if she rides it at a faster speed of 40 km/h, the diesel cost increases to ₹ 5 per km. She has ₹ 100 to spend on diesel and wishes to maximise the distance she can travel within one hour. Suppose she travels xx km at 25 km/h and yy km at 40 km/h.

    Class 12 Maths Linear Programming

    (i) Write the objective function for the given LPP.

    (ii) Write the set of constraints for the given LPP.

    (iii) Draw the graph of the feasible region.

    OR

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

    Hard
    4 marks
  14. 14

    Question 14

    The shaded region OABCDOABCD in the figure is the feasible region of a linear programming problem. It is bounded by the coordinate axes and the lines x+3y=15x + 3y = 15, x+y=7x + y = 7 and 2x+y=122x + y = 12.

    Shaded pentagon OABCD bounded by the axes and the lines x + 3y = 15, x + y = 7 and 2x + y = 12, each line draw

    At which point does Z=2x+3yZ = 2x + 3y attain its maximum value on this region?

    MCQMedium
    1 mark
  15. 15

    Question 15

    Two statements are given below, one labelled Assertion (A) and the other labelled Reason (R). Read them carefully and choose the correct option.

    The feasible region RR of a linear programming problem is given by x+y≥6x + y \ge 6, x+4y≥12x + 4y \ge 12, x≥0x \ge 0, y≥0y \ge 0. Its corner points are (0,6)(0, 6), (4,2)(4, 2) and (12,0)(12, 0).

    Assertion (A): The minimum value of Z=2x+5yZ = 2x + 5y on RR is 1818.

    Reason (R): If the feasible region is unbounded, the smallest of the values of ZZ at the corner points is always the minimum value of ZZ.

    MCQMedium
    1 mark
  16. 16

    Question 16

    A juice stall makes xx glasses of mango juice and yy glasses of orange juice in a morning. Peeling and cutting the fruit takes 44 minutes for a glass of mango juice and 22 minutes for a glass of orange juice, and the stall has at most 33 hours of peeling time. The owner also wants to make at least twice as many glasses of orange juice as of mango juice.

    Which pair of constraints, together with x≥0x \ge 0 and y≥0y \ge 0, describes these two conditions?

    MCQMedium
    1 mark
  17. 17

    Question 17

    The feasible region of a linear programming problem is given by

    2x+y≥6,x≤5,y≤4,x≥0,y≥02x + y \ge 6, \quad x \le 5, \quad y \le 4, \quad x \ge 0, \quad y \ge 0

    The minimum value of Z=4x+yZ = 4x + y on this region is

    MCQMedium
    1 mark
  18. 18

    Question 18

    The feasible region RR of a linear programming problem is given by 2x+y≥82x + y \ge 8, x+2y≥10x + 2y \ge 10, x≥0x \ge 0, y≥0y \ge 0. Its corner points are (0,8)(0, 8), (2,4)(2, 4) and (10,0)(10, 0).

    For the objective function Z=2x−yZ = 2x - y, which of the following is true?

    MCQMedium
    1 mark
  19. 19

    Question 19

    The feasible region of a linear programming problem is given by x+y≥5x + y \ge 5, y≤4y \le 4, x−y≤1x - y \le 1, x≥0x \ge 0, y≥0y \ge 0, and the objective is to minimise Z=2x+2yZ = 2x + 2y.

    Which of the following points is not an optimal solution?

    MCQMedium
    1 mark
  20. 20

    Question 20

    A farmer has at most 2020 hectares of land on which to grow wheat and mustard. Seed and sowing cost ₹2,000 per hectare for wheat and ₹4,000 per hectare for mustard, and he can spend at most ₹60,000 on them. Under a contract with a flour mill, he must grow at least 44 hectares of wheat. He expects a profit of ₹9,000 per hectare from wheat and ₹12,000 per hectare from mustard.

    Formulate this as a linear programming problem to maximise his profit. (You need not solve it.)

    Medium
    2 marks
  21. 21

    Question 21

    Maximise Z=3x+2yZ = 3x + 2y subject to 3x+2y≤183x + 2y \le 18, x+y≤8x + y \le 8, x≥0x \ge 0, y≥0y \ge 0.

    Find the maximum value of ZZ and describe all the points at which it is attained.

    Medium
    2 marks
  22. 22

    Question 22

    A small press prints two kinds of diaries, executive and pocket. An executive diary needs 55 minutes on the printing machine and 33 minutes at the binding table. A pocket diary needs 22 minutes on the printing machine and 33 minutes at the binding table. In a day the printing machine can run for at most 66 hours, and the binding table can be used for at most 44 hours 3030 minutes. The profit is ₹40 on an executive diary and ₹25 on a pocket diary.

    Formulate a linear programming problem to find how many diaries of each kind should be made in a day to maximise the profit, and solve it graphically.

    Medium
    3 marks
  23. 23

    Question 23

    Solve the following linear programming problem graphically:

    Minimise Z=5x+4yZ = 5x + 4y subject to

    3x+y≥9,x+2y≥8,y≤6,x≥0,y≥03x + y \ge 9, \quad x + 2y \ge 8, \quad y \le 6, \quad x \ge 0, \quad y \ge 0

    Does ZZ have a maximum value on the feasible region? Give a reason.

    Medium
    3 marks
  24. 24

    Question 24

    Solve the following linear programming problem graphically:

    Minimise and maximise Z=x+3yZ = x + 3y subject to

    2x+y≥8,x+y≤10,y≤2x,x≥0,y≥02x + y \ge 8, \quad x + y \le 10, \quad y \le 2x, \quad x \ge 0, \quad y \ge 0
    Medium
    3 marks
  25. 25

    Question 25

    The feasible region of a linear programming problem is the quadrilateral with corner points O(0,0)O(0, 0), A(8,0)A(8, 0), B(6,3)B(6, 3) and C(0,6)C(0, 6). It is cut out by 3x+2y≤243x + 2y \le 24, x+2y≤12x + 2y \le 12, x≥0x \ge 0, y≥0y \ge 0. Let Z=kx+yZ = kx + y, where k>0k > 0.

    (i) Find all values of kk for which the maximum value of ZZ occurs at BB.

    (ii) For which of these values is BB the only point at which the maximum occurs? What happens at the end values of kk?

    Medium
    3 marks
  26. 26

    Question 26

    Solve the following linear programming problem graphically:

    Maximise and minimise Z=3y−4xZ = 3y - 4x subject to

    x−y≥−1,x+y≥3,x≥0,y≥0x - y \ge -1, \quad x + y \ge 3, \quad x \ge 0, \quad y \ge 0
    Medium
    3 marks
  27. 27

    Question 27

    A handloom cooperative weaves sarees and stoles. The time needed for each piece and the hours available in a week are given below.

    ProcessSaree (hours)Stole (hours)Hours available
    Weaving6622120120
    Dyeing22224848
    Finishing11336060

    The profit is ₹500 on a saree and ₹300 on a stole, and everything made is sold.

    (i) Formulate a linear programming problem to maximise the weekly profit and solve it graphically.

    (ii) Market demand raises the profit on a stole to ₹500, with the profit on a saree unchanged. Find the new maximum profit and describe all the production plans that give it.

    Hard
    5 marks
  28. 28

    Question 28

    A builder must move at least 8080 tonnes of cement and at least 4848 tonnes of steel to a site. A trip by a truck of type P carries 1010 tonnes of cement and 22 tonnes of steel and costs ₹4,000. A trip by a truck of type Q carries 44 tonnes of cement and 44 tonnes of steel and costs ₹2,500. The transport company can provide at most 1515 trips of type Q.

    (i) Formulate a linear programming problem to minimise the transport cost.

    (ii) Solve it graphically and find the minimum cost.

    (iii) The site manager proposes 33 trips of type P and 1111 trips of type Q, which would cost only ₹39,500. Is the proposal acceptable? Justify your answer.

    Hard
    5 marks
  29. 29

    Question 29

    A flight kitchen prepares vegetarian and non-vegetarian meal trays for an evening flight. A vegetarian tray needs 22 minutes of oven time and a non-vegetarian tray needs 33 minutes, and a total of at most 1010 hours of oven time is available. Packing takes 11 minute per tray of either kind, and at most 250250 minutes of packing time is available. The airline insists on at least 6060 vegetarian trays. The kitchen earns ₹40 on a vegetarian tray and ₹60 on a non-vegetarian tray.

    (i) Formulate a linear programming problem to maximise the kitchen's earnings.

    (ii) Solve it graphically. Show that the maximum is attained at infinitely many points, and write down two optimal plans, other than the corner points, in which the numbers of trays are whole numbers.

    (iii) If the earning on a non-vegetarian tray rises to ₹65, find the new optimal plan and the maximum earning.

    Hard
    5 marks
  30. 30

    Question 30

    Let RR be the feasible region given by

    x+y≥5,x−2y≤2,x≥0,y≥0x + y \ge 5, \quad x - 2y \le 2, \quad x \ge 0, \quad y \ge 0

    (i) Find the corner points of RR, and determine the minimum and maximum values, if they exist, of Z1=3x+2yZ_1 = 3x + 2y on RR.

    (ii) Do the same for Z2=2x−5yZ_2 = 2x - 5y.

    (iii) The constraint x+y≤9x + y \le 9 is now added. Find the maximum value of Z1Z_1 on the new region and the point at which it occurs.

    Hard
    5 marks