GATE 2024 ME · Question 65
In a supplier-retailer supply chain, the demand of each retailer, the capacity of each supplier, and the unit cost in rupees of material supply from each supplier to each retailer are tabulated below. The supply chain manager wishes to minimize the total cost of transportation across the supply chain.
| | Retailer I | Retailer II | Retailer III | Retailer IV | Capacity |
| :--- | :---: | :---: | :---: | :---: | :---: |
| Supplier A | 11 | 16 | 19 | 13 | 300 |
| Supplier B | 5 | 10 | 7 | 8 | 300 |
| Supplier C | 12 | 14 | 17 | 11 | 300 |
| Supplier D | 8 | 15 | 11 | 9 | 300 |
| Demand | 300 | 300 | 300 | 300 | |
The optimal cost of satisfying the total demand from all retailers is _______ rupees *(answer in integer)*.
GATE 2024 · Mechanical Engineering · IISc Bangalore
Answer
From the official answer key published by IISc Bangalore.
Worked solution
Since the capacity of each supplier and the demand of each retailer are equal ( units), this problem is equivalent to an assignment problem scaled by .
Unit cost matrix:
Applying the Hungarian method:
1. Row reduction (subtract row minimums: ):
2. Column reduction (subtract column minimums: ):
Covering zeros requires 3 lines. The minimum uncovered value is . Adjusting the matrix yields the optimal zero assignments:
- Supplier A Retailer I (cost )
- Supplier B Retailer III (cost )
- Supplier C Retailer II (cost )
- Supplier D Retailer IV (cost )
Total unit cost:
Answer: 12300
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 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…
- GATE 2018 ME Set 2 · Q61The arc lengths of a directed graph of a project are as shown in the figure. The shortest path length from…
- GATE 2017 ME Set 2 · Q48A product made in two factories, P and Q, is transported to two destinations, R and S. The per unit costs of…
- 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
Question from the official GATE 2024 ME paper, IISc Bangalore. Solutions by PARIXO AI. All 65 questions of this paper.