PARIXO GATE · ME Open the app

GATE 2022 ME Set 2 · Question 42

2 marksMultiple choiceIndustrial EngineeringLinear Programming and Simplex Method

A manufacturing unit produces two products P1 and P2. For each piece of P1 and P2, the table below provides quantities of materials M1, M2, and M3 required, and also the profit earned. The maximum quantity available per day for M1, M2 and M3 is also provided. The maximum possible profit per day is ₹ ___________

| | M1 | M2 | M3 | Profit per piece<br>(₹) |
| :---: | :---: | :---: | :---: | :---: |
| P1 | 2 | 2 | 0 | 150 |
| P2 | 3 | 1 | 2 | 100 |
| Maximum quantity<br>available per day | 70 | 50 | 40 | |

  1. A

    5000

  2. B

    4000

  3. C

    3000

  4. D

    6000

GATE 2022 · Mechanical Engineering · Set 2 · IIT Kharagpur

Answer
(B)

From the official answer key published by IIT Kharagpur.

Worked solution

Let and denote the daily production of products and , respectively.

The linear programming problem is formulated as:

Subject to:



Find the corner points of the feasible region:
1. Origin :
2. Intersection of M2 with :
3. Intersection of M1 and M2:

Checking M3: (feasible).

4. Intersection of M1 and :

Checking M2: (feasible).

5. Intersection of and :

The maximum profit is ₹.

Answer: (B) 4000

Practise Linear Programming and Simplex Method

14 GATE questions from this chapter, in short untimed sets, with the formula sheet beside them. Free.

More from Linear Programming and Simplex Method

Question from the official GATE 2022 ME paper (Set 2), IIT Kharagpur. Solutions by PARIXO AI. All 65 questions of this paper.