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
