In$-$Class Assignment $-$ Transportation Algorithm

The table below provides information on the shipping of snow machines from warehouses in three cities to three National Parks in Alaska. Using the information, set up and show an initial solution using the North West Comer $($NWC$)$ method and using a dummy row or column if needed. After that, answer the questions that follow the table.

$\backslash$table$[[,$Denali,Glacier Bay,Yukon,Supply$],[$Fairbanks$,8,13,10,1000],[$Anchorage$,6,15,12,1600],[$Juneau$,14,5,11,750],[$Demand$,1200,800,1000,]]$

What is the initial solution table and the total cost of that solution?

a$.$ Lecture Notes pgs$.4$ & $6,$ Example Problem pgs$.2$ & $5$

What does the dummy column tell you?

a$.$ Lecture Notes pg$.6,$ Example Problem pg$.5$

Which routes $($list all of them$)$ would be search directions for the algorithm?

a$.$ Lecture Notes pg$.7,$ Example Problem pg$.5$

Calculate the net change in cost for each search direction.

a$.$ Lecture Notes pgs$.8$ & $9,$ Example Problem $-$

Is the current solution optimal $($lowest total cost$)?$ Give a general rule for how you know?

a$.$ Lecture Notes $-,$ Example Problem pg$.6$

Which route would you use to generate the next solution?

a$.$ Lecture Notes pg$.10,$ Example Problem pg$.6$

How many units would you ship on that route?

a$.$ Lecture Notes pg$.11,$ Example Problem $-$

When will you know you have found the optimal solution?

a$.$ Lecture Notes pg$.11,$ Example Problem pg$.6$

In$-$Class Assignment $-$ Transportation Algorithm

The table below provides information on the shipping of snow machines from warehouses in three cities to three National Parks in Alaska. Using the information, set up and show an initial solution using the North West Comer $($NWC$)$ method and using a dummy row or column if needed. After that, answer the questions that follow the table.

$\backslash$table$[[,$Denali,Glacier Bay,Yukon,Supply$],[$Fairbanks$,8,13,10,1000],[$Anchorage$,6,15,12,1600],[$Juneau$,14,5,11,750],[$Demand$,1200,800,1000,]]$

What is the initial solution table and the total cost of that solution?

a$.$ Lecture Notes pgs$.4$ & $6,$ Example Problem pgs$.2$ & $5$

What does the dummy column tell you?

a$.$ Lecture Notes pg$.6,$ Example Problem pg$.5$

Which routes $($list all of them$)$ would be search directions for the algorithm?

a$.$ Lecture Notes pg$.7,$ Example Problem pg$.5$

Calculate the net change in cost for each search direction.

a$.$ Lecture Notes pgs$.8$ & $9,$ Example Problem $-$

Is the current solution optimal $($lowest total cost$)?$ Give a general rule for how you know?

a$.$ Lecture Notes $-,$ Example Problem pg$.6$

Which route would you use to generate the next solution?

a$.$ Lecture Notes pg$.10,$ Example Problem pg$.6$

How many units would you ship on that route?

a$.$ Lecture Notes pg$.11,$ Example Problem $-$

When will you know you have found the optimal solution?

a$.$ Lecture Notes pg$.11,$ Example Problem pg$.6$