SSIGNMENT #$3$

NETWORK OPTIMIZATION PROBLEMS

ANSWER QUESTION S$1$ AND ANOTHER ONE OUT OF S$2$ AND S$3$

S$1$ Distribution at Akeju Manufacturing Ltd$.$

Akeju is a manufacturer of medical equipment. The company$$s primary product is a device used to monitor the heart during medical procedures. This device is produced in two factories and shipped to two warehouses. The product is then shipped on demand to four third$-$party wholesalers. All shipping is done by truck. The product distribution network is shown below. The annual production capacity at Factories $1$ and $2$ is $400$ and $250,$ respectively. The annual demand at Wholesalers $1,2,3,$ and $4$ is $200,100,150,$ and $200,$ respectively. The cost of shipping one unit in each shipping lane is shown on the arcs. Due to limited truck capacity, at most $250$ units can be shipped from Factory $1$ to Warehouse $1$ each year. Formulate and solve a network optimization model in a spreadsheet to determine how to distribute the product at the lowest possible annual cost.

What category of problem is this?

For each node, calculate the net flow as a function of the changing cells.

What is the goal?

Provide the Solver information and solved spreadsheet.

S$2$ Assessing the Capacity of a Pipeline Network

Kaushal & Hassan Inc. is an oil company that operates the pipeline network shown below, where each pipeline is labeled with its maximum flow rate in million cubic feet $($MMcf$)$ per day. A new oil well has been constructed near A$.$ They would like to transport oil from the well near A to their refinery at G$.$ Formulate and solve a network optimization model to determine the maximum flow rate from A to G$.$

What is the category of problem?

What is the goal?

Provide the Solver information and solved spreadsheet.

S$3$ Driving to the Mile$-$High City

Aesha and Jennifer have just graduated from college at the Cambrian College in Ontario and want to go on a road trip in the USA. They have always wanted to see the mile$-$high city of Denver. Their road atlas shows the driving time $($in hours$)$ between various city pairs, as shown below. Formulate and solve a network optimization model to find the quickest route from Seattle to Denver?

What Category of problem is this?

For each node, calculate the net flow as a function of the changing cells.

What is the goal of the problem?

Present the Solver information and solved spreadsheet.