# Answer in Operations Research for Andinet #283667

1. Given the following transportation problem:

D1 D2 D3 D4 SS

S1 5 10 7 10 50

S2 9 10 3 3 40

S3 6 4 2 2 60

DD 40 30 10 70

Where D1, D2, D3, and D4 are destinations and the values in the shaded cells are costs;

A. Determine the basic feasible solution through NWCM, LCM and VAM

B. Determine the optimal solution through Stepping Stone and MODI Method

A.

NWCM:

Step-1:

Select the upper left corner cell of the transportation matrix and allocate min(s1, d1).

Step-2:

a. Subtract this value from supply and demand of respective row and column.

b. If the supply is 0, then cross (strike) that row and move down to the next cell.

c. If the demand is 0, then cross (strike) that column and move right to the next cell.

d. If supply and demand both are 0, then cross (strike) both row & column and move diagonally to the next cell.

Step-3:Repeat this steps until all supply and demand values are 0.

The minimum total transportation cost = 5×40+10×10+10×20+3×10+3×10+2×60=680

LCM:

Step-1:Select the cell having minimum unit cost cij and allocate as much as possible, i.e. min(si,dj).Step-2:a. Subtract this min value from supply si and demand dj.

b. If the supply si is 0, then cross (strike) that row and If the demand dj is 0 then cross (strike) that column.

c. If min unit cost cell is not unique, then select the cell where maximum allocation can be possible

Step-3:Repeat this steps for all uncrossed (unstriked) rows and columns until all supply and demand values are 0.

The minimum total transportation cost = 5×40+10×10+10×20+3×10+3×10+2×60=680

VAM:

Step-1:Find the cells having smallest and next to smallest cost in each row and write the difference (called penalty) along the side of the table in row penalty.

Step-2:Find the cells having smallest and next to smallest cost in each column and write the difference (called penalty) along the side of the table in each column penalty.

Step-3:Select the row or column with the maximum penalty and find cell that has least cost in selected row or column. Allocate as much as possible in this cell.

If there is a tie in the values of penalties then select the cell where maximum allocation can be possible

Step-4:Adjust the supply & demand and cross out (strike out) the satisfied row or column.

Step-5:Repeat this steps until all supply and demand values are 0.

The minimum total transportation cost = 5×40+7×10+3×40+4×30+2×30=570

B.

Stepping Stone:

Step-1:

Find an initial basic feasible solution using any one of the three methods NWCM, LCM or VAM.

Step-2:

1. Draw a closed path (or loop) from an unoccupied cell. The right angle turn in this path is allowed only at occupied cells and at the original unoccupied cell. Mark (+) and (-) sign alternatively at each corner, starting from the original unoccupied cell.

2. Add the transportation costs of each cell traced in the closed path. This is called net cost change.

3. Repeat this for all other unoccupied cells.

Step-3:

1. If all the net cost change are ≥0, an optimal solution has been reached. Now stop this procedure.

2. If not then select the unoccupied cell having the highest negative net cost change and draw a closed path.Step-4:1. Select minimum allocated value among all negative position (-) on closed path

2. Assign this value to selected unoccupied cell (So unoccupied cell becomes occupied cell).

3. Add this value to the other occupied cells marked with (+) sign.

4. Subtract this value to the other occupied cells marked with (-) sign.

Step-5:

Repeat Step-2 to step-4 until optimal solution is obtained. This procedure stops when all net cost change ≥0 for unoccupied cells.

The minimum total transportation cost = 5×40+7×10+3×40+4×30+2×30=570

MODI:

Step-1:

Find an initial basic feasible solution using any one of the three methods NWCM, LCM or VAM.

Step-2:

Find ui and vj for rows and columns. To start

a. assign 0 to ui or vj where maximum number of allocation in a row or column respectively.

b. Calculate other ui‘s and vj‘s using cij=ui+vj, for all occupied cells.

Step-3:For all unoccupied cells, calculate dij=cij(ui+vj), .

Step-4:Check the sign of dij

a. If dij>0, then current basic feasible solution is optimal and stop this procedure.

b. If dij=0 then alternative solution exists, with different set allocation and same transportation cost. Now stop this procedure.

b. If dij<0, then the given solution is not an optimal solution and further improvement in the solution is possible.

Step-5:Select the unoccupied cell with the largest negative value of dij, and included in the next solution.

Step-6:Draw a closed path (or loop) from the unoccupied cell (selected in the previous step). The right angle turn in this path is allowed only at occupied cells and at the original unoccupied cell. Mark (+) and (-) sign alternatively at each corner, starting from the original unoccupied cell.

Step-7:

1. Select the minimum value from cells marked with (-) sign of the closed path.

2. Assign this value to selected unoccupied cell (So unoccupied cell becomes occupied cell).

3. Add this value to the other occupied cells marked with (+) sign.

4. Subtract this value to the other occupied cells marked with (-) sign.

Step-8:Repeat Step-2 to step-7 until optimal solution is obtained. This procedure stops when all dij≥0 for unoccupied cells.

The minimum total transportation cost = 5×40+7×10+3×40+4×30+2×30=570

Calculate the price
Pages (550 words)
\$0.00
*Price with a welcome 15% discount applied.
Pro tip: If you want to save more money and pay the lowest price, you need to set a more extended deadline.
We know how difficult it is to be a student these days. That's why our prices are one of the most affordable on the market, and there are no hidden fees.

Instead, we offer bonuses, discounts, and free services to make your experience outstanding.
How it works
Receive a 100% original paper that will pass Turnitin from a top essay writing service
step 1
Fill out the order form and provide paper details. You can even attach screenshots or add additional instructions later. If something is not clear or missing, the writer will contact you for clarification.
Pro service tips
How to get the most out of your experience with TheBestPaperWriters
One writer throughout the entire course
If you like the writer, you can hire them again. Just copy & paste their ID on the order form ("Preferred Writer's ID" field). This way, your vocabulary will be uniform, and the writer will be aware of your needs.
The same paper from different writers
You can order essay or any other work from two different writers to choose the best one or give another version to a friend. This can be done through the add-on "Same paper from another writer."
Copy of sources used by the writer
Our college essay writers work with ScienceDirect and other databases. They can send you articles or materials used in PDF or through screenshots. Just tick the "Copy of sources" field on the order form.
Testimonials
See why 20k+ students have chosen us as their sole writing assistance provider
Check out the latest reviews and opinions submitted by real customers worldwide and make an informed decision.
Job well done. Finish paper faster than expected. Thank you!
Customer 452451, October 3rd, 2022
Anthropology
Excellent services will definitely come back
Customer 452441, September 23rd, 2022
Excellent service - thank you!
Customer 452469, February 20th, 2023
English 101
Very good job. I actually got an A
Customer 452443, September 25th, 2022
Architecture, Building and Planning
The assignment was well written and the paper was delivered on time. I really enjoyed your services.
Customer 452441, September 23rd, 2022
Psychology
Thanks a lot the paper was excellent
Customer 452453, October 26th, 2022
Anthropology
excellent loved the services
Customer 452443, September 23rd, 2022
Thank you!
Customer 452451, November 27th, 2022
Nursing
The paper was EXCELLENT. Thank you
Customer 452449, September 23rd, 2022
Theology
Job well done and completed in a timely fashioned!
Customer 452451, November 18th, 2022
11,595
Customer reviews in total
96%
Current satisfaction rate
3 pages
Average paper length
37%
Customers referred by a friend