Opening your dashboard
Class 12 Maths Chapter 12 Linear Programming: Competency-Based Questions (CBQ)
80 questions on Chapter 12, each worked through on its own page with the AI tutor. Class 12 Maths, CBSE 2026-27.
80 questions
1–5 marks · Mixed difficulty
- 11 mark
Question 1
Shown below is a linear programming problem (LPP).
Maximise
subject to the constraints:
Which of the following is true about the feasible region of the above LPP?
- 21 mark
Question 2
Inequality represents:
- 31 mark
Question 3
An LPP has the constraints
Which one of the constraints can be removed without changing the feasible region?
- 41 mark
Question 4
The inequalities form:
- 51 mark
Question 5
The constraints
define on:
- 61 mark
Question 6
The maximum value of such that:
is:
- 71 mark
Question 7
If a point satisfies an inequality , then the half-plane represented by the inequality is:
- 81 mark
Question 8
A workshop makes chairs and stools a day. Its feasible region is given by , , , , and its daily profit (in hundreds of rupees) is .
Assertion (A): The expression attains its maximum value on this region, at the point .
Reason (R): , and multiplying by a positive number and then subtracting a constant does not change the point at which the maximum occurs.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 91 mark
Question 9
The solution of the linear inequality in the variable is represented on the number line by:
- 101 mark
Question 10
The feasible region of an LPP is determined by the constraints
Which of the following points is a corner point of this feasible region?
- 111 mark
Question 11
Problem:
The solution set of constraints and includes the point: - 121 mark
Question 12
State whether the following statement is true or false. Justify your answer.
A linear programming problem whose feasible region is unbounded does not have an optimal solution.
- 131 mark
Question 13
Which of the following is the objective function in a Linear Programming Problem?
- 141 mark
Question 14
The common region determined by all the constraints including non-negative restrictions of an LPP is called the:
- 151 mark
Question 15
The variables x and y in an LPP whose values are to be determined to optimise the objective function are called:
- 161 mark
Question 16
According to the Corner Point Method, the optimal value of Z = ax + by for a bounded feasible region occurs at:
- 171 mark
Question 17
For the LPP: Maximise Z = 3x + 4y subject to x + y ≤ 4, x ≥ 0, y ≥ 0, the corner points of the feasible region are:
- 181 mark
Question 18
A point that lies outside the feasible region of an LPP is called:
- 191 mark
Question 19
In an LPP, the linear inequalities or equations that restrict the values of the decision variables are called:
- 201 mark
Question 20
The feasible region of a system of linear inequalities is always:
- 211 mark
Question 21
For the LPP: Maximise Z = 4x + y with corner points (0, 0), (30, 0), (20, 30), (0, 50), the maximum value of Z is:
- 221 mark
Question 22
If an LPP has no point simultaneously satisfying all its constraints, then the LPP is said to have:
- 231 mark
Question 23
Assertion (A): In a bounded feasible region, the maximum value of the objective function Z = ax + by always occurs at one of the corner points.
Reason (R): If the feasible region is bounded, then the objective function Z has both a maximum and a minimum value, each occurring at a corner point of the region.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 241 mark
Question 24
Assertion (A): The point (25, 40) is a feasible solution for the constraint x + y ≤ 60 with x ≥ 0, y ≥ 0.
Reason (R): A feasible solution must satisfy all the constraints of the LPP simultaneously, including non-negative restrictions.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 251 mark
Question 25
Assertion (A): Every Linear Programming Problem is an optimisation problem.
Reason (R): An optimisation problem seeks to find the maximum profit, minimum cost, or minimum use of resources by optimising a linear function subject to constraints.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 261 mark
Question 26
Assertion (A): If two corner points of a bounded feasible region give the same maximum value of the objective function, then every point on the line segment joining them also gives the same maximum value.
Reason (R): The objective function is a quadratic function, so it takes constant values along line segments.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 271 mark
Question 27
Assertion (A): The conditions x ≥ 0 and y ≥ 0 in an LPP are called non-negative restrictions.
Reason (R): The non-negative restrictions ensure that the decision variables do not take negative values, which is necessary for most real-life problems.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 285 marks
Question 28
A school canteen manager wants to serve two types of food packets — Type P and Type Q — to students. Each packet of Type P requires 2 units of ingredient A and 1 unit of ingredient B. Each packet of Type Q requires 1 unit of ingredient A and 2 units of ingredient B. The canteen has at most 10 units of ingredient A and at most 8 units of ingredient B available. The profit from each packet of Type P is ₹3 and from each packet of Type Q is ₹4. Let x = number of Type P packets and y = number of Type Q packets prepared.
The LPP is formulated as: Maximise Z = 3x + 4y Subject to: 2x + y ≤ 10 x + 2y ≤ 8 x ≥ 0, y ≥ 0
The feasible region has corner points: O(0, 0), A(5, 0), B(4, 2), C(0, 4).
Which of the following represents the constraint for ingredient A in the above LPP?
- (A) x + 2y ≤ 8
- (B) 2x + y ≤ 10
- (C) 2x + y ≥ 10
- (D) x + 2y ≥ 8
The value of the objective function Z = 3x + 4y at the corner point B(4, 2) is:
- (A) 16
- (B) 20
- (C) 18
- (D) 14
The maximum profit the canteen manager can earn is:
- (A) ₹15
- (B) ₹16
- (C) ₹20
- (D) ₹18
Which of the following points is NOT a feasible solution for the above LPP?
- (A) (2, 3)
- (B) (4, 2)
- (C) (0, 4)
- (D) (6, 1)
In the above LPP, the conditions x ≥ 0 and y ≥ 0 are included because:
- (A) They make the objective function linear
- (B) The number of food packets cannot be negative
- (C) They reduce the number of corner points
- (D) They ensure the feasible region is unbounded
- 291 mark
Question 29
A grocer stocks quintals of rice and quintals of wheat. His storeroom holds at most quintals in all, and his supplier can give him at most quintals of rice, so , , , . His profit (in hundreds of rupees) is .
Assertion (A): The maximum profit is ₹2900, obtained by stocking quintals of rice and quintals of wheat.
Reason (R): Since rice earns more per quintal than wheat, the profit is greatest when he stocks as much rice as possible and no wheat.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 301 mark
Question 30
The feasible region of a linear programming problem is given by , , , . Let .
Assertion (A): has no maximum value on .
Reason (R): The minimum value of on is , attained at .
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 311 mark
Question 31
A dietitian mixes packets of food P and packets of food Q. The nutrient requirements give , , , , and the cost (in tens of rupees) is .
Assertion (A): The minimum value of occurs at the point where the lines and meet.
Reason (R): The feasible region is unbounded, but has a minimum value on it.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 321 mark
Question 32
A hostel orders crates of milk and crates of juice for a sports day. It needs at least crates in all, the dairy can supply at most crates of milk and the juice supplier at most crates of juice, so , , , , . The cost (in hundreds of rupees) is .
Assertion (A): The minimum cost is ₹1200, obtained by ordering crates of milk and no juice.
Reason (R): When both coefficients of the cost function are positive, its minimum value always occurs at the origin .
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 335 marks
Question 33
A hostel warden prepares the evening health drink from two powders, P and Q, bought in packs. One pack of P supplies units of iron and unit of calcium. One pack of Q supplies unit of iron and units of calcium. Each evening's batch must contain at least units of iron and at least units of calcium. A pack of P costs ₹40 and a pack of Q costs ₹30. The warden uses packs of P and packs of Q and wants to keep the cost low.
Attempt any four of the following five sub-questions.
(a) Formulate the problem as a linear programming problem.
(b) Find the corner points of the feasible region and state whether the region is bounded.
(c) Find the minimum cost of a batch and the mix that gives it. Justify that it is the minimum.
(d) Is there a mix with the greatest possible cost? Justify your answer using the corner point method.
(e) The supplier of Q runs out for a day, so the warden must manage with powder P alone. Find the cheapest batch he can make and how much more it costs than the minimum found in (c).
- 345 marks
Question 34
A small unit makes desk lamps and wall lamps. Each day it makes desk lamps and wall lamps. Its assembly time and its testing time are both limited, and these two limits, together with and , give the shaded feasible region shown below. The boundary line (assembly) passes through and , and the boundary line (testing) passes through and . The lines cross at the vertex . The unit earns ₹50 on a desk lamp and ₹40 on a wall lamp, and it can sell everything it makes.

