CMA Intermediate · Operations Management and Strategic Management · Transportation
In a balanced transportation problem with 3 sources and 4 destinations, how many decision variables and how many constraints (excluding non-negativity) does the linear programming formulation contain?
The formulation has 12 variables and 7 constraints. Every source-destination pair is a variable, giving 3 times 4 equals 12, while each source has one supply equation and each destination one demand equation, giving 3 plus 4 equals 7.
- A12 variables and 7 constraintsCorrect
- B7 variables and 12 constraints
- C12 variables and 12 constraints
- D7 variables and 7 constraints
Explanation
Each source-destination route gives one variable, so 3 x 4 = 12 variables. There is one supply constraint per source (3) and one demand constraint per destination (4), giving 7 constraints. Option 7 and 12 swaps the counts, which is the key mistake.
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
- In a transportation problem, the route from Source S2 to Destination D3 is blocked because of a flood-damaged bridge. The correct way to tre…
- A firm has three plants with total capacity of 900 units and four depots with total requirement of 750 units. To solve by the standard trans…
- In a transportation problem, a unit cost of Rs 1,000,000 (a very large value, M) is assigned to a particular source-destination route. What …
- In the final MODI table of a minimisation transportation problem, all unoccupied cells have positive opportunity costs except one cell, whic…
- Three warehouses have supplies of 50, 40 and 30 units, while three markets need 35, 30 and 25 units. Before applying any initial solution me…
- A transportation problem has 3 sources and 4 destinations and is balanced. How many cells must be occupied in a non-degenerate initial basic…