Instructions

Sect.
1
Inv
Inv_2
3
FixedIP
FixedNet
4
LocIP
LocNet
LocTran
5
Cover
6
TSP
TSP_Trans
MST
SPT
SPT_Net
7
Cutting
8
Non_Lin_Coef
Non_Lin

Page 1
 Instructions

Chapter 7
Operations Research Models and Methods
Paul A. Jensen and Jonathan F. Bard
Integer Programming Models
http://www.me.utexas.edu/~jensen/ORMM/computation/unit/mp_add/index.html

Instructions
To use this workbook, you must first load the Math Programming add-ins. See the Excel help file topic
"About add-ins" before continuing.

For cases using the LP/IP Solver you must first load the Math Programming and the LP/IP Solver add-ins.
This workbook comes without control buttons. To make the buttons choose the Add Buttons commands
from both the Math Programming add-in. This adds buttons to all the worksheets.

Integer Programming Models

Site Selection Example
Site Selection Example with a single constraint
Site Selection with additional restrictions
System Design with Fixed Charges
Fixed Charge Integer Programming Model
Fixed Charge Network Flow Programming Model with Integer Arc Flows
Facility Location Problem
Location example with IP model
Location example with network flow model
Location example with transportation model
Covering and Partitioning Problems
Covering Problem/Partitioning Problem
Distance Problems
Traveling salesman problem as an IP
Traveling salesman problem as a transportation problem with side constraints
Directed minimal spanning tree problem
Shortest path tree problem as a LP
Shortest path tree problem as a network
Examples
Pattern Selection - The Cutting Stock Problem
Nonlinear Objective Function
Developments of coefficients for the piecewise linear problem
Piecewise linear problem used as an example for the section

Page 2
 Instructions

Add-ins used
Math Programming - Linear/Excel Solver
Math Programming - Linear/Excel Solver

Math Programming - Linear/Excel Solver

Math Programming - Network/Excel Solver

Math Programming - Linear/Excel Solver

Math Programming - Network/Excel Solver
Math Programming - Transportation/Excel Solver

Math Programming - Linear/Excel Solver

Math Programming - Linear/Excel Solver

Math Programming - Transportation/Excel Solver
Math Programming - Linear/Excel Solver
Math Programming - Linear/Excel Solver
Math Programming - Network/Excel Solver

Math Programming - Linear/Excel Solver

None
Math Programming - Linear/Excel Solver

Page 3
Linear Model Name: Inv Solver: Jensen LP/IP Tree Nodes
1 Type: LP1 Type: Linear-Integer Simplex Iter.
0 Change Goal: Max Sens.: No Comp. Time
1 Objective: 40 Side: No
1 Solve
1 Variables I-1 I-2 I-3 I-4 I-5 I-6
100 Vary Name: A1 A2 A3 A4 B1 B2
100 Values: 1 0 1 0 0 0
0 Lower Bounds:
Change Relation 0 0 0 0 0 0
60 Upper Bounds: 1 1 1 1 1 1

Linear Obj. Coef.: 6 7 9 11 12 15

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 Budget 99 <= 100 13 20 24 30 39 45
 Tree Nodes 70
Simplex Iter. 139
Comp. Time 00:03
Status Optimal IP

I-7 I-8 I-9 I-10 I-11 I-12

B3 B4 C1 C2 C3 C4
1 1 1 0 0 0
0 0 0 0 0 0
1 1 1 1 1 1

5 8 12 16 19 20

12 20 30 44 48 55
Algorithmic Details for problem Inv. Objective value: 40
Jensen LP Solution Algorithm Solution Var 1 Var 2
Start Solution 1 0
Add Artificial and Slack Variables
Slack Variable: 13 added for constraint 1.
Start Phase 2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
1 12 0 -20 1
2 11 13 -19 0.9375
3 -12 11 -1.770833 0.0545455
4 1 0 -1.272727 1
5 9 0 -1.090909 1
6 8 12 -0.727273 0.45
7 7 8 -0.2 0.75
8 -11 7 -1 0.0625
9 8 0 -0.083333 1
Node 0 Optimal: z = 40.8958333333333
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
10 -9 14 -0.625 0.7666667
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 1 Optimal: z = 40.7999996185303
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
11 12 14 -1.833333 0.1272727
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
12 3 12 -0.272727 0.2916666
Node 2 Optimal: z = 40.6249996758997
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
13 12 14 -2.291667 0.1272727
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
14 4 12 -0.090909 0.2333333
Node 3 Optimal: z = 40.5666663169861
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
15 12 14 -1.833333 0.1272727
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 4 Optimal: z = 40.5454542311755
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
16 6 14 -0.818182 0.1555555
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
17 10 6 -1.333333 0.1590909
Node 5 Optimal: z = 40.5454542040825
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
18 6 14 -1.022727 0.1555555
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
19 2 6 -0.333333 0.35
Node 6 Optimal: z = 40.4499997287989
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
20 6 14 -2.25 0.1555555
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 7 Optimal: z = 40.3333330949148
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
21 5 14 -0.866667 0.1794872
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 8 Optimal: z = 40.1538460254669
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
22 13 14 -0.025641 6.9999996
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 9 Optimal: z = 38
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
23 -8 0 -20 1
24 -1 14 -13 0.9230769
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
25 -7 0 -0.538462 1
Node 10 Optimal: z = 37
Add Artificial and Slack Variables
 Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
