Microsoft Excel 16.

0 Answer Report
Worksheet: [Transhipment Example.xlsx]Sheet1
Report Created: 7/1/2020 10:52:57 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 11 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$I$16 TOTAL COST Chicago - 12,400.00

Variable Cells
Cell Name Original Value Final Value Integer
$B$6 Nebraska Kansas City 0 0 Contin
$C$6 Nebraska Omaha 0 0 Contin
$D$6 Nebraska Des Moines 0 300 Contin
$B$7 Colorado Kansas City 0 0 Contin
$C$7 Colorado Omaha 0 300 Contin
$D$7 Colorado Des Moines 0 0 Contin
$B$12 Kansas Chicago 0 0 Contin
$C$12 Kansas St. Loius 0 0 Contin
$D$12 Kansas Cicinnati 0 0 Contin
$B$13 Omaha Chicago 0 0 Contin
$C$13 Omaha St. Loius 0 0 Contin
$D$13 Omaha Cicinnati 0 300 Contin
$B$14 Des Moines Chicago 0 200 Contin
$C$14 Des Moines St. Loius 0 100 Contin
$D$14 Des Moines Cicinnati 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$B$15 Shipped In Chicago 200 $B$15=$B$16 Binding 0
$C$15 Shipped In St. Loius 100 $C$15=$C$16 Binding 0
$D$15 Shipped In Cicinnati 300 $D$15=$D$16 Binding 0
$B$19 Kansas Chicago 0 $B$19=0 Binding 0
$B$20 Omaha Chicago 0 $B$20=0 Binding 0
$B$21 Des Moines Chicago 0 $B$21=0 Binding 0
$E$6 Nebraska Shipped Out 300 $E$6=$F$6 Binding 0
$E$7 Colorado Shipped Out 300 $E$7=$F$7 Binding 0
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Transhipment Example.xlsx]Sheet1
Report Created: 7/1/2020 10:52:57 AM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$6 Nebraska Kansas City 0 5 16 1E+030 5
$C$6 Nebraska Omaha 0 0 10 3 1
$D$6 Nebraska Des Moines 300 0 12 1 3
$B$7 Colorado Kansas City 0 0 15 5 0
$C$7 Colorado Omaha 300 0 14 0 5
$D$7 Colorado Des Moines 0 1 17 1E+030 1
$B$12 Kansas Chicago 0 1 6 1E+030 1
$C$12 Kansas St. Loius 0 2 8 1E+030 2
$D$12 Kansas Cicinnati 0 0 10 1E+030 0
$B$13 Omaha Chicago 0 1 7 1E+030 1
$C$13 Omaha St. Loius 0 4 11 1E+030 4
$D$13 Omaha Cicinnati 300 0 11 0 1E+030
$B$14 Des Moines Chicago 200 0 4 1 1E+030
$C$14 Des Moines St. Loius 100 0 5 2 1E+030
$D$14 Des Moines Cicinnati 0 3 12 1E+030 3

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$B$15 Shipped In Chicago 200 0 200 0 1E+030
$C$15 Shipped In St. Loius 100 1 100 200 0
$D$15 Shipped In Cicinnati 300 5 300 200 0
$B$19 Kansas Chicago 0 -5 0 200 0
$B$20 Omaha Chicago 0 -6 0 200 0
$B$21 Des Moines Chicago 0 -4 0 200 0
$E$6 Nebraska Shipped Out 300 16 300 0 200
$E$7 Colorado Shipped Out 300 20 300 0 200
TRANSSHIPMENT EXAMPLE

Grain Elevators
Farms Kansas City Omaha Des Moines Shipped Out Supply
Nebraska 0 0 300 300 300
Colorado 0 300 0 300 300
Shipped In 0 300 300

Mills
Grain Elevators Chicago St. Loius Cicinnati Shipped out
Kansas 0 0 0 0
Omaha 0 0 300 300
Des Moines 200 100 0 300
Shipped In 200 100 300
Demand 200 100 300

Transshipment Flow
Kansas 0
Omaha 0
Des Moines 0
COST Grain Elevators
Farms Kansas City Omaha Des Moines
Nebraska 16 10 12
Colorado 15 14 17

Mills
Grain Elevators Chicago St. Loius Cicinnati
Kansas 6 8 10
Omaha 7 11 11
Des Moines 4 5 12

TOTAL COST 12,400.00

