CMA Final · Strategic Cost Management · Transportation
A transport planner at a Pune distribution firm has a balanced transportation problem with 3 godowns (origins) and 4 retail hubs (destinations). How many occupied (basic) cells must a non-degenerate basic feasible solution contain?
A non-degenerate basic feasible solution needs m + n - 1 occupied cells, so with 3 origins and 4 destinations it needs 6. Using m + n gives 7, and the table has 12 cells in all, but only 6 are occupied in a basic solution.
- A7
- B6Correct
- C12
- D5
Explanation
A non-degenerate basic feasible solution has m + n - 1 occupied cells. With m = 3 and n = 4 this gives 3 + 4 - 1 = 6. The figure 7 comes from wrongly using m + n, and 12 is the total number of cells in the table.
Did you get it right without looking?
One question tells you little. A timed set on Transportation shows your real accuracy, how long you take and where you lose marks.
More Transportation questions
- A transportation problem has 3 sources and 4 destinations. An initial feasible solution by the North-West Corner method has only 5 occupied …
- A cement firm ships from plants P1, P2, P3 (supply 40, 30, 30 tonnes) to markets D1, D2, D3 (demand 30, 40, 30 tonnes). Unit costs in rupees…
- A transportation problem has two sources and three destinations. Unit costs in rupees are S1: 8, 6, 10 and S2: 9, 7, 5 for D1, D2, D3. The c…
- A firm has three plants (A, B, C) and three markets (D1, D2, D3). Unit costs (Rs) are A: 8, 5, 9; B: 6, 10, 7; C: 11, 12, 13. Under Vogel's …
- A firm wants to maximise profit in a transportation problem. The highest unit profit in the matrix is ₹30. To solve it using the minimisatio…