GATE 2017 ME Set 1 · Question 51
Two models, P and Q, of a product earn profits of Rs. 100 and Rs. 80 per piece, respectively. Production times for P and Q are 5 hours and 3 hours, respectively, while the total production time available is 150 hours. For a total batch size of 40, to maximize profit, the number of units of P to be produced is _______
GATE 2017 · Mechanical Engineering · Set 1 · IIT Roorkee
Answer
From the official answer key published by IIT Roorkee.
Worked solution
Let and be the number of units of models P and Q to be produced, respectively.
The objective is to maximize profit:
Subject to the constraints:
1. Total batch size:
2. Total production time:
3. Non-negativity:
Substituting into the time constraint:
Substituting into the objective function:
Since profit is strictly increasing with , maximum profit occurs at the upper limit .
Answer: 15
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 2017 ME Set 2 · Q51Maximize Z = 5x1 + 3x2, subject to x1 + 2x2 ≤ 10, x1 - x2 ≤ 8, x1, x2 ≥ 0. In the starting Simplex tableau,…
- GATE 2016 ME Set 1 · Q65Maximize Z = 15X1 + 20X2 subject to 12X1 + 4X2 ≥ 36 12X1 - 6X2 ≤ 24 X1, X2 ≥ 0 The above linear programming…
- GATE 2016 ME Set 3 · Q65A firm uses a turning center, a milling center and a grinding machine to produce two parts. The table below…
- 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,…
Question from the official GATE 2017 ME paper (Set 1), IIT Roorkee. Solutions by PARIXO AI. All 65 questions of this paper.