A company needs to ship 100 units from Seattle to Denver at the lowest possible cost. The costs associated with shipping between the cities are:
|
|
To
|
|
From
|
Portland
|
Spokane
|
Salt Lake City
|
Denver
|
|
Seattle
|
100
|
500
|
600
|
-
|
|
Portland
|
-
|
350
|
300
|
-
|
|
Spokane
|
-
|
-
|
250
|
200
|
|
Salt Lake City
|
-
|
-
|
-
|
200
|
a) Use the following nodes to complete the diagram for this problem: Node 1: Seattle, Node 2: Portland, Node 3: Spokane, Node 4: Salt Lake City, and Node 5: Denver.
b) Word-process the linear programming model below. Note: This is a shortest route problem. It can be formulated assuming one unit or 100 units.
Variables
Xij = Flow from City i to City j,
wherei = 1, 2, 3, 4 and j = 2, 3, 4, 5
Objective Function
Constraints
c) Set up the spreadsheet for Excel Solver. Copy and paste the spreadsheet below.
d) Copy and paste the Answer report below.
e) Write the Optimal Solution below. Include the optimal shortest route and the value of the objective function.