Name:

Directions: Submit your file $($pdf or word$)$ with your answers, you can insert portions of

your Excel file $($e$.$g$.,$ as a picture$)$ to supports your answers. Submit your solutions to Black$-$

board by midnight tonight.

Problem $1(5$ pts$)$: Minimum cost network flows

Background: The Rebel Alliance needs to transport supplies and information through a

network of planets and space stations while minimizing transportation costs and avoiding

detection by the Empire. The network consists of seven nodes as follows:

Node $1$: Yavin $4($Supply: $50$ units$)$

Node $2$: Hoth

Node $3$: Endor

Node $4$: Tatooine

Node $5$: Naboo

Node $6$: Coruscant

Node $7$: Alderaan $($Demand: $50$ units$)$

The goal is to determine the flow of resources that minimizes the total cost. The following

table shows the upper bounds on the flow $($in units$)$ and the costs $($in credits$)$ for each arc:

Please do the following:

Draw the network representation for this problem.

Formulate the model to solve this problem in algebraic form.

Solve the model and provide the solution in EXCEL!!!!