GATE 2016 ME Set 3 · Question 65
A firm uses a turning center, a milling center and a grinding machine to produce two parts. The table below provides the machining time required for each part and the maximum machining time available on each machine. The profit per unit on parts I and II are Rs. 40 and Rs. 100, respectively. The maximum profit per week of the firm is Rs. _______
| Type of machine | Machining time required for the machine part (minutes) | | Maximum machining time available per week (minutes) |
| :--- | :---: | :---: | :---: |
| | I | II | |
| Turning Center | 12 | 6 | 6000 |
| Milling Center | 4 | 10 | 4000 |
| Grinding Machine | 2 | 3 | 1800 |
GATE 2016 · Mechanical Engineering · Set 3 · IISc Bangalore · printed as Q.55 in the ME section
Answer
From the official answer key published by IISc Bangalore.
Worked solution
Let and be the number of units of parts I and II produced per week, respectively.
The objective is to maximize the weekly profit:
Subject to the machine availability constraints:
1. Turning Center:
2. Milling Center:
3. Grinding Machine:
and non-negativity .
Evaluating the corner points of the feasible region:
- At :
- At :
- At :
- At the intersection of constraints (1) and (2):
Subtracting gives , so .
Checking constraint (3): (feasible).
Thus, the maximum profit is Rs. 40000 per week.
Answer: 40000
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
- GATE 2015 ME Set 3 · Q61For the linear programming problem: arrayll Maximize Z = 3X1 + 2X2 Subject to -2X1 + 3X2 ≤ 9 X1 - 5X2 ≥ -20…
- GATE 2014 ME Set 3 · Q49Consider an objective function Z(x1, x2) = 3x1 + 9x2 and the constraints x1 + x2 ≤ 8, x1 + 2x2 ≤ 4, x1 ≥ 0,…
- GATE 2013 ME · Q36A linear programming problem is shown below. aligned Maximize 3x + 7y Subject to 3x + 7y ≤ 10 4x + 6y ≤ 8 x,…
- GATE 2026 ME · Q46An objective function Z of primal variables (x1 and x2) is described below: Minimize Z = 0.07 x1 + 0.05 x2…
- GATE 2024 ME · Q39At the current basic feasible solution (bfs) v0 ( v0 R5), the simplex method yields the following form of a…
- GATE 2023 ME · Q14Which one of the options given represents the feasible region of the linear programming model: Maximize 45X1…
Question from the official GATE 2016 ME paper (Set 3), IISc Bangalore. Solutions by PARIXO AI. All 65 questions of this paper.