CBSE Class 12 · 2018 · Linear ProgrammingLong Answer

WhatsApp Email
A factory manufactures two types of screws, A and B, each type requiring the use of two machines, an automatic and a hand-operated. It takes 4 minutes on the automatic and 6 minutes on the hand-operated machine to manufacture a packet of screws 'A', while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a packet of screws 'B'. Each machine is available for at most 4 hours on any day. The manufacturer can sell a packet of screws 'A' at a profit of 70 paise and screws 'B' at a profit of Rs. 1. Assuming that he can sell all the screws he manufactures, how many packets of each type should the factory owner produce in a day in order to maximize his profit? Formulate the above LPP and solve it graphically and find the maximum profit.

Answer: Max profit = Rs 41 at (30, 20): 30 packets of A and 20 packets of B

Solution

Let packets of screw A and packets of screw B be produced per day.
Profit: .
Automatic machine (240 min):
Hand-operated machine (240 min):

Corner points: , , (intersection of and ) and .
Evaluate :
:
: ← maximum
:

The factory should produce 30 packets of screw A and 20 packets of screw B for a maximum profit of Rs 41.
Structure Feasible region for 2x + 3y = 120 and 2x + y = 80, with corner points O(0, 0), A(0, 40), B(30, 20) and C(40, 0).
Feasible region for 2x + 3y = 120 and 2x + y = 80, with corner points O(0, 0), A(0, 40), B(30, 20) and C(40, 0).

CBSE Class 12 Board · 2018 · 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 →