Two factories P and Q have 7 units and 5 units of a product in stock. Three shops A, B and C need 4, 3 and 5 units respectively. The cost (in Rs.) of sending one unit is given below.
| From / To | A | B | C |
| P | 6 | 4 | 5 |
| Q | 3 | 5 | 4 |
Factory P sends x units to A and y units to B, and the rest of its stock to C. Shop needs are met exactly and the stocks are used up. Which of the following statements are correct?
(A) Factory Q sends \(x + y - 2\) units to shop C.
(B) The total cost of transport is \(Z = 2x - 2y + 54\).
(C) The minimum cost of transport is Rs. 50.
(D) In the cheapest plan, factory Q sends 4 units to shop A.
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → (A), (B) and (D) only
This is a transportation problem. Factory P sends x to A, y to B and the rest of its 7 units to C:
P to C: \(7 - x - y\)
Factory Q supplies what each shop still needs:
Q to A: \(4 - x\)
Q to B: \(3 - y\)
Q to C: \(5 - (7 - x - y) = x + y - 2\)
None of these can be negative, so
\(x \le 4,\ y \le 3,\ 2 \le x + y \le 7,\ x \ge 0,\ y \ge 0\)
The total cost is
\(Z = 6x + 4y + 5(7 - x - y) + 3(4 - x) + 5(3 - y) + 4(x + y - 2)\)
\(Z = 2x - 2y + 54\)
The corner points of the feasible region are (2, 0), (4, 0), (4, 3), (0, 3) and (0, 2). Values of Z:
\(Z(2, 0) = 58\)
\(Z(4, 0) = 62\)
\(Z(4, 3) = 56\)
\(Z(0, 3) = 48\)
\(Z(0, 2) = 50\)
The least cost is Rs. 48 at x = 0, y = 3. Then Q sends \(4 - 0 = 4\) units to A, \(3 - 3 = 0\) to B and \(0 + 3 - 2 = 1\) to C.
So Q sends \(x + y - 2\) units to C, the cost is \(Z = 2x - 2y + 54\), and the minimum cost is Rs. 48, with Q sending 4 units to A.
Checking the statements
(A) Factory Q sends \(x + y - 2\) units to shop C. — Correct. C needs 5 and gets \(7 - x - y\) from P, so Q sends \(x + y - 2\).
(B) The total cost of transport is \(Z = 2x - 2y + 54\). — Correct. The six costs add up to this.
(C) The minimum cost of transport is Rs. 50. — Incorrect. \(Z(0, 3) = 48\) is lower than 50.
(D) In the cheapest plan, factory Q sends 4 units to shop A. — Correct. At x = 0, Q sends \(4 - 0 = 4\) units to A.