Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 34 of 80

A small unit makes desk lamps and wall lamps.

Question 345 marksMedium

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 Question 34

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