CBSE Class 12 · 2017 · Linear ProgrammingLong Answer

WhatsApp Email
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 Rs. 100 and that on a bracelet is Rs. 300, formulate an L.P.P. for finding how many of each should be produced daily to maximize the profit. It is given that at least one of each must be produced.

Answer: Maximize P = 100x + 300y subject to x + y ≤ 24, x + 2y ≤ 32, x ≥ 1, y ≥ 1

Solution

Let necklaces and bracelets be produced per day.
Profit to maximise: .
Total number:
Time:
At least one of each:
This is the required formulation of the L.P.P.:

CBSE Class 12 Board · 2017 · Subjective

More board questions on Linear Programming

  1. Solve the following Linear Programming problem graphically:
    Maximize
    subject to



    CBSE 2024View solution →
  2. The objective function of an LPP has maximum value 42 at and minimum value 19 at . Which of the following is true?
    CBSE 2023View solution →
  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:
    CBSE 2023View solution →
  4. Solve the following linear programming problem graphically:
    Maximize
    subject to the constraints



    CBSE 2023View solution →
  5. The corner points of the feasible region determined by the system of linear inequalities are , , and . If the maximum value of , where , occurs at both and , then:
    CBSE 2020View solution →
  6. A furniture trader deals in only two items — chairs and tables. He has Rs. 50,000 to invest and a space to store at most 35 items. A chair costs him Rs. 1000 and a table costs him Rs. 2000. The trader earns a profit of Rs. 150 and Rs. 250 on a chair and a table, respectively. For …
    CBSE 2020View solution →