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
- 11 mark
Question 1
The maximum value of for a L.P.P. whose feasible region is given below is:

- 21 mark
Question 2
For the linear programming problem (LPP), the objective function is and the feasible region determined by a set of constraints is shown in the graph:

Which of the following statements is true?
- 31 mark
Question 3
The corner points of the feasible region of a linear programming problem are , and . If is the objective function, then (maximum value of – minimum value of ) is equal to
- 41 mark
Question 4
The corner points of the bounded feasible region determined by a system of linear constraints are , and . Let , where . The condition on and so that the minimum of occurs at and is:
- 51 mark
Question 5
A linear programming problem along with the graph of its constraints is shown below. The corresponding objective function is:The minimum value of the objective function is obtained at the corner point .

The optimal solution of the above linear programming problem
- 62 marks
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.
- 72 marks
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.
- 83 marks
Question 8
The corner points of the feasible region determined by the system of linear constraints are as shown in the following figure:

(i) If be the objective function, then find the maximum value of .
(ii) If where be the objective function. Find the condition on and so that maximum value of occurs at and .
- 93 marks
Question 9
Solve the following Linear Programming Problem graphically:
Minimise:
Subject to the constraints:
- 103 marks
Question 10
Solve the following Linear Programming Problem graphically:
Minimise
Subject to the constraints:
- 115 marks
Question 11
Solve the following Linear Programming Problem graphically:
Maximise
Subject to:
- 125 marks
Question 12
Solve the following LPP graphically:
Subject to:
x+2y≤12
(x+\frac{5}{4}y\ge 5)
- 134 marks
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 km at 25 km/h and km at 40 km/h.

(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.
- 141 mark
Question 14
The shaded region in the figure is the feasible region of a linear programming problem. It is bounded by the coordinate axes and the lines , and .

At which point does attain its maximum value on this region?
- 151 mark
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 of a linear programming problem is given by , , , . Its corner points are , and .
Assertion (A): The minimum value of on is .
Reason (R): If the feasible region is unbounded, the smallest of the values of at the corner points is always the minimum value of .
- 161 mark
Question 16
A juice stall makes glasses of mango juice and glasses of orange juice in a morning. Peeling and cutting the fruit takes minutes for a glass of mango juice and minutes for a glass of orange juice, and the stall has at most 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 and , describes these two conditions?
- 171 mark
Question 17
The feasible region of a linear programming problem is given by
The minimum value of on this region is
- 181 mark
Question 18
The feasible region of a linear programming problem is given by , , , . Its corner points are , and .
For the objective function , which of the following is true?
- 191 mark
Question 19
The feasible region of a linear programming problem is given by , , , , , and the objective is to minimise .
Which of the following points is not an optimal solution?
- 202 marks
Question 20
A farmer has at most 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 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.)
- 212 marks
Question 21
Maximise subject to , , , .
Find the maximum value of and describe all the points at which it is attained.
- 223 marks
Question 22
A small press prints two kinds of diaries, executive and pocket. An executive diary needs minutes on the printing machine and minutes at the binding table. A pocket diary needs minutes on the printing machine and minutes at the binding table. In a day the printing machine can run for at most hours, and the binding table can be used for at most hours 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.
- 233 marks
Question 23
Solve the following linear programming problem graphically:
Minimise subject to
Does have a maximum value on the feasible region? Give a reason.
- 243 marks
Question 24
Solve the following linear programming problem graphically:
Minimise and maximise subject to
- 253 marks
Question 25
The feasible region of a linear programming problem is the quadrilateral with corner points , , and . It is cut out by , , , . Let , where .
(i) Find all values of for which the maximum value of occurs at .
(ii) For which of these values is the only point at which the maximum occurs? What happens at the end values of ?
- 263 marks
Question 26
Solve the following linear programming problem graphically:
Maximise and minimise subject to
- 275 marks
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.
Process Saree (hours) Stole (hours) Hours available Weaving Dyeing Finishing 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.
- 285 marks
Question 28
A builder must move at least tonnes of cement and at least tonnes of steel to a site. A trip by a truck of type P carries tonnes of cement and tonnes of steel and costs ₹4,000. A trip by a truck of type Q carries tonnes of cement and tonnes of steel and costs ₹2,500. The transport company can provide at most 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 trips of type P and trips of type Q, which would cost only ₹39,500. Is the proposal acceptable? Justify your answer.
- 295 marks
Question 29
A flight kitchen prepares vegetarian and non-vegetarian meal trays for an evening flight. A vegetarian tray needs minutes of oven time and a non-vegetarian tray needs minutes, and a total of at most hours of oven time is available. Packing takes minute per tray of either kind, and at most minutes of packing time is available. The airline insists on at least 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.
- 305 marks
Question 30
Let be the feasible region given by
(i) Find the corner points of , and determine the minimum and maximum values, if they exist, of on .
(ii) Do the same for .
(iii) The constraint is now added. Find the maximum value of on the new region and the point at which it occurs.