Decision Variables
Tons of Wheat to be transported from Nebraska (1) to Kansas City (3) =
Tons of Wheat to be transported from Nebraska (1) to Omaha (4) =
Tons of Wheat to be transported from Nebraska (1) to Des Moines (5) =
Tons of Wheat to be transported from Colorado (2) to Kansas City (3) =
Tons of Wheat to be transported from Colorado (2) to Omaha (4) =
Tons of Wheat to be transported from Colorado (2) to Des Moines (5) =
Tons of Wheat to be transported from Kansas City (3) to Chicago (6) =
Tons of Wheat to be transported from Kansas City (3) to St. Louis (7) =
Tons of Wheat to be transported from Kansas City (3) to Cicinnati (8) =
Tons of Wheat to be transported from Omaha (4) to Chicago (6) =
Tons of Wheat to be transported from Omaha (4) to St. Louis (7) =
Tons of Wheat to be transported from Omaha (4) to Cicinnati (8) =
Tons of Wheat to be transported from Des Moines (5) to Chicago (6) =
Tons of Wheat to be transported from Des Moines (5) to St. Louis (7) =
Tons of Wheat to be transported from Des Moines (5) to Cicinnati (8) =

Objective Function

Min Z = $16 x13 + 10 x14 + 12 x15 + 15 x23 + 14 x24 + 17 x25 + 6x36 + 8x37 + 10x38 + 7x46 + 11x47 + 11x48 + 4x56 + 5x57 +

Constraints
Supply Constraint from Nebraska:
Supply Constraint from Colorado:
Demand Constraint from Chicago:
Demand Constraint from St. Louis:
Demand Constraint from Cicinnati:
Transshipment constraint from Kansas City:
Transshipment constraint from Omaha:
Transshipment constraint from Des Moines:
Non-negativity constraint:

Conversion of constraints at non-standard to standard form:

Transshipment constraint from Kansas City:

Transshipment constraint from Omaha:
Transshipment constraint from Des Moines:
 x13
x14
x15
x23
x24
x25
x36
x37
x38
x46
x47
x48
x56
x57
x58

7x46 + 11x47 + 11x48 + 4x56 + 5x57 + 12x58

x13 + x14 + x15 = 300

x23 + x24 + x25 = 300
x36 + x46 + x56 = 200
x37 + x47 + x57 = 100
x38 + x48 + x58 = 300
x13 + x23 = x36 + x37 + x38
x14 + x24 = x46 + x47 + x48
x15 + x25 = x56 + x57 + x58
xij ≥ 0

x13 + x23 - x36 - x37 - x38 = 0

x14 + x24 - x46 - x47 - x48 = 0
x15 + x25 - x56 - x57 - x58 = 0
Microsoft Excel 16.0 Answer Report
Worksheet: [Transhipment Example.xlsx]Sheet5
Report Created: 7/1/2020 11:56:29 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 14 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$B$20 TOTAL DISTANCE Raleigh 0 450

Variable Cells
Cell Name Original Value Final Value Integer
$B$5 A Raleigh 0 0 Binary
$C$5 A Atlanta 0 1 Binary
$D$5 A Durham 0 0 Binary
$E$5 A Clemson 0 0 Binary
$B$6 B Raleigh 0 1 Binary
$C$6 B Atlanta 0 0 Binary
$D$6 B Durham 0 0 Binary
$E$6 B Clemson 0 0 Binary
$B$7 C Raleigh 0 0 Binary
$C$7 C Atlanta 0 0 Binary
$D$7 C Durham 0 1 Binary
$E$7 C Clemson 0 0 Binary
$B$8 D Raleigh 0 0 Binary
$C$8 D Atlanta 0 0 Binary
$D$8 D Durham 0 0 Binary
$E$8 D Clemson 0 1 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$B$9 Total Assigned Raleigh 1 $B$9=$B$10 Binding 0
$C$9 Total Assigned Atlanta 1 $C$9=$C$10 Binding 0
$D$9 Total Assigned Durham 1 $D$9=$D$10 Binding 0
$E$9 Total Assigned Clemson 1 $E$9=$E$10 Binding 0
$F$5 A Total Assigned 1 $F$5=$G$5 Binding 0
$F$6 B Total Assigned 1 $F$6=$G$6 Binding 0
$F$7 C Total Assigned 1 $F$7=$G$7 Binding 0
$F$8 D Total Assigned 1 $F$8=$G$8 Binding 0
$B$5:$E$8=Binary
ASSIGNMENT MODEL EXAMPLE

GAME SITES
OFFICIALS Raleigh Atlanta Durham Clemson Total Assigned Supply
A 0 1 0 0 1 1
B 1 0 0 0 1 1
C 0 0 1 0 1 1
D 0 0 0 1 1 1
Total Assigned 1 1 1 1
Demanded 1 1 1 1

GAME SITES
OFFICIALS Raleigh Atlanta Durham Clemson
A 210 90 180 160
B 100 70 130 200
C 175 105 140 170
D 85 65 105 120

TOTAL DISTANCE 450