26 -5 0 -39 1
27 -1 14 -13 0.4615385
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 11 Optimal: z = 37.2307692307692
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
28 -6 14 -45 0.4444444
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
29 1 0 -1.666667 0.4615385
30 8 6 -1.333333 0.95
31 7 0 -0.2 1
Node 12 Optimal: z = 39.8
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
32 6 15 -2.25 0.1555556
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 13 Optimal: z = 39.3333332935969
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
33 5 15 -0.866667 0.1794872
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 14 Optimal: z = 39.1538460254669
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
34 13 15 -0.025641 6.9999996
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 15 Optimal: z = 37
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
35 -1 0 -13 1
36 -7 0 -12 1
Node 16 Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
37 -5 0 -39 1
Node 17 Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
38 -6 14 -45 0.7333333
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
39 1 6 -1.666667 0.9230769
Node 18 Optimal: z = 39.5384615384615
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 19 Infeasible
Add Artificial and Slack Variables
Slack Variable: 13 added for constraint 1.
Start Phase 2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
40 6 13 -15 0.2666667
41 7 0 -1 1
Node 20 Optimal: z = 39
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
42 -2 0 -20 1
43 -8 0 -20 1
44 -7 14 -12 0.3333333
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
45 1 7 -0.583333 0.6153846
Node 21 Optimal: z = 38.6923076923077
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
46 -10 0 -44 1
47 -1 0 -13 0.6153846
Node 22 Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
48 -12 14 -55 0.6
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
49 1 0 -1.272727 1
50 8 12 -0.727273 0.45
51 7 8 -0.2 0.75
Node 23 Optimal: z = 39.75
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
52 -4 14 -30 0.8
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
53 8 4 -0.666667 0.3
54 7 0 -0.2 0.25
Node 24 Optimal: z = 40.2
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
55 12 15 -2.75 0.0545455
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
56 4 12 -0.090909 0.1
Node 25 Optimal: z = 40.1000000437101
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
57 12 15 -1.833333 0.0545455
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 26 Optimal: z = 40.0909091071649
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
58 6 15 -0.818182 0.0666667
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
59 10 6 -1.333333 0.0681818
Node 27 Optimal: z = 40.0909090936184
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
 60 6 15 -1.022727 0.0666667
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
61 2 6 -0.333333 0.15
Node 28 Optimal: z = 40.0500000312924
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
62 6 15 -2.25 0.0666667
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 29 Optimal: z = 40.0000000397364
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
63 5 15 -0.866667 0.0769231
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 30 Optimal: z = 39.9230769712191
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
64 -5 0 -39 0.0769231
65 -1 0 -13 1
66 -7 0 -12 1
Node 31 Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
67 -6 14 -45 0.8222222
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
68 1 6 -1.666667 0.6153846
Node 32 Optimal: z = 38.6923076923077
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
69 -2 0 -20 1
70 -1 0 -13 0.6153846
Node 33 Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
71 -10 0 -44 1
Node 34 Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
72 -12 0 -55 1
Node 35 Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
73 -4 14 -30 0.7333333
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
74 1 4 -1.233333 0.6153846
Node 36 Optimal: z = 39.6923076923077
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
75 -3 0 -24 1
76 -8 14 -20 0.3
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
77 1 0 -0.8 0.3846154
78 7 8 -0.2 0.75
Node 37 Optimal: z = 40.75
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
79 -1 15 -1.083333 0.2307692
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 38 Optimal: z = 40.6153846153846
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 39 Infeasible
Add Artificial and Slack Variables
Slack Variable: 13 added for constraint 1.
Start Phase 2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
80 12 13 -20 0.1818182
 81 8 12 -0.727273 0.5
Node 40 Optimal: z = 40
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 41 Infeasible
Add Artificial and Slack Variables
Slack Variable: 13 added for constraint 1.
Start Phase 2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
82 12 13 -20 0.1818182
83 3 12 -0.272727 0.4166667
Node 42 Optimal: z = 39.75
Add Artificial and Slack Variables
Slack Variable: 13 added for constraint 1.
Start Phase 2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
84 12 13 -20 0.2181818
85 1 12 -1.272727 0.9230769
86 -3 1 -2.076923 0.0416667
87 8 3 -0.5 0.45
Node 43 Optimal: z = 40.6
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
88 12 14 -2.75 0.1636364
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
89 3 12 -0.272727 0.375
Node 44 Optimal: z = 40.374999910593
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
90 12 14 -2.291667 0.1636364
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
91 4 12 -0.090909 0.3
Node 45 Optimal: z = 40.3
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
92 12 14 -1.833333 0.1636364
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 46 Optimal: z = 40.2727274027738
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
93 6 14 -0.818182 0.2
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
94 10 6 -1.333333 0.2045455
Node 47 Optimal: z = 40.2727274298668
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
95 6 14 -1.022727 0.2
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
96 2 6 -0.333333 0.45
Node 48 Optimal: z = 40.1500002086163
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
97 6 14 -2.25 0.2
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 49 Optimal: z = 40.0000001192093
Branch and Bound artificial added
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
98 5 14 -0.866667 0.2307692
Start Phase2
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Node 50 Optimal: z = 39.7692308104955
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
99 -5 0 -39 0.2307692
100 -1 0 -13 1
Node 51 Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter. Enters Leaves Red. Cost Var. Chg
Var 3 Var 4 Var 5 Var 6 Var 7 Var 8 Var 9 Var 10 Var 11
1 0 0 0 1 1 1 0 0

Node Level Variable Value Up/Down Visit Relax