Attempt any four of the following five sub-questions.
(a) Find the equations of and , and write the two constraints which, together with and , describe .
(b) Find the coordinates of .
(c) Find the number of lamps of each kind the unit should make to maximise its profit, and the maximum profit.
(d) A shop orders desk lamps and wall lamps for delivery at the end of one day. Can the unit make them in a single day? Justify.
(e) Suppose the profit on a wall lamp changes to ₹, while the profit on a desk lamp stays ₹50. Find the value of for which the maximum profit is obtained both at and at the vertex .
- 355 marks
Question 35
A dairy cooperative has two chilling centres, A and B. On a certain day centre A has cans of milk and centre B has cans. Two retail booths, P and Q, need cans and cans respectively, and their needs must be met exactly. The cost of carrying one can is given below.
From To booth P To booth Q Centre A ₹6 ₹3 Centre B ₹5 ₹4 Centre A sends cans to P and cans to Q, and centre B sends whatever else each booth needs. Neither centre can send more milk than it holds.
Attempt any four of the following five sub-questions.
(a) Express the numbers of cans sent from B to P and from B to Q in terms of and , and write down all the constraints on and .
(b) Show that the total transport cost is rupees.
(c) Find the corner points of the feasible region.
(d) Find the plan that makes the transport cost least, and the least cost.
(e) A clerk suggests that centre A should supply booth P completely and centre B should supply booth Q completely. Show that this plan is feasible and find how much more it costs than the cheapest plan.
- 365 marks
Question 36
A coaching institute advertises each week on an FM radio station and in a local newspaper. A radio spot costs ₹2000 and a newspaper advertisement costs ₹4000, and the weekly advertising budget is ₹40,000. The radio station sells the institute at most spots a week, and the institute wants at least newspaper advertisements every week. A radio spot reaches about people and a newspaper advertisement about people. Let be the number of radio spots and the number of newspaper advertisements in a week.
Attempt any four of the following five sub-questions.
(a) Formulate the problem of maximising the weekly reach as a linear programming problem.
(b) Find the corner points of the feasible region.
(c) Find the maximum weekly reach and the advertising plan that gives it.
(d) Two of the corner plans reach exactly people. Name them and find how much of the budget each one leaves unspent.
(e) In another week the institute wants to reach at least people, still with at most radio spots and at least newspaper advertisements, and with no fixed budget. Find the least amount it must spend.
- 375 marks
Question 37
A plant nursery prepares a batch of potting mix from compost and cocopeat. A batch may weigh at most kg. Compost supplies units of nutrient per kg and cocopeat unit per kg, and a batch needs at least units of nutrient. To keep the mix airy, the mass of compost may exceed the mass of cocopeat by at most kg. Compost costs ₹30 per kg and cocopeat ₹20 per kg. Let a batch contain kg of compost and kg of cocopeat.
Attempt any four of the following five sub-questions.
(a) Write the constraints and the cost function.
(b) Find the corner points of the feasible region.
(c) Find the cheapest batch and its cost.
(d) Find the costliest batch that still meets all the conditions, and explain why such a batch must exist.
(e) A customer wants a batch of exactly kg. Find the cheapest such batch and its cost.
- 385 marks
Question 38
A school is organising an overnight nature camp. It can rent small tents and large tents. A small tent sleeps students and costs ₹2000 for the night; a large tent sleeps students and costs ₹5000. The campsite has only tent pitches, so at most tents can be put up, and the school's budget for tents is ₹30,000. Let be the number of small tents and the number of large tents.
Attempt any four of the following five sub-questions.
(a) Write the constraints on and arising from the pitches and the budget.
(b) Using these constraints, find the largest number of students the camp can sleep, and the plan that does it.
(c) students sign up. Using (b), explain why no plan satisfies all the conditions, and what this means for the feasible region.
(d) The school finally takes exactly students, so the tents must sleep at least . Find the corner points of the new feasible region.
(e) Find the cheapest plan for these students and its cost.
- 395 marks
Question 39
A hospital kitchen staffs its day shift with full-time cooks, who work hours each, and part-time cooks, who work hours each. The shift needs at least cook-hours. Under the staff agreement, the number of part-time cooks may be at most twice the number of full-time cooks, and the kitchen has lockers for only cooks in all. A full-time cook is paid ₹1200 for the shift and a part-time cook ₹500. Let full-time and part-time cooks be on duty.
Attempt any four of the following five sub-questions.
(a) Formulate the problem of minimising the wage bill for the shift as a linear programming problem.
(b) Find the corner points of the feasible region.
(c) Find the cheapest way to staff the shift and the wage bill.
(d) The wage of a part-time cook rises to ₹600 (the full-time wage is unchanged). Find the new minimum wage bill and list every staffing plan, in whole numbers of cooks, that achieves it.
(e) At the original wages, a supervisor proposes full-time and part-time cooks. Show that this gives the required cook-hours and costs less than the answer to (c), and explain why it still cannot be used.
- 405 marks
Question 40
A farmer has hectares of land on which to grow groundnut and cotton this season. Groundnut needs units of irrigation water per hectare and cotton needs units per hectare, and the canal authority allows him at most units. On the advice of the agriculture officer, he will keep at least hectares under groundnut, a legume that restores nitrogen to the soil. He expects a profit of ₹70,000 per hectare of groundnut and ₹80,000 per hectare of cotton. Let him grow groundnut on hectares and cotton on hectares.
Attempt any four of the following five sub-questions.
(a) Formulate the problem as a linear programming problem to maximise his profit.
(b) Find the corner points of the feasible region.
(c) Find the land he should give to each crop and his maximum profit.
(d) Two corner plans give the same profit of ₹7,00,000. For each of them, find how much land and how much water would remain unused.
(e) He leases more hectares, so that he has hectares; the water allowance and the soil advice are unchanged. Find his new best plan and the increase in his maximum profit.
- 411 mark
Question 41
The maximum value of subject to the constraints:
occurs at:
- 421 mark
Question 42
Minimum value of
subject to constraints
:
- 431 mark
Question 43
The corner points of the feasible region determined by the following system of linear inequalities:
are . Let , where . Condition on and so that the maximum of occurs at both and is:
- 441 mark
Question 44
Shaded region is represented by:

