Problem $3(25)$

Given: A highway network with each route length $($miles$)$ is illustrated in the figure below.

$($All arcs are two$-$way, distance shown is miles$)$

Find: The shortest path $($miles$)$ through the network for vehicles entering node $1$ and exiting

node $6.$

Formulate the following elements of a linear program using general mathematical expressions

for:

a$.$ Decision variables $(5),$

b$.$ Objective function $(5),$ and

c$.$ constraints $(5).$

Formulate the problem and solve using MS Excel Solver. Provide screen shots of your model

including decision variables, objective function, constraints, and solution. $(10)$