GATE 2017 ME Set 2 · Question 48
A product made in two factories, P and Q, is transported to two destinations, R and S. The per unit costs of transportation (in Rupees) from factories to destinations are as per the following matrix:
| Factory \ Destination | R | S |
| :---: | :---: | :---: |
| P | 10 | 7 |
| Q | 3 | 4 |
Factory P produces 7 units and factory Q produces 9 units of the product. Each destination requires 8 units. If the north-west corner method provides the total transportation cost as (in Rupees) and the optimized (the minimum) total transportation cost is (in Rupees), then , in Rupees, is
- A
0
- B
15
- C
35
- D
105
GATE 2017 · Mechanical Engineering · Set 2 · IIT Roorkee
Answer
From the official answer key published by IIT Roorkee.
Practise Transportation, Assignment and Network Flow
8 GATE questions from this chapter, in short untimed sets, with the formula sheet beside them. Free.
More from Transportation, Assignment and Network Flow
- GATE 2014 ME Set 2 · Q28If there are m sources and n destinations in a transportation matrix, the total number of basic variables in…
- GATE 2014 ME Set 3 · Q31A minimal spanning tree in network flow models involves
- GATE 2014 ME Set 4 · Q28The total number of decision variables in the objective function of an assignment problem of size n × n (n…
- GATE 2024 ME · Q65In a supplier-retailer supply chain, the demand of each retailer, the capacity of each supplier, and the…
- GATE 2022 ME Set 1 · Q58An assignment problem is solved to minimize the total processing time of four jobs (1, 2, 3 and 4) on four…
- GATE 2019 ME Set 1 · Q64Five jobs (J1, J2, J3, J4 and J5) need to be processed in a factory. Each job can be assigned to any of the…
Question from the official GATE 2017 ME paper (Set 2), IIT Roorkee. Solutions by PARIXO AI. All 65 questions of this paper.