- 451 mark
Question 45
The feasible region of an LPP is given by
This region is unbounded. For which of the following objective functions does have NO minimum value on this region?
- 461 mark
Question 46
State whether the following statement is true or false. Explain your reasoning.
In a linear programming problem, it is possible for a non-corner point to have the optimal value of the objective function, .
- 475 marks
Question 47
A government bond or sovereign bond is a form of bond issued by the government to raise money for public works such as parks, libraries, bridges, roads, and other infrastructure. There are multiple variants of bonds issued by Government of India (GOI) at fixed interest rates and for a fixed period.
Jayesh Runjhunwala, an investor, wants to invest a maximum of Rs 20000 in government bonds for one year. He decides to invest in two types of bonds and , bond yielding simple interest on the amount invested and bond yielding simple interest on the amount invested. He wants to invest at least Rs 5000 in bond and no more than Rs 8000 in bond Y.
Formulate the linear programming problem and determine the amount he must invest in two bonds to maximise his return. Show your work.
- 485 marks
Question 48
Sudhanva has two kinds of areca nuts - premium and economy. He sells them to two stores, A and B . The profit margin per kg for premium and economy nuts are Rs 80 and Rs 50 respectively.
Both stores buy an equal quantity of premium nuts. However, Store B buys three times the economy nuts as compared to Store A. Store A can buy a maximum of 30 kg of nuts and store can buy a maximum of 60 kg of nuts.
What should be the maximum weight of premium and economy nuts that Sudhanva should sell to obtain maximum profit? Show your steps.
- 493 marks
Question 49
Benjamin, a professional runner, follows a rigorous workout routine designed to improve his athletic performance. Running on the treadmill is a part of his daily routine.
If he runs at , he burns . If he runs at a faster speed of , the calories burnt increases to . He wishes to run maximum distance in not more than an hour at only two speeds. He does not want to burn more than 1000 calories as it could be detrimental for his health.
Express the above optimisation problem as a linear programming problem. (Note: Treadmill is a device used for exercise, consisting of a continuous moving belt on which one can walk or run.)
- 503 marks
Question 50
A packaging company has the capacity to produce rectangular boxes and circular boxes. Each rectangular box takes 2 minutes to make and it sells for a profit of . Each circular box takes 3 minutes to make and it sells for a profit of Rs 5.
Their client requests for 25 boxes to be ready in one hour. The packaging company wants to maximise their profit from this order.
Frame this optimisation problem as a linear programming problem.
- 512 marks
Question 51
The objective function of a linear programming problem is given by ; where and are constants. If the minimum of occurs at two points, and , find the relationship between a and b. Show your work.
- 522 marks
Question 52
Sameer framed the following linear programming problem to minimise the monthly operational cost in running his bakery.
Minimise
subject to the constraints:
where is the number of orders for bread loaves and is the number of orders for cakes. Graph the feasible region for Sameer's LPP and find the optimal solution.
- 534 marks
Question 53
A consultancy firm is preparing an office trip for its 400 employees. The bus rental company has 2 options for the buses that they can offer along with a maximum of 9 drivers. The capacity and rental costs are shown below.
Bus type Maximum capacity Rental cost (in Rs.) Large 50 3000 Medium 40 2000 Determine the number of buses that the consultancy firm should book to minimise the total rental cost. Sketch the feasible region and show your steps.
- 543 marks
Question 54
Ritvik owns two wholesale stores located in Noida and Gurgaon that supply shoes to retail stores in Dwarka, Saket and Greater Kailash in Delhi. The retail stores require 250, 350 and 350 pairs of shoes respectively in a month.
The distribution capacities of the wholesale stores at Noida and Gurgaon are 450 and 500 pairs respectively per month. The cost of transportation per pair is given below:
From To Dwarka (in Rs) To Saket (in Rs) To Greater Kailash (in Rs) Noida 10 15 12 Gurgaon 12 15 10 Assuming that the wholesale stores operate at their maximum distribution capacities, frame an objective function to minimise the cost of transportation of the shoes from the two wholesale stores to the three retail stores.
- 555 marks
Question 55
Shaanta is a wholesale dry fruit trader who deals with figs and cashews.
The maximum capital available with her in a certain month is . She has a warehouse with a maximum capacity to store 50 quintals of dry fruits at a time. Figs cost her Rs 40,000 per quintal and cashews Rs 60,000 per quintal. She earns a profit of Rs 2,000 per quintal on figs and Rs 3,000 per quintal on cashews.
How many quintals of figs and cashews should she purchase that month to make a maximum profit? Show your steps.
- 565 marks
Question 56
A seller wants to pack Ajwa dates and Omani dates such that, in each packet, the combined weight is at most 15 kg and the weight of Omani dates is at most twice the weight of Ajwa dates. The seller anticipates a profit of Rs per kg on Ajwa dates and Rs 70 per kg on Omani dates.
How many kilograms of Ajwa dates and Omani dates should be packed in each packet to attain maximum profit? Show your steps.
- 571 mark
Question 57
For an LPP with an unbounded feasible region, which of the following statements is CORRECT?
- 581 mark
Question 58
For the LPP: Minimise Z = −50x + 20y with unbounded feasible region having corner points (0, 5), (0, 3), (1, 0), (6, 0), the smallest Z value is −300 at (6, 0). To confirm this is the minimum, we check the open half-plane:
- 591 mark
Question 59
For the LPP: Minimise Z = 3x + 2y subject to x + y ≥ 8, 3x + 5y ≤ 15, x ≥ 0, y ≥ 0, which of the following is true?
- 601 mark
Question 60
For the LPP: Minimise and Maximise Z = 3x + 9y subject to x + 3y ≤ 60, x + y ≥ 10, x ≤ y, x ≥ 0, y ≥ 0, the maximum value of Z is 180. Which of the following is true about the maximum?
- 611 mark
Question 61
For the LPP: Minimise Z = 200x + 500y subject to x + 2y ≥ 10, 3x + 4y ≤ 24, x ≥ 0, y ≥ 0, with corner points A(0, 5), B(4, 3), C(0, 6), the minimum value of Z is:
- 621 mark
Question 62
A furniture dealer has ₹50,000 to invest and storage for at most 60 items. A table costs ₹2500 and a chair ₹500. If x = number of tables and y = number of chairs, the investment constraint is:
- 631 mark
Question 63
A feasible region that cannot be enclosed within any circle is called:
- 641 mark
Question 64
(Hypothetical data.) A shopkeeper stocks units of item P and units of item Q. Her shelf holds at most 60 units in all, and her budget gives the constraint . She earns ₹30 per unit of P and ₹20 per unit of Q, so she maximises with , .
She now gets shelf space for 70 units in all, with the budget unchanged. By how much does her maximum profit increase?
- 651 mark
Question 65
In the furniture dealer problem (Section 12.2), a dealer buys x tables and y chairs. Profit per table = ₹250 and profit per chair = ₹75. The optimal solution is x = 10, y = 50. The maximum profit is:
- 661 mark
Question 66
For the LPP: Minimise and Maximise Z = 3x + 9y, with the minimum value of Z = 60 occurring at corner point B, the coordinates of B are:
- 671 mark
Question 67
The feasible region of a linear programming problem is given by
For which of the following objective functions is the maximum on attained only at and the minimum on attained only at ?
- 681 mark
Question 68
The shaded region in the figure is the feasible region of a linear programming problem. Apart from parts of the coordinate axes, its boundary lies on the lines , and ; each line passes through points of the grid.