0 0 0 0 0 0 40.8958 Branch X(11) up at 1
1 1 11 1 1 1 40.8 Branch X(9) down at 0
2 2 9 0 -1 1 40.625 Branch X(3) down at 0
3 3 3 0 -1 1 40.5667 Branch X(4) down at 0
4 4 4 0 -1 1 40.5455 Branch X(12) down at 0
5 5 12 0 -1 1 40.5455 Branch X(10) down at 0
6 6 10 0 -1 1 40.45 Branch X(2) down at 0
7 7 2 0 -1 1 40.3333 Branch X(6) down at 0
8 8 6 0 -1 1 40.1538 Branch X(5) down at 0
9 9 5 0 -1 1 38 Integer: Replace incumbent: Backtrack
10 9 5 1 1 2 37 Fathom: Backtrack Level 9 8 : Branch X(
11 8 6 1 1 2 37.2308 Fathom: Backtrack Level 8 7 : Branch X(
12 7 2 1 1 2 39.8 Branch X(8) down at 0
13 8 8 0 -1 1 39.3333 Branch X(6) down at 0
14 9 6 0 -1 1 39.1538 Branch X(5) down at 0
15 10 5 0 -1 1 37 Fathom: Backtrack Level 10 : Branch X(5
16 10 5 1 1 2 Infeasible Infeasible: Backtrack Level 10 9 : Branch
17 9 6 1 1 2 Infeasible Infeasible: Backtrack Level 9 8 : Branch
18 8 8 1 1 2 39.5385 Branch X(1) up at 1
19 9 1 1 1 1 Infeasible Infeasible: Backtrack Level 9 : Branch X(
20 9 1 0 -1 2 39 Integer: Replace incumbent: Backtrack
21 6 10 1 1 2 38.6923 Fathom: Backtrack Level 6 5 : Branch X(
22 5 12 1 1 2 Infeasible Infeasible: Backtrack Level 5 4 : Branch
23 4 4 1 1 2 39.75 Fathom: Backtrack Level 4 3 : Branch X(
24 3 3 1 1 2 40.2 Branch X(8) down at 0
25 4 8 0 -1 1 40.1 Branch X(4) down at 0
26 5 4 0 -1 1 40.0909 Branch X(12) down at 0
27 6 12 0 -1 1 40.0909 Branch X(10) down at 0
28 7 10 0 -1 1 40.05 Branch X(2) down at 0
29 8 2 0 -1 1 40 Branch X(6) down at 0
30 9 6 0 -1 1 39.9231 Fathom: Backtrack Level 9 : Branch X(6)
31 9 6 1 1 2 Infeasible Infeasible: Backtrack Level 9 8 : Branch
32 8 2 1 1 2 38.6923 Fathom: Backtrack Level 8 7 : Branch X(
33 7 10 1 1 2 Infeasible Infeasible: Backtrack Level 7 6 : Branch
34 6 12 1 1 2 Infeasible Infeasible: Backtrack Level 6 5 : Branch
35 5 4 1 1 2 Infeasible Infeasible: Backtrack Level 5 4 : Branch
36 4 8 1 1 2 39.6923 Fathom: Backtrack Level 4 3 2 : Branch
37 2 9 1 1 2 40.75 Branch X(7) up at 1
38 3 7 1 1 1 40.6154 Branch X(1) up at 1
39 4 1 1 1 1 Infeasible Infeasible: Backtrack Level 4 : Branch X(
40 4 1 0 -1 2 40 Branch X(8) up at 1
41 5 8 1 1 1 Infeasible Infeasible: Backtrack Level 5 : Branch X(
42 5 8 0 -1 2 39.75 Fathom: Backtrack Level 5 4 3 : Branch
43 3 7 0 -1 2 40.6 Branch X(8) down at 0
44 4 8 0 -1 1 40.375 Branch X(3) down at 0
45 5 3 0 -1 1 40.3 Branch X(4) down at 0
46 6 4 0 -1 1 40.2727 Branch X(12) down at 0
47 7 12 0 -1 1 40.2727 Branch X(10) down at 0
48 8 10 0 -1 1 40.15 Branch X(2) down at 0
49 9 2 0 -1 1 40 Branch X(6) down at 0
50 10 6 0 -1 1 39.7692 Fathom: Backtrack Level 10 : Branch X(6
51 10 6 1 1 2 Infeasible Infeasible: Backtrack Level 10 9 : Branch
52 9 2 1 1 2 38.9231 Fathom: Backtrack Level 9 8 : Branch X(
53 8 10 1 1 2 Infeasible Infeasible: Backtrack Level 8 7 : Branch
54 7 12 1 1 2 Infeasible Infeasible: Backtrack Level 7 6 : Branch
55 6 4 1 1 2 Infeasible Infeasible: Backtrack Level 6 5 : Branch
56 5 3 1 1 2 Infeasible Infeasible: Backtrack Level 5 4 : Branch
57 4 8 1 1 2 39.9231 Fathom: Backtrack Level 4 3 2 1 : Branc
58 1 11 0 -1 2 40.3667 Branch X(4) down at 0
59 2 4 0 -1 1 40.3636 Branch X(12) down at 0
60 3 12 0 -1 1 40.3636 Branch X(10) down at 0
61 4 10 0 -1 1 40.35 Branch X(2) down at 0
62 5 2 0 -1 1 40.3333 Branch X(6) down at 0
63 6 6 0 -1 1 40.3077 Branch X(5) down at 0
64 7 5 0 -1 1 40 Integer: Replace incumbent: Backtrack
65 7 5 1 1 2 37.4 Fathom: Backtrack Level 7 6 : Branch X(
66 6 6 1 1 2 38 Fathom: Backtrack Level 6 5 : Branch X(
67 5 2 1 1 2 39.875 Fathom: Backtrack Level 5 4 : Branch X(
68 4 10 1 1 2 39.4 Fathom: Backtrack Level 4 3 : Branch X(
69 3 12 1 1 2 39 Fathom: Backtrack Level 3 2 : Branch X(
70 2 4 1 1 2 40 Fathom: Backtrack Level 2 1 0 :Finished
 Var 12
0

down at 0
down at 0

ace incumbent: Backtrack Level 9 : Branch X(5) up at 1

ktrack Level 9 8 : Branch X(6) up at 1
ktrack Level 8 7 : Branch X(2) up at 1

ktrack Level 10 : Branch X(5) up at 1

acktrack Level 10 9 : Branch X(6) up at 1
acktrack Level 9 8 : Branch X(8) up at 1

acktrack Level 9 : Branch X(1) down at 0

ace incumbent: Backtrack Level 9 8 7 6 : Branch X(10) up at 1
ktrack Level 6 5 : Branch X(12) up at 1
acktrack Level 5 4 : Branch X(4) up at 1
ktrack Level 4 3 : Branch X(3) up at 1

down at 0
down at 0

ktrack Level 9 : Branch X(6) up at 1

acktrack Level 9 8 : Branch X(2) up at 1
ktrack Level 8 7 : Branch X(10) up at 1
acktrack Level 7 6 : Branch X(12) up at 1
acktrack Level 6 5 : Branch X(4) up at 1
acktrack Level 5 4 : Branch X(8) up at 1
ktrack Level 4 3 2 : Branch X(9) up at 1

acktrack Level 4 : Branch X(1) down at 0

acktrack Level 5 : Branch X(8) down at 0

ktrack Level 5 4 3 : Branch X(7) down at 0

down at 0
down at 0

ktrack Level 10 : Branch X(6) up at 1

acktrack Level 10 9 : Branch X(2) up at 1
ktrack Level 9 8 : Branch X(10) up at 1
acktrack Level 8 7 : Branch X(12) up at 1
acktrack Level 7 6 : Branch X(4) up at 1
acktrack Level 6 5 : Branch X(3) up at 1
acktrack Level 5 4 : Branch X(8) up at 1
ktrack Level 4 3 2 1 : Branch X(11) down at 0

down at 0
down at 0

ace incumbent: Backtrack Level 7 : Branch X(5) up at 1

ktrack Level 7 6 : Branch X(6) up at 1
ktrack Level 6 5 : Branch X(2) up at 1
ktrack Level 5 4 : Branch X(10) up at 1
ktrack Level 4 3 : Branch X(12) up at 1
ktrack Level 3 2 : Branch X(4) up at 1
ktrack Level 2 1 0 :Finished
Linear Model Name: Inv_2 Solver: Excel Solver
37 Type: LP1 Type: Linear-Integer
15 Change Goal: Max Sens.: No Comp. Time
1 Objective: 37 Side: No
1 Solve
1 Variables I-1 I-2 I-3 I-4 I-5 I-6
0 Vary Name: A1 A2 A3 A4 B1 B2
1 Values: 1 -7E-12 0 1 0 1
1 Lower Bounds:
Change Relation 0 0 0 0 0 0
100 Upper Bounds: 1 1 1 1 1 1

Linear Obj. Coef.: 6 7 9 11 12 15

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 Budget 100 <= 100 13 20 24 30 39 45
2 Site 1 1 <= 1 1 0 0 0 1 0
3 Site 2 1 = 1 0 1 0 0 0 1
4 Site 3 1 <= 1 0 0 1 0 0 0
5 Site 4 1 <= 1 0 0 0 1 0 0
6 Design A -2 <= 0 1 1 1 -3 0 0
7 Des. Lim. 2 <= 2 0 0 0 0 0 0
8 Des. A -2 <= 0 1 1 1 1 0 0
9 Des. B -2 <= 0 0 0 0 0 1 1
10 Des. C 0 <= 0 0 0 0 0 0 0
Comp. Time 00:09
Status Optimal

I-7 I-8 I-9 I-10 I-11 I-12 I-13 I-14 I-15

B3 B4 C1 C2 C3 C4 WA WB WC
1 0 0 0 0 0 1 1 0
0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1

5 8 12 16 19 20 0 0 0

12 20 30 44 48 55 0 0 0
0 0 1 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0
1 0 0 0 1 0 0 0 0
0 1 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 1 1 1
0 0 0 0 0 0 -4 0 0
1 1 0 0 0 0 0 -4 0
0 0 1 1 1 1 0 0 -4
Linear Model Name: FixedIP Solver: Excel Solver
139 Type: LP1 Type: Linear-Integer
22 Change Goal: Min Sens.: No Comp. Time
1 Objective: 139 Side: No
1 Solve
1 Variables I-1 I-2 I-3 I-4 I-5 6
1 Vary Name: y1 y2 y3 y4 y5 x1
1 Values: 1 -2E-17 1 1 0 10
100 Lower Bounds:
Change Relation 0 0 0 0 0 0
Upper Bounds: 1 1 1 1 1 10

Linear Obj. Coef.: 8 6 9 7 7 2

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 N1 14 = 14 0 0 0 0 0 1
2 N2 -4 = -4 0 0 0 0 0 0
3 N3 7 = 7 0 0 0 0 0 0
4 N4 -6 = -6 0 0 0 0 0 -1
5 N5 -9 = -9 0 0 0 0 0 0
6 N6 0 = 0 0 0 0 0 0 0
7 N7 3 = 3 0 0 0 0 0 0
8 N8 -5 = -5 0 0 0 0 0 0
9 I1 0 <= 0 -10 0 0 0 0 1
10 I2 2E-16 <= 0 0 -10 0 0 0 0
11 I3 -3 <= 0 0 0 -10 0 0 0
12 I4 -5 <= 0 0 0 0 -10 0 0
13 I5 0 <= 0 0 0 0 0 -10 0
Comp. Time 00:04
Status Optimal

7 8 9 10 11 12 13 14 15 16 17 18
x2 x3 x4 x5 x6 x7 x8 x9 x10 x11 x12 x13
0 7 5 0 4 4 0 0 2E-16 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
10 10 10 10 12 5 5 12 10 10 4 6

4 1 2 2 10 9 9 8 5 5 5 9

0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 -1 0 0 1 1 -1 0 0
0 1 0 0 0 0 0 0 -1 1 0 1
1 0 0 0 0 1 -1 0 0 0 0 0
0 0 -1 1 0 -1 1 0 0 0 -1 0
-1 0 0 0 0 0 0 -1 0 0 1 -1
0 0 1 -1 0 0 0 0 0 0 0 0
0 -1 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0 0 0
19 20 21 22
x14 x15 x16 x17
0 2 0 0
0 0 0 0
5 3 3 7

7 1 1 5

0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
1 0 0 1
0 -1 1 -1
-1 1 -1 0
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
Network Model Name:FixedNet Solver: Excel Solver
139 Type: Net Type: Linear-Integer
22 Change Goal: Min Sens.: No
1 Objective: 139 Side: Yes
1 Solve
1
1 Vary
100 Vary
Arc Data and Flows
Num. Name Flow Origin Term. Lower Upper Cost Gain Flow_O
I-1 y1 1 0 0 0 1 8 1 1
I-2 y2 0 0 0 0 1 6 1 0
I-3 y3 1 0 0 0 1 9 1 1
I-4 y4 1 0 0 0 1 7 1 1
I-5 y5 0 0 0 0 1 7 1 0
6 x1 10 1 4 0 10 2 1 10
7 x2 0 4 6 0 10 4 1 0
8 x3 7 3 8 0 10 1 1 7
9 x4 5 7 5 0 10 2 1 5
10 x5 0 5 7 0 10 2 1 0
11 x6 4 1 2 0 12 10 1 4
12 x7 4 4 5 0 5 9 1 4
13 x8 0 5 4 0 5 9 1 0
14 x9 0 2 6 0 12 8 1 0
15 x10 2E-11 2 3 0 10 5 1 2E-11
16 x11 0 3 2 0 10 5 1 0
17 x12 0 6 5 0 4 5 1 0
18 x13 0 3 6 0 6 9 1 0
19 x14 0 6 8 0 5 7 1 0
20 x15 2 8 7 0 3 1 1 2
21 x16 0 7 8 0 3 1 1 0
22 x17 0 6 7 0 5 7 1 0
 Side Node Data and Balance Constraints
Flow_O Const. Num. Name Fixed Balance
1 N1 14 0
2 N2 -4 0
3 N3 7 0
4 N4 -6 0
5 N5 -9 0
-2E-11 6 N6 0 0
0 7 N7 3 0
-3 8 N8 -5 0
-5
0
Linear Model Name: LocIP Solver: Excel Solver
9880 Type: LP1 Type: Linear-Integer
35 Change Goal: Min Sens.: No Comp. Time
1 Objective: 9880 Side: No
1 Solve
1 Variables I-1 I-2 I-3 I-4 I-5 6
1 Vary Name: y1 y2 y3 y4 y5 z1
1 Values: 1 0 1 1 -3E-17 75
100 Lower Bounds:
Change Relation 0 0 0 0 0 0
Upper Bounds: 1 1 1 1 1 80

Linear Obj. Coef.: 1000 1500 1700 1400 1200 20

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 Dem1 30 = 30 0 0 0 0 0 0
2 Dem2 40 = 40 0 0 0 0 0 0
3 Dem3 50 = 50 0 0 0 0 0 0
4 Dem4 35 = 35 0 0 0 0 0 0
5 Dem5 40 = 40 0 0 0 0 0 0
6 Sup1 0 <= 0 0 0 0 0 0 -1
7 Sup2 0 <= 0 0 0 0 0 0 0
8 Sup3 0 <= 0 0 0 0 0 0 0
9 Sup4 0 <= 0 0 0 0 0 0 0
10 Sup5 0 <= 0 0 0 0 0 0 0
11 Ware1 -5 <= 0 -80 0 0 0 0 1
12 Ware2 0 <= 0 0 -80 0 0 0 0
13 Ware3 0 <= 0 0 0 -80 0 0 0
14 Ware4 -40 <= 0 0 0 0 -80 0 0
15 Ware5 2E-15 <= 0 0 0 0 0 -80 0
Comp. Time 00:09
Status Optimal

7 8 9 10 11 12 13 14 15 16 17 18
z2 z3 z4 z5 x11 x12 x13 x14 x15 x21 x22 x23
0 80 40 0 30 40 0 5 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
80 80 80 80 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10

17 13 25 33 8 21 42 12 37 21 10 31

0 0 0 0 1 0 0 0 0 1 0 0
0 0 0 0 0 1 0 0 0 0 1 0
0 0 0 0 0 0 1 0 0 0 0 1
0 0 0 0 0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0
0 0 0 0 1 1 1 1 1 0 0 0
-1 0 0 0 0 0 0 0 0 1 1 1
0 -1 0 0 0 0 0 0 0 0 0 0
0 0 -1 0 0 0 0 0 0 0 0 0
0 0 0 -1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0 0 0
 19 20 21 23 22
24 25 26 27 28 29 30
x24 x25 x31 x33 x32
x34 x35 x41 x42 x43 x44 x45
0 0 0 0 50 30 0 0 0 0 0 40
0 0 0 0 0 0 0 0 0 0 0 0
1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10

24 40 42 31 4 14 32 12 24 14 7 12

0 0 1 0 0 0 0 1 0 0 0 0
0 0 0 1 0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0 0 1 0 0
1 0 0 0 0 1 0 0 0 0 1 0
0 1 0 0 0 0 1 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0
1 1 0 0 0 0 0 0 0 0 0 0
0 0 1 1 1 1 1 0 0 0 0 0
0 0 0 0 0 0 0 1 1 1 1 1
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
 31 32 33 34 35
x51 x52 x53 x54 x55
0 0 0 0 0
0 0 0 0 0
1E+10 1E+10 1E+10 1E+10 1E+10

37 40 32 12 10

1 0 0 0 0
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0
0 0 0 0 1
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
1 1 1 1 1
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
Network Model Name: LocNet Solver: Excel Solver
9880 Type: Net Type: Linear-Integer
35 Change Goal: Min Sens.: No
1 Objective: 9880 Side: Yes
1 Solve
0
1 Vary
100 Vary
Arc Data and Flows Node Data and Balance Constr
Num. Name Flow Origin Term. Upper Cost Num. Name
I-1 y1 1 0 0 1 1000 1 S1
I-2 y2 0 0 0 1 1500 2 S2
I-3 y3 1 0 0 1 1700 3 S3
I-4 y4 1 0 0 1 1400 4 S4
I-5 y5 1E-16 0 0 1 1200 5 S5
6 z1 70 0 1 80 20 6 D1
7 z2 3E-11 0 2 80 17 7 D2
8 z3 80 0 3 80 13 8 D3
9 z4 45 0 4 80 25 9 D4
10 z5 8E-15 0 5 80 33 10 D5
11 x11 30 1 6 1E+10 8
12 x12 40 1 7 1E+10 21 Side Constraints
13 x13 0 1 8 1E+10 42 zk-uk*yk<0
14 x14 0 1 9 1E+10 12 -10
15 x15 0 1 10 1E+10 37 3E-11
16 x21 0 2 6 1E+10 21 -2E-10
17 x22 3E-11 2 7 1E+10 10 -35
18 x23 0 2 8 1E+10 31 -2E-15
19 x24 0 2 9 1E+10 24
20 x25 0 2 10 1E+10 40
21 x31 0 3 6 1E+10 42
22 x32 0 3 7 1E+10 31
23 x33 50 3 8 1E+10 4
24 x34 30 3 9 1E+10 14
25 x35 0 3 10 1E+10 32
26 x41 0 4 6 1E+10 12
27 x42 0 4 7 1E+10 24
28 x43 0 4 8 1E+10 14
29 x44 5 4 9 1E+10 7
30 x45 40 4 10 1E+10 12
31 x51 0 5 6 1E+10 37
32 x52 0 5 7 1E+10 40
33 x53 0 5 8 1E+10 32
34 x54 0 5 9 1E+10 12
35 x55 0 5 10 1E+10 10
 Comp. Time 00:07
Status Optimal

de Data and Balance Constraints

Fixed Balance
0 2E-09
0 0
0 0
0 0
0 -8E-15
-30 0
-40 1E-08
-50 0
-35 0
-40 0

Constraints
Transportation Model Name:LocTrans Objective TermSolver: Excel Solver
5780 Type: Trans Ship. Cost: 2215 Type: Linear
25 Change Goal: Min Sup. Cost: 3565 Sens.: No
1 Objective: 5780 Dem. Rev.: 0 nteger: No
1 Solve ans+Fixed Cost 9880 Side: Yes
1
1 Vary
1 Vary Select the Relink Buttons command from the OR_MM menu before clicking
100 Trans. Flows 1 2 3 4 5 Supply Data
Name D1 D2 D3 D4 D5 Min. Max. Cost Shipped
1 S1 30 40 0 0 0 0 80 20 70
2 S2 0 0 0 0 0 0 80 17 0
3 S3 0 0 50 30 0 0 80 13 80
4 S4 0 0 0 5 40 0 80 25 45
5 S5 0 0 0 0 -4E-19 0 80 33 -4E-19
Demand Min.: 30 40 50 35 40
Data Max: 30 40 50 35 40
Revenue: 0 0 0 0 0
Received: 30 40 50 35 40

Trans. Costs 1 2 3 4 5
Name D1 D2 D3 D4 D5 0-1 Var Fixed C
1 S1 8 21 42 12 37 y1 1 1000
2 S2 21 10 31 24 40 y2 -3E-13 1500
3 S3 42 31 4 14 32 y3 1 1700
4 S4 12 24 14 7 12 y4 1 1400
5 S5 37 40 32 12 10 y5 -7E-17 1200
Total 4100

Unit shipping cost

Customer MaximuFixed Variable
Warehous 1 2 3 4 5 capacit cost cost
1 8 21 42 12 37 80 1000 20
2 21 10 31 24 40 80 1500 17
3 42 31 4 14 32 80 1700 13
4 12 24 14 7 12 80 1400 25
5 37 40 32 12 10 80 1200 33
Demand 30 40 50 35 40
M menu before clicking a button.

Shipped

Side Constraints
1 -10
2 2E-11
3 0
4 -35
5 5E-15
Linear Model Name: Cover Solver: Excel Solver
62 Type: LP1 Type: Linear-Integer
14 Change Goal: Min Sens.: No Comp. Time
1 Objective: 62 Side: No
1 Solve
0 Variables I-1 I-2 I-3 I-4 I-5 I-6
1 Vary Name: X1 X2 X3 X4 X5 X6
100 Values: 0 0 0 2E-16 1 0
Lower Bounds:
Change Relation 0 0 0 0 0 0
Upper Bounds: 1 1 1 1 1 1

Linear Obj. Coef.: 12 17 13 10 13 17

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 Dev1 1 >= 1 1 0 0 0 0 0
2 Dev2 2 >= 1 0 1 0 0 0 0
3 Dev3 1 >= 1 0 0 1 0 0 0
4 Dev4 1 >= 1 0 0 0 1 0 0
5 Dev5 1 >= 1 0 0 0 0 1 0
6 Dev6 1 >= 1 0 0 0 0 0 1

Covering Solution Partitioning Solution

X5 X7 X 13 X1 X5 X 10
1 1 1 1 1 1
0 0 0 0 0 0
1 1 1 1 1 1

13 24 25 12 13 38

Dev1 0 1 0 Dev1 1 0 0
Dev2 0 1 1 Dev2 0 0 1
Dev3 0 1 0 Dev3 0 0 1
Dev4 0 0 1 Dev4 0 0 1
Dev5 1 0 0 Dev5 0 1 0
Dev6 0 0 1 Dev6 0 0 1
Comp. Time 00:03
Status Optimal

I-7 I-8 I-9 I-10 I-11 I-12 I-13 I-14

X7 X8 X9 X 10 X 11 X 12 X 13 X 14
1 0 0 1E-11 0 0 1 0
0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1

24 24 60 38 27 45 25 35

1 1 0 0 0 1 0 1
1 0 1 1 0 1 1 0
1 1 1 1 1 0 0 0
0 1 1 1 1 0 1 1
0 0 1 0 1 1 0 1
0 0 1 1 0 1 1 0

63
Linear Model Name: TSP Solver: Excel Solver
63 Type: LP1 Type: Linear-Integer
36 Change Goal: Min Sens.: No Comp. Time
1 Objective: 63 Side: No
1 Solve
1 Variables I-1 I-2 I-3 I-4 I-5 I-6
1 Vary Name: x1-1 x1-2 x1-3 x1-4 x1-5 x1-6
1 Values: 0 0 0 1 1E-13 0
100 Lower Bounds:
Change Relation 0 0 0 0 0 0
Upper Bounds: 1 1 1 1 1 1

Linear Obj. Coef.: 1000 27 43 16 30 26

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 Leave1 1 = 1 1 1 1 1 1 1
2 Leave2 1 = 1 0 0 0 0 0 0
3 Leave3 1 = 1 0 0 0 0 0 0
4 Leave4 1 = 1 0 0 0 0 0 0
5 Leave5 1 = 1 0 0 0 0 0 0
6 Leave6 1 = 1 0 0 0 0 0 0
7 Enter1 1 = 1 1 0 0 0 0 0
8 Enter2 1 = 1 0 1 0 0 0 0
9 Enter3 1 = 1 0 0 1 0 0 0
10 Enter4 1 = 1 0 0 0 1 0 0
11 Enter5 1 = 1 0 0 0 0 1 0
12 Enter6 1 = 1 0 0 0 0 0 1
13 ST1 2 <= 2 0 1 0 1 0 0

1 2 3 4 5 6
1 1000 27 43 16 30 26
2 7 1000 16 1 30 25
3 20 13 1000 35 5 0
4 21 16 25 1000 18 18
5 12 46 27 48 1000 5
6 23 5 5 9 5 1000
Comp. Time 00:07
Status Optimal

I-7 I-8 I-9 I-10 I-11 I-12 I-13 I-14 I-15 I-16 I-17 I-18
x2-1 x2-2 x2-3 x2-4 x2-5 x2-6 x3-1 x3-2 x3-3 x3-4 x3-5 x3-6
1 0 7E-25 0 0 0 0 1E-13 0 0 1 4E-28
0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1 1

7 1000 16 1 30 25 20 13 1000 35 5 0

0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 0 0 0 0 0 0
0 0 0 0 0 0 1 1 1 1 1 1
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 1 0 0 0 0 0
0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0 1 0 0 0
0 0 0 1 0 0 0 0 0 1 0 0
0 0 0 0 1 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0 0 0 0 1
1 0 0 1 0 0 0 0 0 0 0 0

Solutions z Subtours
1 x1-4 x2-1 x3-5 x4-2 x5-6 x6-3 54 x1-4 x4-2

2 x1-4 x2-1 x3-5 x4-3 x5-6 x6-2 63 No Subtours. Optimal

I-19 I-20 I-21 I-22 I-23 I-24 I-25 I-26 I-27 I-28 I-29 I-30
x4-1 x4-2 x4-3 x4-4 x4-5 x4-6 x5-1 x5-2 x5-3 x5-4 x5-5 x5-6
0 0 1 0 -4E-23 0 -4E-23 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1 1

21 16 25 1000 18 18 12 46 27 48 1000 5

0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 0 0 0 0 0 0
0 0 0 0 0 0 1 1 1 1 1 1
0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 1 0 0 0 0 0
0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0 1 0 0 0
0 0 0 1 0 0 0 0 0 1 0 0
0 0 0 0 1 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0 0 0 0 1
1 1 0 0 0 0 0 0 0 0 0 0

Subtour Elimination Constraint

x2-1 x3-5 x5-6 x6-3 x1-4 x4-1 x2-1 x1-2 x2-4 x4-2
I-31 I-32 I-33 I-34 I-35 I-36
x6-1 x6-2 x6-3 x6-4 x6-5 x6-6
0 1 0 1E-13 0 0
0 0 0 0 0 0
1 1 1 1 1 1

23 5 5 9 5 1000

0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
1 1 1 1 1 1
1 0 0 0 0 0
0 1 0 0 0 0
0 0 1 0 0 0
0 0 0 1 0 0
0 0 0 0 1 0
0 0 0 0 0 1
0 0 0 0 0 0

≤2
Transportation Model Name: TSP_Trans Objective TermSolver: Excel Solver
63 Type: Trans Ship. Cost: 63 Type: Linear
36 Change Goal: Min Sup. Cost: 0 Sens.: No
1 Objective: 63 Dem. Rev.: 0 nteger: No
0 Solve Side: Yes
1
0 Vary
1 Vary
100 Trans. Flows 1 2 3 4 5 6 Supply Data
Name D1 D2 D3 D4 D5 D6 Min. Max. Cost
1 S1 0 0 0 1 0 0 1 1 0
2 S2 1 0 4E-12 -1E-16 0 0 1 1 0
3 S3 0 0 0 0 1 6E-12 1 1 0
4 S4 0 0 1 0 6E-12 0 1 1 0
5 S5 6E-12 0 0 0 0 1 1 1 0
6 S6 0 1 1E-13 0 0 0 1 1 0
Demand Min.: 1 1 1 1 1 1
Data Max: 1 1 1 1 1 1
Revenue: 0 0 0 0 0 0 Solution 1
Received: 1 1 1 1 1 1 S1-D4
S4-D2
Trans. Costs 1 2 3 4 5 6 S2-D1
Name D1 D2 D3 D4 D5 D6
1 S1 1000 27 43 16 30 26 S3-D5
2 S2 7 1000 16 1 30 25 S5-D6
3 S3 20 13 1000 35 5 0 S6-D3
4 S4 21 16 25 1000 18 18 z 54
5 S5 12 46 27 48 1000 5 Subtour
6 S6 23 5 5 9 5 1000 ConstraConst
1 2
2 6E-12
 Comp. Time 00:07
Status Optimal

Shipped
1
1
1
1
1
1
Solution 3
S1-D4
Solution 2 S4-D3
S1-D2 S3-D5
S2-D4 S5-D6
S4-D5 S6-D2
S5-D1 S2-D1
Tour
S3_D6 63
S6D3
63

Lim
2
1
Linear Model Name: MST Solver: Excel Solver
42 Type: LP1 Type: Linear-Integer
36 Change Goal: Min Sens.: No Comp. Time
1 Objective: 42 Side: No
1 Solve
1 Variables I-1 I-2 I-3 I-4 I-5 I-6
1 Vary Name: x1-1 x1-2 x1-3 x1-4 x1-5 x1-6
0 Values: 0 0 0 4E-11 0 1
1 Lower Bounds:
Change Relation 0 0 0 0 0 0
100 Upper Bounds: 1 1 1 1 1 1

Linear Obj. Coef.: 1000 27 43 16 30 26

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 Leave1 1 >= 1 1 1 1 1 1 1
2 Enter2 1 = 1 0 1 0 0 0 0
3 Enter3 1 = 1 0 0 1 0 0 0
4 Enter4 1 = 1 0 0 0 1 0 0
5 Enter5 1 = 1 0 0 0 0 1 0
6 Enter6 1 = 1 0 0 0 0 0 1
7 ST1 1 <= 1 0 0 0 0 0 0
8 ST2 1 <= 2 0 0 0 0 0 0
9 ST3 1 <= 1 0 0 0 0 0 0
10 ST4 1 <= 2 0 0 0 0 0 0

Solutions z
1 x1-4 x3-6 x6-2 x6-3 x6-5 31

2 x1-4 x3-5 x5-6 x6-2 x6-3 36

3 x1-4 x5-6 x6-2 x6-3 x6-5 36

4 x1-4 x2-3 x3-6 x6-2 x6-5 42

5 x1-6 x2-4 x6-2 x6-3 x6-5 42

Comp. Time 00:09
Status Optimal

I-7 I-8 I-9 I-10 I-11 I-12 I-13 I-14 I-15 I-16 I-17 I-18
x2-1 x2-2 x2-3 x2-4 x2-5 x2-6 x3-1 x3-2 x3-3 x3-4 x3-5 x3-6
0 0 0 1 0 0 0 0 0 0 0 2E-11
0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1 1

7 1000 16 1 30 25 20 13 1000 35 5 0

0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0 1 0 0 0
0 0 0 1 0 0 0 0 0 1 0 0
0 0 0 0 1 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0 1

Subtours Subtour Elimination Constraint

x3-6 x6-3 ST1 x3-6 x6-3 ≤1

x3-5 x5-6 x6-3 ST2 x3-5 x5-6 x6-3 ≤2

x5-6 x6-5 ST3 x5-6 x6-5 ≤1

x2-3 x3-6 x6-2 ST4 x2-3 x3-6 x6-2 ≤2

No Subtours. Optimal Solution

 I-19 I-20 I-21 I-22 I-23 I-24 I-25 I-26 I-27 I-28 I-29 I-30
x4-1 x4-2 x4-3 x4-4 x4-5 x4-6 x5-1 x5-2 x5-3 x5-4 x5-5 x5-6
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1 1

21 16 25 1000 18 18 12 46 27 48 1000 5

0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0 1 0 0 0
0 0 0 1 0 0 0 0 0 1 0 0
0 0 0 0 1 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0

Constraint
I-31 I-32 I-33 I-34 I-35 I-36
x6-1 x6-2 x6-3 x6-4 x6-5 x6-6
0 1 1 0 1 0
0 0 0 0 0 0
1 1 1 1 1 1

23 5 5 9 5 1000

0 0 0 0 0 0
0 1 0 0 0 0
0 0 1 0 0 0
0 0 0 1 0 0
0 0 0 0 1 0
0 0 0 0 0 1
0 0 1 0 0 0
0 0 1 0 0 0
0 0 0 0 1 0
0 1 0 0 0 0
Linear Model Name: SPT Solver: Excel Solver
130 Type: LP1 Type: Linear
36 Change Goal: Min Sens.: No Comp. Time
1 Objective: 130 Side: No
1 Solve
0 Variables 1 2 3 4 5 6
100 Vary Name: x1-1 x1-2 x1-3 x1-4 x1-5 x1-6
Values: 0 1 0 1 1 2
Lower Bounds:
Change Relation 0 0 0 0 0 0
Upper Bounds: 100 100 100 100 100 100

Linear Obj. Coef.: 1000 27 43 16 30 26

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 Cons2 -1 = -1 0 -1 0 0 0 0
2 Cons3 -1 = -1 0 0 -1 0 0 0
3 Cons4 -1 = -1 0 0 0 -1 0 0
4 Cons5 -1 = -1 0 0 0 0 -1 0
5 Cons6 -1 = -1 0 0 0 0 0 -1
Comp. Time 00:06
Status Optimal

7 8 9 10 11 12 13 14 15 16 17 18
x2-1 x2-2 x2-3 x2-4 x2-5 x2-6 x3-1 x3-2 x3-3 x3-4 x3-5 x3-6
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
100 100 100 100 100 100 100 100 100 100 100 100

7 1000 16 1 30 25 20 13 1000 35 5 0

1 1 1 1 1 1 0 -1 0 0 0 0
0 0 -1 0 0 0 1 1 1 1 1 1
0 0 0 -1 0 0 0 0 0 -1 0 0
0 0 0 0 -1 0 0 0 0 0 -1 0
0 0 0 0 0 -1 0 0 0 0 0 -1
 19 20 21 22 23 24 25 26 27 28 29 30
x4-1 x4-2 x4-3 x4-4 x4-5 x4-6 x5-1 x5-2 x5-3 x5-4 x5-5 x5-6
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
100 100 100 100 100 100 100 100 100 100 100 100

21 16 25 1000 18 18 12 46 27 48 1000 5

0 -1 0 0 0 0 0 -1 0 0 0 0
0 0 -1 0 0 0 0 0 -1 0 0 0
1 1 1 1 1 1 0 0 0 -1 0 0
0 0 0 0 -1 0 1 1 1 1 1 1
0 0 0 0 0 -1 0 0 0 0 0 -1
 31 32 33 34 35 36
x6-1 x6-2 x6-3 x6-4 x6-5 x6-6
0 0 1 0 0 0
0 0 0 0 0 0
100 100 100 100 100 100

23 5 5 9 5 1000

0 -1 0 0 0 0
0 0 -1 0 0 0
0 0 0 -1 0 0
0 0 0 0 -1 0
1 1 1 1 1 1
Network Model Name:SPT_Net Solver: Excel Solver
130 Type: Net Type: Linear
36 Change Goal: Min Sens.: No
1 Objective: 130 Side: No
0 Solve
100
Vary
Vary
Arc Data and Flows Node Data and Balance Constraints
Num. Name Flow Origin Term. Cost Num. Name Fixed
1 x1-1 0 1 1 1000 1 N1 5
2 x1-2 1 1 2 27 2 N2 -1
3 x1-3 0 1 3 43 3 N3 -1
4 x1-4 1 1 4 16 4 N4 -1
5 x1-5 1 1 5 30 5 N5 -1
6 x1-6 2 1 6 26 6 N6 -1
7 x2-1 0 2 1 7
8 x2-2 0 2 2 1000
9 x2-3 0 2 3 16
10 x2-4 0 2 4 1
11 x2-5 0 2 5 30
12 x2-6 0 2 6 25
13 x3-1 0 3 1 20
14 x3-2 0 3 2 13
15 x3-3 0 3 3 1000
16 x3-4 0 3 4 35
17 x3-5 0 3 5 5
18 x3-6 0 3 6 0
19 x4-1 0 4 1 21
20 x4-2 0 4 2 16
21 x4-3 0 4 3 25
22 x4-4 0 4 4 1000
23 x4-5 0 4 5 18
24 x4-6 0 4 6 18
25 x5-1 0 5 1 12
26 x5-2 0 5 2 46
27 x5-3 0 5 3 27
28 x5-4 0 5 4 48
29 x5-5 0 5 5 1000
30 x5-6 0 5 6 5
31 x6-1 0 6 1 23
32 x6-2 0 6 2 5
33 x6-3 1 6 3 5
34 x6-4 0 6 4 9
35 x6-5 0 6 5 5
36 x6-6 0 6 6 1000
 Comp. Time 00:07
Status Optimal

and Balance Constraints

Balance
3E-11
-5E-12
-5E-12
-5E-12
-5E-12
-2E-11
Linear Model Name: Cutting Solver: Excel Solver
64 Type: LP1 Type: Linear-Integer
10 Change Goal: Min Sens.: No Comp. Time
1 Objective: 64 Side: No
1 Solve
1 Variables I-1 I-2 I-3 I-4 I-5 I-6
0 Vary Name: X1 X2 X3 X4 X5 X6
100 Values: 21 0 11 14 15 0
Lower Bounds:
Change Relation 0 0 0 0 0 0
Upper Bounds: 40 40 40 40 40 40

Linear Obj. Coef.: 1 1 1 1 1 1

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 L17 21 >= 20 1 1 0 0 0 0
2 L15 25 >= 25 0 0 1 1 0 0
3 L12 30 >= 30 0 0 0 0 2 1
4 L8 35 >= 35 1 0 1 0 0 1
5 L5 40 >= 40 0 1 0 2 0 1
Comp. Time 00:12
Status Optimal

I-7 I-8 I-9 I-10

X7 X8 X9 X 10
0 0 0 3
0 0 0 0
40 40 40 40

1 1 1 1

0 0 0 0
0 0 0 0
1 0 0 0
0 3 2 1
2 0 1 4
 Non_Lin_Coef

Table 2 Product Data P Q R

Profit per unit for sales less
than 30 $60 40 20
Profit per unit for sales
between 30 and 60 45 60 70
Profit per unit for sales
between 60 and 100 35 65 20
Max. Sales 100 100 100

Sales P Q R
0 0 0 0
10 600 400 200
20 1200 800 400
30 1800 1200 600
40 2250 1800 1300
50 2700 2400 2000
60 3150 3000 2700
70 3500 3650 2900
80 3850 4300 3100
90 4200 4950 3300
100 4550 5600 3500

Profit
6000

5000

4000

P
3000 Q
R
2000

1000

0 Sales
0 10 20 30 40 50 60 70 80 90 0
10

Page 54
 Non_Lin_Coef

30

60

600
600
600
450
450
450
350
350
350
350

P
Q
R

Sales
80 90 10
0

Page 55
Linear Model Name:Non_Lin Solver: Excel Solver
7268 Type: LP1 Type: Linear-Integer
15 Change Goal: Max Sens.: No Comp. Time
1 Objective: 7268 Side: No
1 Solve
1 Variables I-1 I-2 I-3 4 5 6
0 Vary Name: yQ2 yQ3 YR2 P Q R
1 Values: 0 0 1 81.82 16.36 60
1 Change RelationLower Bounds: 0 0 0 0 0 0
1 Upper Bounds: 1 1 1 100 100 100
1
1 Linear Obj. Coef.: 0 0 0 0 0 0
100 Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 MachA 2400 <= 2400 0 0 0 20 10 10
2 MachB 2400 <= 2400 0 0 0 12 28 16
3 MachC 2285 <= 2400 0 0 0 15 6 16
4 MachD 1064 <= 2400 0 0 0 10 15 0
5 LinkP -7E-15 = 0 0 0 0 -1 0 0
6 LinkQ 0 = 0 0 0 0 0 -1 0
7 LinkR 0 = 0 0 0 0 0 0 -1
8 Q1_lower 16.36 >= 0 -30 0 0 0 0 0
9 Q2_lower 0 >= 0 0 -30 0 0 0 0
10 Q2_upper 0 <= 0 -30 0 0 0 0 0
11 Q3_upper 0 <= 0 0 -40 0 0 0 0
12 R1_lower 0 >= 0 0 0 -30 0 0 0
13 R2_upper 0 <= 0 0 0 -30 0 0 0
14 R3_upper -40 <= 0 0 0 -40 0 0 0
Comp. Time 00:08
Status Optimal

7 8 9 10 11 12 13 14 15
P1 P2 P3 Q1 Q2 Q3 R1 R2 R3
30 30 21.82 16.36 0 0 30 30 0
0 0 0 0 0 0 0 0 0
30 30 40 30 1E+10 1E+10 30 1E+10 1E+10

60 45 35 40 60 65 20 70 20

0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
1 1 1 0 0 0 0 0 0
0 0 0 1 1 1 0 0 0
0 0 0 0 0 0 1 1 1
0 0 0 1 0 0 0 0 0
0 0 0 0 1 0 0 0 0
0 0 0 0 1 0 0 0 0
0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 1