GATE 2014 ME Set 2 · Question 28
If there are sources and destinations in a transportation matrix, the total number of basic variables in a basic feasible solution is
- A
- B
- C
- D
GATE 2014 · Mechanical Engineering · Set 2 · IIT Kharagpur · printed as Q.18 in the ME section
Answer
From the official answer key published by IIT Kharagpur.
Worked solution
In a transportation problem with sources and destinations, there are supply constraints and demand constraints, giving a total of equations:
Since the total supply equals the total demand (balanced problem), one constraint is redundant. Thus, the rank of the constraint matrix is .
Consequently, the number of linearly independent constraints is , which equals the total number of basic variables (allocations) in any basic feasible solution.
Answer: (C)
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 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…
- 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…
Question from the official GATE 2014 ME paper (Set 2), IIT Kharagpur. Solutions by PARIXO AI. All 65 questions of this paper.