ADM 2302 Lecture Notes - Lecture 1: Microsoft Excel, Intel X58, Time 100
3 May 2018
School
Department
Course
Professor
Microsoft Excel 14.0 Answer Report
Worksheet: [3. Transhipment_Problem.xls]Alternative Solution
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 17 Subproblems: 0
Solver Options
Max Time 100 sec, Iterations 100, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 5%, Solve Without Integer Constraints, Assume NonNegative
Objective Cell (Min)
Cell Name Original Value Final Value
$P$6 Cost of Transportation Total $275.00 $2,705.00
Variable Cells
Cell Name Original Value Final Value Integer
$B$4 Solution X14 050 Contin
$C$4 Solution X15 0 0 Contin
$D$4 Solution X24 045 Contin
$E$4 Solution X25 0 0 Contin
$F$4 Solution X34 0 0 Contin
$G$4 Solution X35 045 Contin
$H$4 Solution X46 0 5 Contin
$I$4 Solution X47 055 Contin
$J$4 Solution X48 035 Contin
$K$4 Solution X49 0 0 Contin
$L$4 Solution X56 020 Contin
$M$4 Solution X57 0 0 Contin
$N$4 Solution X58 0 0 Contin
$O$4 Solution X59 25 25 Contin
Constraints
Cell Name Cell Value Formula Status Slack
$P$12 Contractor 1 demand LHS 25 $P$12=$R$12 Binding 0
$P$13 Contractor 2 demand LHS 55 $P$13=$R$13 Binding 0
$P$14 Cantractor 3 demand LHS 35 $P$14=$R$14 Binding 0
$P$15 Cantractor 4 demand LHS 25 $P$15=$R$15 Binding 0
$P$16 Transhipment node 4 LHS 0 $P$16=$R$16 Binding 0
$P$17 Transipment node 5 LHS 0 $P$17=$R$17 Binding 0
$P$9 Capacity of plant 1 LHS 50 $P$9<=$R$9 Binding 0
$P$10 Capacity of plant 2 LHS 45 $P$10<=$R$10 Not Binding 10
$P$11 Capacity of plant 3 LHS 45 $P$11<=$R$11 Binding 0
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 5%, Solve Without Integer Constraints, Assume NonNegative
Microsoft Excel 14.0 Sensitivity Report
Worksheet: [3. Transhipment_Problem.xls]Alternative Solution
Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$4 Solution X14 50 0 9 0 1E+30
$C$4 Solution X15 0 0 11 1E+30 0
$D$4 Solution X24 45 011 2 2
$E$4 Solution X25 0 2 15 1E+30 2
$F$4 Solution X34 0 7 13 1E+30 7
$G$4 Solution X35 45 0 8 5 1E+30
$H$4 Solution X46 5 0 12 0 2
$I$4 Solution X47 55 010 41E+30
$J$4 Solution X48 35 0 9 2 1E+30
$K$4 Solution X49 0 0 13 1E+30 0
$L$4 Solution X56 20 010 2 0
$M$4 Solution X57 0 4 12 1E+30 4
$N$4 Solution X58 0 2 9 1E+30 2
$O$4 Solution X59 25 011 01E+30
Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$P$12 Contractor 1 demand LHS 25 23 25 10 5
$P$13 Contractor 2 demand LHS 55 21 55 10 45
$P$14 Cantractor 3 demand LHS 35 20 35 10 35
$P$15 Cantractor 4 demand LHS 25 24 25 10 5
$P$16 Transhipment node 4 LHS 0 -11 045 10
$P$17 Transipment node 5 LHS 0 -13 0 5 10
$P$9 Capacity of plant 1 LHS 50 -2 50 45 10
$P$10 Capacity of plant 2 LHS 45 055 1E+30 10
$P$11 Capacity of plant 3 LHS 45 -5 45 510