For , the value of (maximum value of on ) (minimum value of on ) is
- 691 mark
Question 69
The feasible region of a linear programming problem is given by
and the objective function is , where is a real constant. The set of all values of for which the minimum value of on is attained at infinitely many points is
- 701 mark
Question 70
A relief agency packs family kits and child kits. A family kit needs volunteer-hours and carton; a child kit needs volunteer-hour and cartons. On a given day at most volunteer-hours and cartons are available. Agency rules say that the number of family kits must not exceed twice the number of child kits. A family kit serves people and a child kit serves people.
The maximum number of people the agency can serve that day is
- 711 mark
Question 71
Consider the linear programming problem: maximise subject to , , , , .
Assertion (A): Deleting the constraint from the problem does not change the maximum value of .
Reason (R): Every corner point of the feasible region obtained after deleting this constraint, except one, is also a corner point of the original region, and at that one new corner is smaller than the original maximum value.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 721 mark
Question 72
The feasible region of a linear programming problem is given by , , , . It is unbounded.
Assertion (A): No objective function , with and not both zero, can have both a maximum value and a minimum value on .
Reason (R): If the feasible region is unbounded, a maximum or a minimum value of may not exist; if it exists, it must occur at a corner point of the region.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 731 mark
Question 73
The feasible region of a linear programming problem is given by , , , . Its corner points are and . Let .
Assertion (A): has no minimum value on .
Reason (R): The smallest value of at the corner points of is , and the open half-plane has no point in common with .
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 741 mark
Question 74
The feasible region of a linear programming problem is given by , , , , . Let .
Assertion (A): The maximum value of on is attained at exactly one point.
Reason (R): is bounded.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 751 mark
Question 75
The feasible region of a linear programming problem is given by , , , . Let .
Assertion (A): The minimum value of on is attained at infinitely many points.
Reason (R): takes the same value at two adjacent corner points of , and the open half-plane has no point in common with .
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 761 mark
Question 76
A firm makes units of product P and units of product Q a day, subject to , , , . Its profit (in thousands of rupees) is .
Assertion (A): If the profit per unit of Q is doubled, so that the profit becomes , the optimal production plan stays the same.
Reason (R): Doubling the coefficient of changes the slope of the lines on which the profit is constant.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 771 mark
Question 77
A caterer prepares litres of soup and litres of curry. Her orders and her stove time give , , , , and her earnings (in hundreds of rupees) are .
Assertion (A): The feasible region consists of exactly one point.
Reason (R): has no maximum value on this region.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 781 mark
Question 78
The feasible region of a linear programming problem is given by , , , . Let .
Assertion (A): has a maximum value on , and this value is .
Reason (R): Every point of satisfies .
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 791 mark
Question 79
The feasible region of a linear programming problem is given by , , , . Let .
Assertion (A): The minimum value of on is .
Reason (R): takes a larger value at than at .
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
- 801 mark
Question 80
For a linear programming problem with feasible region , the objective function , where and , attains its maximum value on at both and .
Assertion (A): also attains its maximum value on at the point .
Reason (R): If attains its maximum value at two points of the feasible region, then it attains the same maximum value at every point of the line segment joining them.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
