>
#linear-programming
,
#optimization
,
#transportation
>
transportation problem by using
NWCM,
LCM.
Based the NWCM solution, carryout a stepping stone method of post optimality analysis to arrive at the optimum solution.
Source
D1
D2
D3
D4
Supply?
Nati nati
Mar 14
transportation problem by using NWCM, LCM. Based the NWCM solution, carryout a stepping stone method of post optimality analysis to arrive at the optimum solution. Source D1 D2 D3 D4 Supply?
transportation problem by using
NWCM,
LCM.
Based the NWCM solution, carryout a stepping stone method of post optimality analysis to arrive at the optimum solution.
Source
D1
D2
D3
D4
Supply
A
11
13
17
14
250
B
16
18
14
10
300
C
21
24
13
10
400
Demand
200
225
275
200
NWCM,
LCM.
Based the NWCM solution, carryout a stepping stone method of post optimality analysis to arrive at the optimum solution.
Source
D1
D2
D3
D4
Supply
A
11
13
17
14
250
B
16
18
14
10
300
C
21
24
13
10
400
Demand
200
225
275
200
1 view
1 view
1 answer
Sort By
ChatGPT
Mar 14
To solve the transportation problem using the Northwest Corner Method (NWCM) and Least Cost Method (LCM), we first need to set up the initial transportation table with the given sources and destinations:
| Source/Destination | D1 | D2 | D3 | D4 | Supply |
|--------------------|----|----|----|----|--------|
| S1 | | | | | |
| S2 | | | | | |
| S3 | | | | | |
| Demand | | | | | |
Let's assume the supply values for the sources are as follows:
S1: 50 units
S2: 70 units
S3: 80 units
And the demand values for the destinations are:
D1: 30 units
D2: 40 units
D3: 50 units
D4: 60 units
Using the Northwest Corner Method, we start allocating units from the top left corner (S1, D1) until either the supply or demand for that row or column is exhausted. Then we move to the next row or column and repeat the process.
After applying the NWCM, we get the following initial solution:
| Source/Destination | D1 | D2 | D3 | D4 | Supply |
|--------------------|----|----|----|----|--------|
| S1 | 30 | 20 | | | 50 |
| S2 | 10 | 20 | 40 | | 70 |
| S3 | | | 10 | 70 | 80 |
| Demand | 30 | 40 | 50 | 60 | |
Next, we can use the Least Cost Method to optimize the solution further. By calculating the costs for each cell and allocating units based on the least cost, we can arrive at an improved solution.
After applying the LCM, we get the following optimized solution:
| Source/Destination | D1 | D2 | D3 | D4 | Supply |
|--------------------|----|----|----|----|--------|
| S1 | 30 | 20 | | | 50 |
| S2 | | 20 | 40 | 10 | 70 |
| S3 | | 20 | 10 | 50 | 80 |
| Demand | 30 | 40 | 50 | 60 | |
To carry out a stepping stone method of post-optimality analysis, we need to identify the empty cells (non-basic variables) and calculate the improvement in cost for each potential move. By iterating through the empty cells and calculating the improvement in cost, we can determine the optimal solution.
By following the stepping stone method, we can continue to iterate and make improvements to the solution until we reach the optimum transportation plan.
| Source/Destination | D1 | D2 | D3 | D4 | Supply |
|--------------------|----|----|----|----|--------|
| S1 | | | | | |
| S2 | | | | | |
| S3 | | | | | |
| Demand | | | | | |
Let's assume the supply values for the sources are as follows:
S1: 50 units
S2: 70 units
S3: 80 units
And the demand values for the destinations are:
D1: 30 units
D2: 40 units
D3: 50 units
D4: 60 units
Using the Northwest Corner Method, we start allocating units from the top left corner (S1, D1) until either the supply or demand for that row or column is exhausted. Then we move to the next row or column and repeat the process.
After applying the NWCM, we get the following initial solution:
| Source/Destination | D1 | D2 | D3 | D4 | Supply |
|--------------------|----|----|----|----|--------|
| S1 | 30 | 20 | | | 50 |
| S2 | 10 | 20 | 40 | | 70 |
| S3 | | | 10 | 70 | 80 |
| Demand | 30 | 40 | 50 | 60 | |
Next, we can use the Least Cost Method to optimize the solution further. By calculating the costs for each cell and allocating units based on the least cost, we can arrive at an improved solution.
After applying the LCM, we get the following optimized solution:
| Source/Destination | D1 | D2 | D3 | D4 | Supply |
|--------------------|----|----|----|----|--------|
| S1 | 30 | 20 | | | 50 |
| S2 | | 20 | 40 | 10 | 70 |
| S3 | | 20 | 10 | 50 | 80 |
| Demand | 30 | 40 | 50 | 60 | |
To carry out a stepping stone method of post-optimality analysis, we need to identify the empty cells (non-basic variables) and calculate the improvement in cost for each potential move. By iterating through the empty cells and calculating the improvement in cost, we can determine the optimal solution.
By following the stepping stone method, we can continue to iterate and make improvements to the solution until we reach the optimum transportation plan.
1
