 | Service for Solving Linear Programming Problemsand other interesting typical problems |
Ðó |
Example ¹2. Transportation Problem by the Least Cost Method
(Unbalanced problem. Fictitious supplier)
This solution was made using the calculator presented on the site.
Example ¹1. Transportation problem by the Least Cost Method (Balanced problem)
Example ¹3. Transportation problem by the Least Cost Method (Unbalanced problem. Fictitious consumer)
Example ¹4. Transportation problem by the North-West Corner Method (Balanced problem)
Example ¹5. Transportation problem by the North-West Corner Method (Unbalanced problem. Fictitious supplier)
Example ¹6. Transportation problem by the North-West Corner Method (Unbalanced problem. Fictitious consumer)
Example ¹3. Transportation problem by the Least Cost Method (Unbalanced problem. Fictitious consumer)
Example ¹4. Transportation problem by the North-West Corner Method (Balanced problem)
Example ¹5. Transportation problem by the North-West Corner Method (Unbalanced problem. Fictitious supplier)
Example ¹6. Transportation problem by the North-West Corner Method (Unbalanced problem. Fictitious consumer)
X
Problem:
The cost of delivery of a unit of production from the supplier to the consumer is located in the lower right corner of the cell.
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 |
4
|
5
|
3
|
6
| 30 |
| A 2 |
7
|
2
|
1
|
5
| 25 |
| A 3 |
6
|
1
|
4
|
2
| 20 |
| Customer needs | 20 | 15 | 25 | 20 | |
It is necessary to find a transport plan in which the total cost of delivery will be the lowest.
Solution:
This is a necessary condition for solving the problem:
the total supply of suppliers should be equal to the total needs of consumers.
Let's check it.
The total supply of suppliers: 30 + 25 + 20 = 75 units.
The total needs of consumers: 20 + 15 + 25 + 20 = 80 units.
the total supply of suppliers should be equal to the total needs of consumers.
Let's check it.
The total supply of suppliers: 30 + 25 + 20 = 75 units.
The total needs of consumers: 20 + 15 + 25 + 20 = 80 units.
The difference is 5 units.
Let's enter a fictitious supplier A4 into use. Let supplier A4 has 5 units.
Let the cost of delivery from supplier A4 to all consumers is zero (see the table below).
Now the total supply of suppliers equals the total needs of consumers.
Let's enter a fictitious supplier A4 into use. Let supplier A4 has 5 units.
Let the cost of delivery from supplier A4 to all consumers is zero (see the table below).
Now the total supply of suppliers equals the total needs of consumers.
This is a necessary condition for solving the problem:
number of used routes = number of suppliers + number of consumers - 1.
Therefore, if we have a situation where it is necessary to exclude a column and a row at the same time, we will exclude one thing.
number of used routes = number of suppliers + number of consumers - 1.
Therefore, if we have a situation where it is necessary to exclude a column and a row at the same time, we will exclude one thing.
First of all we will use the routes with the lowest cost of delivery.
Routes from the fictitious supplier A4 to all consumers will be used last.
Perhaps this will help us reduce the total cost of delivery for the initial solution.
Perhaps this will help us reduce the total cost of delivery for the initial solution.
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 |
4
|
5
|
3
|
6
| 30 |
| A 2 |
7
|
2
| ?
1
|
5
| 25 |
| A 3 |
6
|
1
|
4
|
2
| 20 |
| A 4 |
0
|
0
|
0
|
0
| 5 |
| Customer needs | 20 | 15 | 25 | 20 | |
25 = min { 25, 25 } ?
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 |
4
|
5
|
3
|
6
| 30 |
| A 2 |
7
|
2
| 25
1
|
5
| 25 No |
| A 3 |
6
| ?
1
|
4
|
2
| 20 |
| A 4 |
0
|
0
|
0
|
0
| 5 |
| Customer needs | 20 | 15 | 25 0 | 20 | |
15 = min { 15, 20 }
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 |
4
|
5
|
3
|
6
| 30 |
| A 2 |
7
|
2
| 25
1
|
5
| 25 No |
| A 3 |
6
| 15
1
|
4
| ?
2
| 20 5 |
| A 4 |
0
|
0
|
0
|
0
| 5 |
| Customer needs | 20 | 15 No | 25 0 | 20 | |
5 = min { 20, 5 }
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 |
4
|
5
| ?
3
|
6
| 30 |
| A 2 |
7
|
2
| 25
1
|
5
| 25 No |
| A 3 |
6
| 15
1
|
4
| 5
2
| 20 5 No |
| A 4 |
0
|
0
|
0
|
0
| 5 |
| Customer needs | 20 | 15 No | 25 0 | 20 15 | |
0 = min { 0, 30 } ?
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | ?
4
|
5
| 0
3
|
6
| 30 30 |
| A 2 |
7
|
2
| 25
1
|
5
| 25 No |
| A 3 |
6
| 15
1
|
4
| 5
2
| 20 5 No |
| A 4 |
0
|
0
|
0
|
0
| 5 |
| Customer needs | 20 | 15 No | 25 0 No | 20 15 | |
20 = min { 20, 30 }
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 0
3
| ?
6
| 30 30 10 |
| A 2 |
7
|
2
| 25
1
|
5
| 25 No |
| A 3 |
6
| 15
1
|
4
| 5
2
| 20 5 No |
| A 4 |
0
|
0
|
0
|
0
| 5 |
| Customer needs | 20 No | 15 No | 25 0 No | 20 15 | |
10 = min { 15, 10 }
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 0
3
| 10
6
| 30 30 10 No |
| A 2 |
7
|
2
| 25
1
|
5
| 25 No |
| A 3 |
6
| 15
1
|
4
| 5
2
| 20 5 No |
| A 4 |
0
|
0
|
0
| ?
0
| 5 |
| Customer needs | 20 No | 15 No | 25 0 No | 20 15 5 | |
5 = min { 5, 5 }
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 0
3
| 10
6
| 30 30 10 No |
| A 2 |
7
|
2
| 25
1
|
5
| 25 No |
| A 3 |
6
| 15
1
|
4
| 5
2
| 20 5 No |
| A 4 |
0
|
0
|
0
| 5
0
| 5 No |
| Customer needs | 20 No | 15 No | 25 0 No | 20 15 5 No | |
Let's calculate the total cost of delivery for the initial solution.
20*4 + 0*3 + 10*6 + 25*1 + 15*1 + 5*2 + 5*0 = 190
Is the initial solution optimal?
Let's check this using the MODI method (UV method).
To each supplier A i we associate a some number U i
To each consumer B j we associate a some number V j
To each consumer B j we associate a some number V j
For the routes used: U + V = cost of delivery.
Let's find U i and V j step by step.
To do this, we need to enter the value of one of them. Let u1 = 0.
Let's find U i and V j step by step.
To do this, we need to enter the value of one of them. Let u1 = 0.
| A1B1 : | v1 + u1 = 4 | v1 = 4 - 0 = 4 |
| A1B3 : | v3 + u1 = 3 | v3 = 3 - 0 = 3 |
| A1B4 : | v4 + u1 = 6 | v4 = 6 - 0 = 6 |
| A2B3 : | v3 + u2 = 1 | u2 = 1 - 3 = -2 |
| A3B4 : | v4 + u3 = 2 | u3 = 2 - 6 = -4 |
| A4B4 : | v4 + u4 = 0 | u4 = 0 - 6 = -6 |
| A3B2 : | v2 + u3 = 1 | v2 = 1 - (-4) = 5 |
| Supplier | Consumer | U | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 0
3
| 10
6
| u1 = 0 |
| A 2 |
7
|
2
| 25
1
|
5
| u2 = -2 |
| A 3 |
6
| 15
1
|
4
| 5
2
| u3 = -4 |
| A 4 |
0
|
0
|
0
| 5
0
| u4 = -6 |
| V | v1 = 4 | v2 = 5 | v3 = 3 | v4 = 6 | |
Let's find evaluations of unused routes (cij - cost of delivery). ?
|
There is negative evaluation. Therefore it is possible to reduce the total cost of delivery.
STEP ¹1.
The cell A2B2 (unused route) is selected because its evaluation is negative.
Please, move the mouse cursor to the selected cell A2B2. Only horizontal and vertical cursor movements can be used.
Connect the filled cells with a continuous line so that you return to the cell A2B2.
The cells located at the vertices of the plotted line form a loop for the selected cell (see highlighted cells in the table below).
There is only one loop for cell A2B2.
Please, move the mouse cursor to the selected cell A2B2. Only horizontal and vertical cursor movements can be used.
Connect the filled cells with a continuous line so that you return to the cell A2B2.
The cells located at the vertices of the plotted line form a loop for the selected cell (see highlighted cells in the table below).
There is only one loop for cell A2B2.
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 0
3
| 10
6
| 30 |
| A 2 |
7
|
-1
2
| 25
1
|
5
| 25 |
| A 3 |
6
| 15
1
|
4
| 5
2
| 20 |
| A 4 |
0
|
0
|
0
| 5
0
| 5 |
| Customer needs | 20 | 15 | 25 | 20 | |
10 = min { 25, 10, 15 } ?
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 0
3
| 10
6
| 30 |
| A 2 |
7
|
-1
2
| 25
1
|
5
| 25 |
| A 3 |
6
| 15
1
|
4
| 5
2
| 20 |
| A 4 |
0
|
0
|
0
| 5
0
| 5 |
| Customer needs | 20 | 15 | 25 | 20 | |
This transformation will not change the balance.
But this transformation will change the total cost of delivery by:
2 * 10 - 1 * 10 + 3 * 10 - 6 * 10 + 2 * 10 - 1 * 10 = ( 2 - 1 + 3 - 6 + 2 - 1 ) * 10 = -1 * 10
You correctly noted that -1 * 10 = Δ22 * 10 ?
But this transformation will change the total cost of delivery by:
2 * 10 - 1 * 10 + 3 * 10 - 6 * 10 + 2 * 10 - 1 * 10 = ( 2 - 1 + 3 - 6 + 2 - 1 ) * 10 = -1 * 10
You correctly noted that -1 * 10 = Δ22 * 10 ?
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 0 + 10
3
| 10 - 10
6
| 30 |
| A 2 |
7
| +10
-1
2
| 25 - 10
1
|
5
| 25 |
| A 3 |
6
| 15 - 10
1
|
4
| 5 + 10
2
| 20 |
| A 4 |
0
|
0
|
0
| 5
0
| 5 |
| Customer needs | 20 | 15 | 25 | 20 | |
We have a new solution. ?
| Supplier | Consumer | Supply | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 10
3
|
6
| 30 |
| A 2 |
7
| 10
2
| 15
1
|
5
| 25 |
| A 3 |
6
| 5
1
|
4
| 15
2
| 20 |
| A 4 |
0
|
0
|
0
| 5
0
| 5 |
| Customer needs | 20 | 15 | 25 | 20 | |
We will calculate the total cost of delivery of the new solution.
S = 190 + Δ22 * 10 = 190 -1 * 10 = 180
Is the new solution optimal?
Let's check this using the MODI method (UV method).
To each supplier A i we associate a some number U i
To each consumer B j we associate a some number V j
To each consumer B j we associate a some number V j
For the routes used: U + V = cost of delivery.
Let's find U i and V j step by step.
To do this, we need to enter the value of one of them. Let u1 = 0.
Let's find U i and V j step by step.
To do this, we need to enter the value of one of them. Let u1 = 0.
| A1B1 : | v1 + u1 = 4 | v1 = 4 - 0 = 4 |
| A1B3 : | v3 + u1 = 3 | v3 = 3 - 0 = 3 |
| A2B3 : | v3 + u2 = 1 | u2 = 1 - 3 = -2 |
| A2B2 : | v2 + u2 = 2 | v2 = 2 - (-2) = 4 |
| A3B2 : | v2 + u3 = 1 | u3 = 1 - 4 = -3 |
| A3B4 : | v4 + u3 = 2 | v4 = 2 - (-3) = 5 |
| A4B4 : | v4 + u4 = 0 | u4 = 0 - 5 = -5 |
| Supplier | Consumer | U | |||
| B 1 | B 2 | B 3 | B 4 | ||
| A 1 | 20
4
|
5
| 10
3
|
6
| u1 = 0 |
| A 2 |
7
| 10
2
| 15
1
|
5
| u2 = -2 |
| A 3 |
6
| 5
1
|
4
| 15
2
| u3 = -3 |
| A 4 |
0
|
0
|
0
| 5
0
| u4 = -5 |
| V | v1 = 4 | v2 = 4 | v3 = 3 | v4 = 5 | |
Let's find evaluations of unused routes (cij - cost of delivery). ?
|
There are no negative evaluations. Therefore it is not possible to reduce the total cost of delivery.
Result:X opt = |  | 20 | 0 | 10 | 0 |  | |
| 0 | 10 | 15 | 0 | ||||
| 0 | 5 | 0 | 15 | ||||
| 0 | 0 | 0 | 5 |
Smin = 180
© 2010-2026 If you have any comments, please write to matematika1974@yandex.ru