Confirming your payment

Skip to content

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

  1. 1

    Question 1

    Shown below is a linear programming problem (LPP).

    Maximise Z=x+y\mathbf{Z}=\boldsymbol{x}+\boldsymbol{y}

    subject to the constraints:

    x+y≤1x+y \leq 1

    −3x+y≥3-3 x+y \geq 3

    x≥0\boldsymbol{x} \boldsymbol{\geq} \mathbf{0} y≥0\boldsymbol{y} \boldsymbol{\geq} \mathbf{0}

    Which of the following is true about the feasible region of the above LPP?

    MCQMedium
    1 mark
  2. 2

    Question 2

    Inequality y−x≤0y - x \leq 0 represents:

    MCQMedium
    1 mark
  3. 3

    Question 3

    An LPP has the constraints

    x+y≤10,2x+y≤16,y≤6,x+3y≤30,x≥0,y≥0x + y \le 10, \quad 2x + y \le 16, \quad y \le 6, \quad x + 3y \le 30, \quad x \ge 0, \quad y \ge 0

    Which one of the constraints can be removed without changing the feasible region?

    MCQMedium
    1 mark
  4. 4

    Question 4

    The inequalities 5x+4y≥20,x≤6,y≤4,x≥0,y≥05x + 4y \geq 20, x \leq 6, y \leq 4, x \geq 0, y \geq 0 form:

    MCQEasy
    1 mark
  5. 5

    Question 5

    The constraints

    −x1+x2≤1,−x1+3x2≤9,x1,x2≥0-x_1 + x_2 \leq 1, \quad -x_1 + 3x_2 \leq 9, \quad x_1, x_2 \geq 0

    define on:

    MCQMedium
    1 mark
  6. 6

    Question 6

    The maximum value of P=x+3yP = x + 3y such that:

    2x+y≤20,x+2y≤20,x≥0,y≥02x + y \leq 20, \quad x + 2y \leq 20, \quad x \geq 0, \quad y \geq 0

    is:

    MCQMedium
    1 mark
  7. 7

    Question 7

    If a point (h,k)(h, k) satisfies an inequality ax+by≥4ax + by \geq 4, then the half-plane represented by the inequality is:

    MCQEasy
    1 mark
  8. 8

    Question 8

    A workshop makes xx chairs and yy stools a day. Its feasible region is given by 3x+y≤153x + y \le 15, 3x+4y≤243x + 4y \le 24, x≥0x \ge 0, y≥0y \ge 0, and its daily profit (in hundreds of rupees) is Z=3x+2yZ = 3x + 2y.

    Assertion (A): The expression W=6x+4y−10W = 6x + 4y - 10 attains its maximum value 2626 on this region, at the point (4,3)(4, 3).

    Reason (R): W=2Z−10W = 2Z - 10, and multiplying ZZ 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.
    Medium
    1 mark
  9. 9

    Question 9

    The solution of the linear inequality 2x−9≥02x - 9 \geq 0 in the variable xx is represented on the number line by:

    MCQEasy
    1 mark
  10. 10

    Question 10

    The feasible region of an LPP is determined by the constraints

    x+2y≤10,3x+y≤15,x≥0,y≥0x + 2y \le 10, \quad 3x + y \le 15, \quad x \ge 0, \quad y \ge 0

    Which of the following points is a corner point of this feasible region?

    MCQMedium
    1 mark
  11. 11

    Question 11

    Problem:
    The solution set of constraints x+2y≥11,3x+4y≤30,2x+5y≤30x + 2y \geq 11, 3x + 4y \leq 30, 2x + 5y \leq 30 and x≥0,y≥0x \geq 0, y \geq 0 includes the point:

    MCQMedium
    1 mark
  12. 12

    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.

    Medium
    1 mark
  13. 13

    Question 13

    Which of the following is the objective function in a Linear Programming Problem?

    MCQMedium
    1 mark
  14. 14

    Question 14

    The common region determined by all the constraints including non-negative restrictions of an LPP is called the:

    MCQEasy
    1 mark
  15. 15

    Question 15

    The variables x and y in an LPP whose values are to be determined to optimise the objective function are called:

    MCQEasy
    1 mark
  16. 16

    Question 16

    According to the Corner Point Method, the optimal value of Z = ax + by for a bounded feasible region occurs at:

    MCQMedium
    1 mark
  17. 17

    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:

    MCQMedium
    1 mark
  18. 18

    Question 18

    A point that lies outside the feasible region of an LPP is called:

    MCQMedium
    1 mark
  19. 19

    Question 19

    In an LPP, the linear inequalities or equations that restrict the values of the decision variables are called:

    MCQMedium
    1 mark
  20. 20

    Question 20

    The feasible region of a system of linear inequalities is always:

    MCQMedium
    1 mark
  21. 21

    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:

    MCQMedium
    1 mark
  22. 22

    Question 22

    If an LPP has no point simultaneously satisfying all its constraints, then the LPP is said to have:

    MCQMedium
    1 mark
  23. 23

    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.
    Medium
    1 mark
  24. 24

    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.
    Medium
    1 mark
  25. 25

    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.
    Medium
    1 mark
  26. 26

    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.
    Medium
    1 mark
  27. 27

    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.
    Medium
    1 mark
  28. 28

    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

    Medium
    5 marks
  29. 29

    Question 29

    A grocer stocks xx quintals of rice and yy quintals of wheat. His storeroom holds at most 88 quintals in all, and his supplier can give him at most 55 quintals of rice, so x+y≤8x + y \le 8, x≤5x \le 5, x≥0x \ge 0, y≥0y \ge 0. His profit (in hundreds of rupees) is Z=4x+3yZ = 4x + 3y.

    Assertion (A): The maximum profit is ₹2900, obtained by stocking 55 quintals of rice and 33 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.
    Medium
    1 mark
  30. 30

    Question 30

    The feasible region RR of a linear programming problem is given by x+2y≥6x + 2y \ge 6, 2x+y≥62x + y \ge 6, x≥0x \ge 0, y≥0y \ge 0. Let Z=x+yZ = x + y.

    Assertion (A): ZZ has no maximum value on RR.

    Reason (R): The minimum value of ZZ on RR is 44, attained at (2,2)(2, 2).

    • (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.
    Medium
    1 mark
  31. 31

    Question 31

    A dietitian mixes xx packets of food P and yy packets of food Q. The nutrient requirements give x+y≥6x + y \ge 6, 2x+y≥82x + y \ge 8, x≥0x \ge 0, y≥0y \ge 0, and the cost (in tens of rupees) is Z=x+3yZ = x + 3y.

    Assertion (A): The minimum value of ZZ occurs at the point where the lines x+y=6x + y = 6 and 2x+y=82x + y = 8 meet.

    Reason (R): The feasible region is unbounded, but ZZ 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.
    Medium
    1 mark
  32. 32

    Question 32

    A hostel orders xx crates of milk and yy crates of juice for a sports day. It needs at least 44 crates in all, the dairy can supply at most 55 crates of milk and the juice supplier at most 33 crates of juice, so x+y≥4x + y \ge 4, x≤5x \le 5, y≤3y \le 3, x≥0x \ge 0, y≥0y \ge 0. The cost (in hundreds of rupees) is Z=3x+5yZ = 3x + 5y.

    Assertion (A): The minimum cost is ₹1200, obtained by ordering 44 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 (0,0)(0, 0).

    • (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.
    Medium
    1 mark
  33. 33

    Question 33

    A hostel warden prepares the evening health drink from two powders, P and Q, bought in packs. One pack of P supplies 33 units of iron and 11 unit of calcium. One pack of Q supplies 11 unit of iron and 22 units of calcium. Each evening's batch must contain at least 1212 units of iron and at least 1414 units of calcium. A pack of P costs ₹40 and a pack of Q costs ₹30. The warden uses xx packs of P and yy 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).

    Medium
    5 marks
  34. 34

    Question 34

    A small unit makes desk lamps and wall lamps. Each day it makes xx desk lamps and yy wall lamps. Its assembly time and its testing time are both limited, and these two limits, together with x≥0x \ge 0 and y≥0y \ge 0, give the shaded feasible region RR shown below. The boundary line L1L_1 (assembly) passes through (15,0)(15, 0) and (0,10)(0, 10), and the boundary line L2L_2 (testing) passes through (9,0)(9, 0) and (0,18)(0, 18). The lines cross at the vertex BB. The unit earns ₹50 on a desk lamp and ₹40 on a wall lamp, and it can sell everything it makes.

    Class 12 Maths Linear Programming

    Attempt any four of the following five sub-questions.

    (a) Find the equations of L1L_1 and L2L_2, and write the two constraints which, together with x≥0x \ge 0 and y≥0y \ge 0, describe RR.

    (b) Find the coordinates of BB.

    (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 88 desk lamps and 44 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 ₹kk, while the profit on a desk lamp stays ₹50. Find the value of kk for which the maximum profit is obtained both at BB and at the vertex (0,10)(0, 10).

    Medium
    5 marks
  35. 35

    Question 35

    A dairy cooperative has two chilling centres, A and B. On a certain day centre A has 5050 cans of milk and centre B has 6060 cans. Two retail booths, P and Q, need 4040 cans and 5050 cans respectively, and their needs must be met exactly. The cost of carrying one can is given below.

    FromTo booth PTo booth Q
    Centre A₹6₹3
    Centre B₹5₹4

    Centre A sends xx cans to P and yy 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 xx and yy, and write down all the constraints on xx and yy.

    (b) Show that the total transport cost is Z=x−y+400Z = x - y + 400 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.

    Medium
    5 marks
  36. 36

    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 1212 spots a week, and the institute wants at least 22 newspaper advertisements every week. A radio spot reaches about 40004000 people and a newspaper advertisement about 60006000 people. Let xx be the number of radio spots and yy 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 60,00060{,}000 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 66,00066{,}000 people, still with at most 1212 radio spots and at least 22 newspaper advertisements, and with no fixed budget. Find the least amount it must spend.

    Medium
    5 marks
  37. 37

    Question 37

    A plant nursery prepares a batch of potting mix from compost and cocopeat. A batch may weigh at most 2020 kg. Compost supplies 22 units of nutrient per kg and cocopeat 11 unit per kg, and a batch needs at least 1616 units of nutrient. To keep the mix airy, the mass of compost may exceed the mass of cocopeat by at most 22 kg. Compost costs ₹30 per kg and cocopeat ₹20 per kg. Let a batch contain xx kg of compost and yy 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 2020 kg. Find the cheapest such batch and its cost.

    Medium
    5 marks
  38. 38

    Question 38

    A school is organising an overnight nature camp. It can rent small tents and large tents. A small tent sleeps 1010 students and costs ₹2000 for the night; a large tent sleeps 2020 students and costs ₹5000. The campsite has only 99 tent pitches, so at most 99 tents can be put up, and the school's budget for tents is ₹30,000. Let xx be the number of small tents and yy the number of large tents.

    Attempt any four of the following five sub-questions.

    (a) Write the constraints on xx and yy 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) 150150 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 120120 students, so the tents must sleep at least 120120. Find the corner points of the new feasible region.

    (e) Find the cheapest plan for these 120120 students and its cost.

    Medium
    5 marks
  39. 39

    Question 39

    A hospital kitchen staffs its day shift with full-time cooks, who work 88 hours each, and part-time cooks, who work 44 hours each. The shift needs at least 4848 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 1212 cooks in all. A full-time cook is paid ₹1200 for the shift and a part-time cook ₹500. Let xx full-time and yy 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 22 full-time and 88 part-time cooks. Show that this gives the required 4848 cook-hours and costs less than the answer to (c), and explain why it still cannot be used.

    Medium
    5 marks
  40. 40

    Question 40

    A farmer has 1010 hectares of land on which to grow groundnut and cotton this season. Groundnut needs 33 units of irrigation water per hectare and cotton needs 66 units per hectare, and the canal authority allows him at most 4848 units. On the advice of the agriculture officer, he will keep at least 22 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 xx hectares and cotton on yy 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 22 more hectares, so that he has 1212 hectares; the water allowance and the soil advice are unchanged. Find his new best plan and the increase in his maximum profit.

    Medium
    5 marks
  41. 41

    Question 41

    The maximum value of z=2x+5yz = 2x + 5y subject to the constraints:

    2x+5y≤10,x+2y≥1,x−y≤4,x≥0,y≥02x + 5y \leq 10, \quad x + 2y \geq 1, \quad x - y \leq 4, \quad x \geq 0, y \geq 0

    occurs at:

    MCQHard
    1 mark
  42. 42

    Question 42

    Minimum value of Z=3x+5yZ = 3x + 5y

    subject to constraints

    x+y≥2,x+3y≥3,x,y≥0x + y \geq 2, x + 3y \geq 3, x, y \geq 0:

    MCQMedium
    1 mark
  43. 43

    Question 43

    The corner points of the feasible region determined by the following system of linear inequalities:

    2x+y≤10,x+3y≤15,x,y≥02x + y \leq 10, \quad x + 3y \leq 15, \quad x, y \geq 0

    are (0,0),(5,0),(3,4),(0,5)(0,0), (5,0), (3,4), (0,5). Let Z=px+qyZ = px + qy, where p,q>0p, q > 0. Condition on pp and qq so that the maximum of ZZ occurs at both (3,4)(3, 4) and (0,5)(0, 5) is:

    MCQMedium
    1 mark
  44. 44

    Question 44

    Shaded region is represented by: Class 12 Maths Linear Programming

    MCQMedium
    1 mark
  45. 45

    Question 45

    The feasible region of an LPP is given by

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

    This region is unbounded. For which of the following objective functions does ZZ have NO minimum value on this region?

    MCQMedium
    1 mark
  46. 46

    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, Z=ax+byZ=a x+b y.

    Medium
    1 mark
  47. 47

    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 XX and YY, bond XX yielding 10%10 \% simple interest on the amount invested and bond YY yielding 15%15 \% simple interest on the amount invested. He wants to invest at least Rs 5000 in bond XX 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.

    Hard
    5 marks
  48. 48

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

    Hard
    5 marks
  49. 49

    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 10 km/hr10 \mathrm{~km} / \mathrm{hr}, he burns 90cal/km90 \mathrm{cal} / \mathrm{km}. If he runs at a faster speed of 16 km/hr16 \mathrm{~km} / \mathrm{hr}, the calories burnt increases to 150 cal/km\mathbf{1 5 0 ~ c a l} / \mathbf{k m}. 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.)

    Medium
    3 marks
  50. 50

    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 Rs⁡4\operatorname{Rs} 4. 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.

    Medium
    3 marks
  51. 51

    Question 51

    The objective function of a linear programming problem is given by z=ax+by\mathbf{z}=\mathbf{a x}+\mathbf{b} \boldsymbol{y}; where aa and bb are constants. If the minimum of ZZ occurs at two points, (50,30)(50,30) and (20,40)(20,40), find the relationship between a and b. Show your work.

    Hard
    2 marks
  52. 52

    Question 52

    Sameer framed the following linear programming problem to minimise the monthly operational cost in running his bakery.

    Minimise Z=200x+300y\mathbf{Z} \boldsymbol{=} \mathbf{2 0 0} \boldsymbol{x} \boldsymbol{+} \mathbf{3 0 0} \boldsymbol{y}

    subject to the constraints:

    2x+3y≥12002 x+3 y \geq 1200

    1.5y+2x≥9001.5 y+2 x \geq 900

    x+y≤400x+y \leq 400

    x,y≥0x, y \geq 0

    where xx is the number of orders for bread loaves and yy is the number of orders for cakes. Graph the feasible region for Sameer's LPP and find the optimal solution.

    Hard
    2 marks
  53. 53

    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 typeMaximum capacityRental cost (in Rs.)
    Large503000
    Medium402000

    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.

    Medium
    4 marks
  54. 54

    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:

    FromTo Dwarka (in Rs)To Saket (in Rs)To Greater Kailash (in Rs)
    Noida101512
    Gurgaon121510

    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.

    Medium
    3 marks
  55. 55

    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 Rs24,00,000\mathbf{R s} \mathbf{2 4 , 0 0 , 0 0 0}. 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.

    Hard
    5 marks
  56. 56

    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 55\mathbf{5 5} 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.

    Hard
    5 marks
  57. 57

    Question 57

    For an LPP with an unbounded feasible region, which of the following statements is CORRECT?

    MCQMedium
    1 mark
  58. 58

    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:

    MCQMedium
    1 mark
  59. 59

    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?

    MCQMedium
    1 mark
  60. 60

    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?

    MCQMedium
    1 mark
  61. 61

    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:

    MCQMedium
    1 mark
  62. 62

    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:

    MCQMedium
    1 mark
  63. 63

    Question 63

    A feasible region that cannot be enclosed within any circle is called:

    MCQMedium
    1 mark
  64. 64

    Question 64

    (Hypothetical data.) A shopkeeper stocks xx units of item P and yy units of item Q. Her shelf holds at most 60 units in all, and her budget gives the constraint 2x+y≤1002x + y \le 100. She earns ₹30 per unit of P and ₹20 per unit of Q, so she maximises Z=30x+20yZ = 30x + 20y with x≥0x \ge 0, y≥0y \ge 0.

    She now gets shelf space for 70 units in all, with the budget unchanged. By how much does her maximum profit increase?

    MCQMedium
    1 mark
  65. 65

    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:

    MCQMedium
    1 mark
  66. 66

    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:

    MCQMedium
    1 mark
  67. 67

    Question 67

    The feasible region RR of a linear programming problem is given by

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

    For which of the following objective functions is the maximum on RR attained only at (6,4)(6, 4) and the minimum on RR attained only at (0,2)(0, 2)?

    MCQHard
    1 mark
  68. 68

    Question 68

    The shaded region RR 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 L1L_1, L2L_2 and L3L_3; each line passes through points of the grid.

    Class 12 Maths Linear Programming

    For Z=3x−4yZ = 3x - 4y, the value of (maximum value of ZZ on RR) −- (minimum value of ZZ on RR) is

    MCQHard
    1 mark
  69. 69

    Question 69

    The feasible region RR of a linear programming problem is given by

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

    and the objective function is Z=3x+kyZ = 3x + ky, where kk is a real constant. The set of all values of kk for which the minimum value of ZZ on RR is attained at infinitely many points is

    MCQHard
    1 mark
  70. 70

    Question 70

    A relief agency packs family kits and child kits. A family kit needs 22 volunteer-hours and 11 carton; a child kit needs 11 volunteer-hour and 22 cartons. On a given day at most 1818 volunteer-hours and 1212 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 55 people and a child kit serves 44 people.

    The maximum number of people the agency can serve that day is

    MCQHard
    1 mark
  71. 71

    Question 71

    Consider the linear programming problem: maximise Z=x+2yZ = x + 2y subject to x+y≤9x + y \le 9, 2x+y≤142x + y \le 14, x+3y≤21x + 3y \le 21, x≥0x \ge 0, y≥0y \ge 0.

    Assertion (A): Deleting the constraint 2x+y≤142x + y \le 14 from the problem does not change the maximum value of ZZ.

    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 ZZ 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.
    Hard
    1 mark
  72. 72

    Question 72

    The feasible region RR of a linear programming problem is given by x−y≥1x - y \ge 1, x−y≤3x - y \le 3, x≥0x \ge 0, y≥0y \ge 0. It is unbounded.

    Assertion (A): No objective function Z=ax+byZ = ax + by, with aa and bb not both zero, can have both a maximum value and a minimum value on RR.

    Reason (R): If the feasible region is unbounded, a maximum or a minimum value of ZZ 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.
    Hard
    1 mark
  73. 73

    Question 73

    The feasible region RR of a linear programming problem is given by x+2y≥8x + 2y \ge 8, −x+y≤1-x + y \le 1, x≥0x \ge 0, y≥0y \ge 0. Its corner points are (2,3)(2, 3) and (8,0)(8, 0). Let Z=2x−3yZ = 2x - 3y.

    Assertion (A): ZZ has no minimum value on RR.

    Reason (R): The smallest value of ZZ at the corner points of RR is −5-5, and the open half-plane 2x−3y<−52x - 3y < -5 has no point in common with RR.

    • (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.
    Medium
    1 mark
  74. 74

    Question 74

    The feasible region RR of a linear programming problem is given by x+y≤7x + y \le 7, 2x+y≤102x + y \le 10, y≤5y \le 5, x≥0x \ge 0, y≥0y \ge 0. Let Z=5x+2yZ = 5x + 2y.

    Assertion (A): The maximum value of ZZ on RR is attained at exactly one point.

    Reason (R): RR 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.
    Medium
    1 mark
  75. 75

    Question 75

    The feasible region RR of a linear programming problem is given by 2x+3y≥122x + 3y \ge 12, x+y≥5x + y \ge 5, x≥0x \ge 0, y≥0y \ge 0. Let Z=6x+9yZ = 6x + 9y.

    Assertion (A): The minimum value of ZZ on RR is attained at infinitely many points.

    Reason (R): ZZ takes the same value 3636 at two adjacent corner points of RR, and the open half-plane 6x+9y<366x + 9y < 36 has no point in common with RR.

    • (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.
    Medium
    1 mark
  76. 76

    Question 76

    A firm makes xx units of product P and yy units of product Q a day, subject to x+y≤8x + y \le 8, x+3y≤18x + 3y \le 18, x≥0x \ge 0, y≥0y \ge 0. Its profit (in thousands of rupees) is Z=3x+2yZ = 3x + 2y.

    Assertion (A): If the profit per unit of Q is doubled, so that the profit becomes Z′=3x+4yZ' = 3x + 4y, the optimal production plan stays the same.

    Reason (R): Doubling the coefficient of yy 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.
    Medium
    1 mark
  77. 77

    Question 77

    A caterer prepares xx litres of soup and yy litres of curry. Her orders and her stove time give x+y≥6x + y \ge 6, 2x+3y≤122x + 3y \le 12, x≥0x \ge 0, y≥0y \ge 0, and her earnings (in hundreds of rupees) are Z=4x+3yZ = 4x + 3y.

    Assertion (A): The feasible region consists of exactly one point.

    Reason (R): ZZ 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.
    Medium
    1 mark
  78. 78

    Question 78

    The feasible region RR of a linear programming problem is given by 3x+2y≥123x + 2y \ge 12, x+2y≥8x + 2y \ge 8, x≥0x \ge 0, y≥0y \ge 0. Let Z=−3x−yZ = -3x - y.

    Assertion (A): ZZ has a maximum value on RR, and this value is −6-6.

    Reason (R): Every point of RR satisfies 3x+y≥63x + y \ge 6.

    • (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.
    Medium
    1 mark
  79. 79

    Question 79

    The feasible region RR of a linear programming problem is given by x+y≥7x + y \ge 7, 2x+5y≥202x + 5y \ge 20, x≥0x \ge 0, y≥0y \ge 0. Let Z=5x+7yZ = 5x + 7y.

    Assertion (A): The minimum value of ZZ on RR is 3939.

    Reason (R): ZZ takes a larger value at (10,0)(10, 0) than at (0,7)(0, 7).

    • (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.
    Medium
    1 mark
  80. 80

    Question 80

    For a linear programming problem with feasible region RR, the objective function Z=ax+byZ = ax + by, where a>0a > 0 and b>0b > 0, attains its maximum value on RR at both (2,3)(2, 3) and (6,1)(6, 1).

    Assertion (A): ZZ also attains its maximum value on RR at the point (3,3)(3, 3).

    Reason (R): If ZZ 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.
    Hard
    1 mark