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
Math
Math
Math
Math

Programming
Programming
Programming
Programming
Programming

Linear/Excel Solver
Transportation/Excel Solver
Linear/Excel Solver
Linear/Excel Solver
Network/Excel Solver

Math Programming - Linear/Excel Solver

None
Math Programming - Linear/Excel Solver

Page 3

Linear Model
1
0
1
1
1
100
100
0
60

Change

Name:
Type:
Goal:
Objective:

Inv
LP1
Max
40

Solve

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary

Linear Obj. Coef.:

Constraints
Num. Name Value
1
Budget
99

Rel.
<=

RHS
100

Solver:
Type:
Sens.:
Side:
I-1
A1

I-2
A2

I-3
A3

Jensen LP/IP
Linear-Integer
No
No
I-4
A4

I-5
B1

Tree Nodes
Simplex Iter.
Comp. Time

I-6
B2

1
0
1

0
0
1

1
0
1

0
0
1

0
0
1

0
0
1

11

12

15

Linear Constraint Coefficients

13
20
24
30

39

45

Tree Nodes
70
Simplex Iter. 139
Comp. Time 00:04
Status Optimal IP
I-7
B3

I-8
B4

I-9
C1

I-10
C2

I-11
C3

I-12
C4

1
0
1

1
0
1

1
0
1

0
0
1

0
0
1

0
0
1

12

16

19

20

12

20

30

44

48

55

Algorithmic Details for problem Inv.

Objective value:
Jensen LP Solution Algorithm
Solution
Start Solution
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

40
Var 1

Var 2
1

Start Phase 1
Iterations Iter.

Enters
16

Start Phase2
Iterations Iter.

Leaves
6

Red. Cost Var. Chg

14 -0.818182 0.1555555

Enters
Leaves
Red. Cost
17
10
6 -1.333333
Node 5
Optimal: z = 40.5454542040825
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
18
6
14 -1.022727
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
19
2
6 -0.333333
Node 6
Optimal: z = 40.4499997287989
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
20
6
14
-2.25
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 7
Optimal: z = 40.3333330949148
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
21
5
14 -0.866667
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 8
Optimal: z = 40.1538460254669
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
22
13
14 -0.025641
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
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
23
-8
0
-20
24
-1
14
-13
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
25
-7
0 -0.538462
Node 10
Optimal: z = 37
Add Artificial and Slack Variables

Var. Chg
0.1590909

Var. Chg
0.1555555
Var. Chg
0.35

Var. Chg
0.1555555
Var. Chg

Var. Chg
0.1794872
Var. Chg

Var. Chg
6.9999996
Var. Chg

Var. Chg
1
0.9230769
Var. Chg
1

Surplus Variable: 13 added for constraint 1.

Artifical Variable: 14 added for constraint 1.
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
26
-5
0
-39
27
-1
14
-13
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
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
28
-6
14
-45
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
29
1
0 -1.666667
30
8
6 -1.333333
31
7
0
-0.2
Node 12
Optimal: z = 39.8
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
32
6
15
-2.25
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 13
Optimal: z = 39.3333332935969
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
33
5
15 -0.866667
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 14
Optimal: z = 39.1538460254669
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
34
13
15 -0.025641
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
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
35
-1
0
-13
36
-7
0
-12

Var. Chg
1
0.4615385
Var. Chg

Var. Chg
0.4444444
Var. Chg
0.4615385
0.95
1

Var. Chg
0.1555556
Var. Chg

Var. Chg
0.1794872
Var. Chg

Var. Chg
6.9999996
Var. Chg

Var. Chg
1
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
37
-5
0
-39
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
38
-6
14
-45
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
39
1
6 -1.666667
Node 18
Optimal: z = 39.5384615384615
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
Node 19
Infeasible
Add Artificial and Slack Variables
Slack Variable: 13 added for constraint 1.
Start Phase 2
Iterations Iter.
Enters
Leaves
Red. Cost
40
6
13
-15
41
7
0
-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
42
-2
0
-20
43
-8
0
-20
44
-7
14
-12
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
45
1
7 -0.583333
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
46
-10
0
-44
47
-1
0
-13
Node 22
Infeasible

Var. Chg
1

Var. Chg
0.7333333
Var. Chg
0.9230769

Var. Chg

Var. Chg
0.2666667
1

Var. Chg
1
1
0.3333333
Var. Chg
0.6153846

Var. Chg
1
0.6153846

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
48
-12
14
-55
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
49
1
0 -1.272727
50
8
12 -0.727273
51
7
8
-0.2
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
52
-4
14
-30
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
53
8
4 -0.666667
54
7
0
-0.2
Node 24
Optimal: z = 40.2
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
55
12
15
-2.75
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
56
4
12 -0.090909
Node 25
Optimal: z = 40.1000000437101
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
57
12
15 -1.833333
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 26
Optimal: z = 40.0909091071649
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
58
6
15 -0.818182
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
59
10
6 -1.333333
Node 27
Optimal: z = 40.0909090936184
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost

Var. Chg
0.6
Var. Chg
1
0.45
0.75

Var. Chg
0.8
Var. Chg
0.3
0.25

Var. Chg
0.0545455
Var. Chg
0.1

Var. Chg
0.0545455
Var. Chg

Var. Chg
0.0666667
Var. Chg
0.0681818

Var. Chg

60
Start Phase2
Iterations Iter.

15 -1.022727 0.0666667

Enters
Leaves
Red. Cost
61
2
6 -0.333333
Node 28
Optimal: z = 40.0500000312924
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
62
6
15
-2.25
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 29
Optimal: z = 40.0000000397364
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
63
5
15 -0.866667
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
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
64
-5
0
-39
65
-1
0
-13
66
-7
0
-12
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
67
-6
14
-45
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
68
1
6 -1.666667
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
69
-2
0
-20
70
-1
0
-13
Node 33
Infeasible
Add Artificial and Slack Variables
Surplus Variable: 13 added for constraint 1.
Artifical Variable: 14 added for constraint 1.

Var. Chg
0.15

Var. Chg
0.0666667
Var. Chg

Var. Chg
0.0769231
Var. Chg

Var. Chg
0.0769231
1
1

Var. Chg
0.8222222
Var. Chg
0.6153846

Var. Chg
1
0.6153846

Start Phase 1
Iterations Iter.

Enters
Leaves
Red. Cost
71
-10
0
-44
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
72
-12
0
-55
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
73
-4
14
-30
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
74
1
4 -1.233333
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
75
-3
0
-24
76
-8
14
-20
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
77
1
0
-0.8
78
7
8
-0.2
Node 37
Optimal: z = 40.75
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
79
-1
15 -1.083333
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 38
Optimal: z = 40.6153846153846
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
Node 39
Infeasible
Add Artificial and Slack Variables
Slack Variable: 13 added for constraint 1.
Start Phase 2
Iterations Iter.
Enters
Leaves
Red. Cost
80
12
13
-20

Var. Chg
1

Var. Chg
1

Var. Chg
0.7333333
Var. Chg
0.6153846

Var. Chg
1
0.3
Var. Chg
0.3846154
0.75

Var. Chg
0.2307692
Var. Chg

Var. Chg

Var. Chg
0.1818182

81
8
12 -0.727273
Node 40
Optimal: z = 40
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
Node 41
Infeasible
Add Artificial and Slack Variables
Slack Variable: 13 added for constraint 1.
Start Phase 2
Iterations Iter.
Enters
Leaves
Red. Cost
82
12
13
-20
83
3
12 -0.272727
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
84
12
13
-20
85
1
12 -1.272727
86
-3
1 -2.076923
87
8
3
-0.5
Node 43
Optimal: z = 40.6
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
88
12
14
-2.75
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
89
3
12 -0.272727
Node 44
Optimal: z = 40.374999910593
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
90
12
14 -2.291667
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
91
4
12 -0.090909
Node 45
Optimal: z = 40.3
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
92
12
14 -1.833333
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 46
Optimal: z = 40.2727274027738
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
93
6
14 -0.818182

0.5

Var. Chg

Var. Chg
0.1818182
0.4166667

Var. Chg
0.2181818
0.9230769
0.0416667
0.45

Var. Chg
0.1636364
Var. Chg
0.375

Var. Chg
0.1636364
Var. Chg
0.3

Var. Chg
0.1636364
Var. Chg

Var. Chg
0.2

Start Phase2
Iterations Iter.

Enters
Leaves
Red. Cost
94
10
6 -1.333333
Node 47
Optimal: z = 40.2727274298668
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
95
6
14 -1.022727
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
96
2
6 -0.333333
Node 48
Optimal: z = 40.1500002086163
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
97
6
14
-2.25
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
Node 49
Optimal: z = 40.0000001192093
Branch and Bound artificial added
Start Phase 1
Iterations Iter.
Enters
Leaves
Red. Cost
98
5
14 -0.866667
Start Phase2
Iterations Iter.
Enters
Leaves
Red. Cost
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
99
-5
0
-39
100
-1
0
-13
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
0.2045455

Var. Chg
0.2
Var. Chg
0.45

Var. Chg
0.2
Var. Chg

Var. Chg
0.2307692
Var. Chg

Var. Chg
0.2307692
1

Var. Chg

Var 3

Var 4
1

Node
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

Var 5
0

Level
0
1
2
3
4
5
6
7
8
9
9
8
7
8
9
10
10
9
8
9
9
6
5
4
3
4
5
6
7
8
9
9
8
7
6
5
4
2
3
4
4
5

Var 6
0

Variable
0
11
9
3
4
12
10
2
6
5
5
6
2
8
6
5
5
6
8
1
1
10
12
4
3
8
4
12
10
2
6
6
2
10
12
4
8
9
7
1
1
8

Var 7
0

Var 8
1

Value Up/Down
0
0
1
1
0
-1
0
-1
0
-1
0
-1
0
-1
0
-1
0
-1
0
-1
1
1
1
1
1
1
0
-1
0
-1
0
-1
1
1
1
1
1
1
1
1
0
-1
1
1
1
1
1
1
1
1
0
-1
0
-1
0
-1
0
-1
0
-1
0
-1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
-1
1
1

Var 9
1

Visit
0
1
1
1
1
1
1
1
1
1
2
2
2
1
1
1
2
2
2
1
2
2
2
2
2
1
1
1
1
1
1
2
2
2
2
2
2
2
1
1
2
1

Var 10
1

Var 11
0

Relax
40.8958 Branch X(11) up at 1
40.8
Branch X(9) down at 0
40.625 Branch X(3) down at 0
40.5667 Branch X(4) down at 0
40.5455 Branch X(12) down at 0
40.5455 Branch X(10) down at 0
40.45 Branch X(2) down at 0
40.3333 Branch X(6) down at 0
40.1538 Branch X(5) down at 0
38
Integer: Replace incumbent: Backtrack
37
Fathom: Backtrack Level 9 8 : Branch X(
37.2308 Fathom: Backtrack Level 8 7 : Branch X(
39.8
Branch X(8) down at 0
39.3333 Branch X(6) down at 0
39.1538 Branch X(5) down at 0
37
Fathom: Backtrack Level 10 : Branch X(5
Infeasible Infeasible: Backtrack Level 10 9 : Branch
Infeasible Infeasible: Backtrack Level 9 8 : Branch
39.5385 Branch X(1) up at 1
Infeasible Infeasible: Backtrack Level 9 : Branch X(
39
Integer: Replace incumbent: Backtrack
38.6923 Fathom: Backtrack Level 6 5 : Branch X(
Infeasible Infeasible: Backtrack Level 5 4 : Branch
39.75 Fathom: Backtrack Level 4 3 : Branch X(
40.2
Branch X(8) down at 0
40.1
Branch X(4) down at 0
40.0909 Branch X(12) down at 0
40.0909 Branch X(10) down at 0
40.05 Branch X(2) down at 0
40
Branch X(6) down at 0
39.9231 Fathom: Backtrack Level 9 : Branch X(6)
Infeasible Infeasible: Backtrack Level 9 8 : Branch
38.6923 Fathom: Backtrack Level 8 7 : Branch X(
Infeasible Infeasible: Backtrack Level 7 6 : Branch
Infeasible Infeasible: Backtrack Level 6 5 : Branch
Infeasible Infeasible: Backtrack Level 5 4 : Branch
39.6923 Fathom: Backtrack Level 4 3 2 : Branch X
40.75 Branch X(7) up at 1
40.6154 Branch X(1) up at 1
Infeasible Infeasible: Backtrack Level 4 : Branch X(
40
Branch X(8) up at 1
Infeasible Infeasible: Backtrack Level 5 : Branch X(

42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70

5
3
4
5
6
7
8
9
10
10
9
8
7
6
5
4
1
2
3
4
5
6
7
7
6
5
4
3
2

8
7
8
3
4
12
10
2
6
6
2
10
12
4
3
8
11
4
12
10
2
6
5
5
6
2
10
12
4

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

-1
-1
-1
-1
-1
-1
-1
-1
-1
1
1
1
1
1
1
1
-1
-1
-1
-1
-1
-1
-1
1
1
1
1
1
1

2
2
1
1
1
1
1
1
1
2
2
2
2
2
2
2
2
1
1
1
1
1
1
2
2
2
2
2
2

39.75 Fathom: Backtrack Level 5 4 3 : Branch X

40.6
Branch X(8) down at 0
40.375 Branch X(3) down at 0
40.3
Branch X(4) down at 0
40.2727 Branch X(12) down at 0
40.2727 Branch X(10) down at 0
40.15 Branch X(2) down at 0
40
Branch X(6) down at 0
39.7692 Fathom: Backtrack Level 10 : Branch X(6
Infeasible Infeasible: Backtrack Level 10 9 : Branch
38.9231 Fathom: Backtrack Level 9 8 : Branch X(
Infeasible Infeasible: Backtrack Level 8 7 : Branch
Infeasible Infeasible: Backtrack Level 7 6 : Branch
Infeasible Infeasible: Backtrack Level 6 5 : Branch
Infeasible Infeasible: Backtrack Level 5 4 : Branch
39.9231 Fathom: Backtrack Level 4 3 2 1 : Branch
40.3667 Branch X(4) down at 0
40.3636 Branch X(12) down at 0
40.3636 Branch X(10) down at 0
40.35 Branch X(2) down at 0
40.3333 Branch X(6) down at 0
40.3077 Branch X(5) down at 0
40
Integer: Replace incumbent: Backtrack
37.4
Fathom: Backtrack Level 7 6 : Branch X(
38
Fathom: Backtrack Level 6 5 : Branch X(
39.875 Fathom: Backtrack Level 5 4 : Branch X(
39.4
Fathom: Backtrack Level 4 3 : Branch X(
39
Fathom: Backtrack Level 3 2 : Branch X(
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
37
15
1
1
1
0
1
1
100

Change

Name: Inv_2
Type: LP1
Goal: Max
Objective:
37

Solve

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary

Linear Obj. Coef.:

Constraints
Num. Name Value
1
Budget
100
2
Site 1
1
3
Site 2
1
4
Site 3
1
5
Site 4
1
6 Design A
-2
7 Des. Lim.
2
8
Des. A
-2
9
Des. B
-2
10
Des. C
0

Rel.
<=
<=
=
<=
<=
<=
<=
<=
<=
<=

RHS
100
1
1
1
1
0
2
0
0
0

Solver:
Type:
Sens.:
Side:
I-1
A1
1
0
1

I-2
A2
###
0
1

I-3
A3

Excel Solver
Linear-Integer
No
No
I-4
A4

I-5
B1

Comp. Time

I-6
B2

0
0
1

1
0
1

0
0
1

1
0
1

11

12

15

Linear Constraint Coefficients

13
20
24
30
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
1
1
1
-3
0
0
0
0
1
1
1
1
0
0
0
0
0
0
0
0

39
1
0
0
0
0
0
0
1
0

45
0
1
0
0
0
0
0
1
0

Comp. Time 00:09

Status Optimal
I-7
B3

I-8
B4

I-9
C1

I-10
C2

I-11
C3

I-12
C4

I-13
WA

I-14
WB

I-15
WC

1
0
1

0
0
1

0
0
1

0
0
1

0
0
1

0
0
1

1
0
1

1
0
1

0
0
1

12

16

19

20

12
0
0
1
0
0
0
0
1
0

20
0
0
0
1
0
0
0
1
0

30
1
0
0
0
0
0
0
0
1

44
0
1
0
0
0
0
0
0
1

48
0
0
1
0
0
0
0
0
1

55
0
0
0
1
0
0
0
0
1

0
0
0
0
0
0
1
-4
0
0

0
0
0
0
0
0
1
0
-4
0

0
0
0
0
0
0
1
0
0
-4

Linear Model
139
22
1
1
1
1
1
100

Change

Name: FixedIP
Type: LP1
Goal: Min
Objective:
139

Solve

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary

Linear Obj. Coef.:

Constraints
Num. Name Value
1
N1
14
2
N2
-4
3
N3
7
4
N4
-6
5
N5
-9
6
N6
0
7
N7
3
8
N8
-5
9
I1
0
10
I2 2E-016
11
I3
-3
12
I4
-5
13
I5
0

Rel.
=
=
=
=
=
=
=
=
<=
<=
<=
<=
<=

RHS
14
-4
7
-6
-9
0
3
-5
0
0
0
0
0

Solver:
Type:
Sens.:
Side:
I-1
y1
1
0
1

I-2
y2
###
0
1

I-3
y3

Excel Solver
Linear-Integer
No
No
I-4
y4

I-5
y5

Comp. Time

1
0
1

1
0
1

0
0
1

6
x1
10
0
10

Linear Constraint Coefficients

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
-10
0
0
0
0
-10
0
0
0
0
-10
0
0
0
0
-10
0
0
0
0

0
0
0
0
0
0
0
0
0
0
0
0
-10

1
0
0
-1
0
0
0
0
1
0
0
0
0

Comp. Time 00:04

Status Optimal
7
x2

8
x3

9
x4

10
x5

11
x6

12
x7

13
x8

14
x9

15
x10
0 2E-016
0
0
12
10

0
0
10

7
0
10

5
0
10

0
0
10

4
0
12

4
0
5

0
0
5

10

0
0
0
1
0
-1
0
0
0
1
0
0
0

0
0
1
0
0
0
0
-1
0
0
1
0
0

0
0
0
0
-1
0
1
0
0
0
0
1
0

0
0
0
0
1
0
-1
0
0
0
0
0
1

1
-1
0
0
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
-1
1
0
0
0
0
0
0
0
0

0
1
0
0
0
-1
0
0
0
0
0
0
0

16
x11

17
x12

18
x13

0
0
10

0
0
4

0
0
6

0
1
-1
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
0
0
-1
1
0
0
0
0
0
0
0

0
0
1
0
0
-1
0
0
0
0
0
0
0

19
x14

20
x15

21
x16

22
x17

0
0
5

2
0
3

0
0
3

0
0
7

0
0
0
0
0
1
0
-1
0
0
0
0
0

0
0
0
0
0
0
-1
1
0
0
0
0
0

0
0
0
0
0
0
1
-1
0
0
0
0
0

0
0
0
0
0
1
-1
0
0
0
0
0
0

Network Model
139
22
1
1
1
1
100

Change

Name:FixedNet
Type: Net
Goal: Min
Objective:
139

Solver:
Type:
Sens.:
Side:

Excel Solver
Linear-Integer
No
Yes

Cost
8
6
9
7
7
2
4
1
2
2
10
9
9
8
5
5
5
9
7
1
1
7

Gain Flow_O
1
1
1
0
1
1
1
1
1
0
1
10
1
0
1
7
1
5
1
0
1
4
1
4
1
0
1
0
1 2E-011
1
0
1
0
1
0
1
0
1
2
1
0
1
0

Solve
Vary
Vary
Arc Data and Flows
Num. Name Flow Origin Term. Lower Upper
I-1
y1
1
0
0
0
1
I-2
y2
0
0
0
0
1
I-3
y3
1
0
0
0
1
I-4
y4
1
0
0
0
1
I-5
y5
0
0
0
0
1
6
x1
10
1
4
0
10
7
x2
0
4
6
0
10
8
x3
7
3
8
0
10
9
x4
5
7
5
0
10
10
x5
0
5
7
0
10
11
x6
4
1
2
0
12
12
x7
4
4
5
0
5
13
x8
0
5
4
0
5
14
x9
0
2
6
0
12
15
x10 2E-011
2
3
0
10
16
x11
0
3
2
0
10
17
x12
0
6
5
0
4
18
x13
0
3
6
0
6
19
x14
0
6
8
0
5
20
x15
2
8
7
0
3
21
x16
0
7
8
0
3
22
x17
0
6
7
0
5

Flow_O

Side Node Data and Balance Constraints

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
###
6
N6
0
0
0
7
N7
3
0
-3
8
N8
-5
0
-5
0

Linear Model
9880
35
1
1
1
1
1
100

Change

Name: LocIP
Type: LP1
Goal: Min
Objective: 9880

Solve

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary

Linear Obj. Coef.:

Constraints
Num. Name Value
1
Dem1
30
2
Dem2
40
3
Dem3
50
4
Dem4
35
5
Dem5
40
6
Sup1
0
7
Sup2
0
8
Sup3
0
9
Sup4
0
10
Sup5
0
11
Ware1
-5
12
Ware2
0
13
Ware3
0
14
Ware4
-40
15
Ware5 2E-015

Rel.
=
=
=
=
=
<=
<=
<=
<=
<=
<=
<=
<=
<=
<=

RHS
30
40
50
35
40
0
0
0
0
0
0
0
0
0
0

Solver:
Type:
Sens.:
Side:
I-1
y1

I-2
y2

I-3
y3

Excel Solver
Linear-Integer
No
No
I-4
y4

Comp. Time

1
0
1

0
0
1

1
0
1

1
0
1

I-5
y5
###
0
1

6
z1
75
0
80

1000

1500

1700

1400

1200

20

Linear Constraint Coefficients

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
-80
0
0
0
0
-80
0
0
0
0
-80
0
0
0
0
-80
0
0
0
0

0
0
0
0
0
0
0
0
0
0
0
0
0
0
-80

0
0
0
0
0
-1
0
0
0
0
1
0
0
0
0

Comp. Time 00:10

Status Optimal
7
z2
0
0
80

8
z3
80
0
80

9
z4
40
0
80

17

13

0
0
0
0
0
0
-1
0
0
0
0
1
0
0
0

0
0
0
0
0
0
0
-1
0
0
0
0
1
0
0

10
z5
0
0
80

11
x11
30
0
###

12
x12
40
0
###

13
x13

14
x14

15
x15

16
x21

17
x22

18
x23

0
0
###

5
0
###

0
0
###

0
0
###

0
0
###

0
0
###

25

33

21

42

12

37

21

10

31

0
0
0
0
0
0
0
0
-1
0
0
0
0
1
0

0
0
0
0
0
0
0
0
0
-1
0
0
0
0
1

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

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

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

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

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

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

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

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

19
x24

20
x25

21
x31

22
x32
0
0
###

23
x33
50
0
###

24
x34
30
0
###

0
0
###

0
0
###

0
0
###

24

40

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

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

25
x35

26
x41

27
x42

28
x43

29
x44

0
0
###

0
0
###

0
0
###

0
0
###

0
0
###

30
x45
40
0
###

42

31

14

32

12

24

14

12

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

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

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

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

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

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

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

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

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

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

31
x51

32
x52

33
x53

34
x54

35
x55

0
0
###

0
0
###

0
0
###

0
0
###

0
0
###

37

40

32

12

10

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

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

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

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

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

Network Model
9880
35
1
1
0
1
100

Change

Name: LocNet
Type: Net
Goal: Min
Objective: 9880

Solver:
Type:
Sens.:
Side:

Excel Solver
Linear-Integer
No
Yes

Solve
Vary
Vary
Arc Data and
Num. Name
I-1
y1
I-2
y2
I-3
y3
I-4
y4
I-5
y5
6
z1
7
z2
8
z3
9
z4
10
z5
11
x11
12
x12
13
x13
14
x14
15
x15
16
x21
17
x22
18
x23
19
x24
20
x25
21
x31
22
x32
23
x33
24
x34
25
x35
26
x41
27
x42
28
x43
29
x44
30
x45
31
x51
32
x52
33
x53
34
x54
35
x55

Flows
Flow Origin Term. Upper
1
0
0
1
0
0
0
1
1
0
0
1
1
0
0
1
1E-016
0
0
1
70
0
1
80
3E-011
0
2
80
80
0
3
80
45
0
4
80
8E-015
0
5
80
30
1
6 ###
40
1
7 ###
0
1
8 ###
0
1
9 ###
0
1
10 ###
0
2
6 ###
3E-011
2
7 ###
0
2
8 ###
0
2
9 ###
0
2
10 ###
0
3
6 ###
0
3
7 ###
50
3
8 ###
30
3
9 ###
0
3
10 ###
0
4
6 ###
0
4
7 ###
0
4
8 ###
5
4
9 ###
40
4
10 ###
0
5
6 ###
0
5
7 ###
0
5
8 ###
0
5
9 ###
0
5
10 ###

Cost
1000
1500
1700
1400
1200
20
17
13
25
33
8
21
42
12
37
21
10
31
24
40
42
31
4
14
32
12
24
14
7
12
37
40
32
12
10

Node Data and Balance Constr

Num. Name
1
S1
2
S2
3
S3
4
S4
5
S5
6
D1
7
D2
8
D3
9
D4
10
D5
Side Constraints
zk-uk*yk<0
-10
3E-011
###
-35
###

Comp. Time 00:07

Status Optimal

de Data and Balance Constraints

Fixed Balance
0 2E-009
0
0
0
0
0
0
0 ###
-30
0
-40 1E-008
-50
0
-35
0
-40
0
Constraints

Transportation Model
5780
25
1
1
1
1
1
100

Name:LocTrans
Type: Trans
Goal: Min
Change
Objective: 5780
ans+Fixed Cost 9880
Solve

Objective Term Solver:

Ship. Cost: 2215 Type:
Sup. Cost: 3565 Sens.:
Dem. Rev.:
0 nteger:
Side:

Excel Solver
Linear
No
No
Yes

Vary
Select the Relink Buttons command from the OR_MM menu before clicking
Vary
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 ###
0
80
33 ###
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
Name
1
S1
2
S2
3
S3
4
S4
5
S5

1
D1
8
21
42
12
37

2
D2
21
10
31
24
40

3
D3
42
31
4
14
32

Unit shipping cost

Customer
Warehous
1
2
1
8
21
2
21
10
3
42
31
4
12
24
5
37
40
Demand
30
40

3
42
31
4
14
32
50

4
D4
12
24
14
7
12

4
12
24
14
7
12
35

5
D5
37
40
32
12
10

5
37
40
32
12
10
40

y1
y2
y3
y4
y5

0-1 Var Fixed C

1 1000
### 1500
1 1700
1 1400
### 1200
Total
4100

MaximuFixed Variable
capacit cost
cost
80 1000
20
80 1500
17
80 1700
13
80 1400
25
80 1200
33

M menu before clicking a button.

Shipped

Side Constraints
1
-10
2 2E-011
3
0
4
-35
5 5E-015

Linear Model
62
14
1
1
0
1
100

Change

Name: Cover
Type: LP1
Goal: Min
Objective:
62

Solve

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary

Linear Obj. Coef.:

Constraints
Num. Name
1
Dev1
2
Dev2
3
Dev3
4
Dev4
5
Dev5
6
Dev6

Value
1
2
1
1
1
1

Rel.
>=
>=
>=
>=
>=
>=

RHS
1
1
1
1
1
1

Solver:
Type:
Sens.:
Side:
I-1
X1

I-2
X2
0
0
1

0
0
1

12

17

Dev1
Dev2
Dev3
Dev4
Dev5
Dev6

X7

I-4
X4
0 2E-016
0
0
1
1

1
0
1

X 13
1
0
1

13

24

25

0
0
0
0
1
0

1
1
1
0
0
0

0
1
0
1
0
1

I-6
X6
0
0
1

10

13

17

Linear Constraint Coefficients

1
0
0
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
0

0
0
0
0
0
1

13

Partitioning Solution

1
0
1

I-5
X5

Comp. Time

1
0
1

Covering Solution
X5

I-3
X3

Excel Solver
Linear-Integer
No
No

X1

Dev1
Dev2
Dev3
Dev4
Dev5
Dev6

1
0
1

X5
1
0
1

X 10
1
0
1

12

13

38

1
0
0
0
0
0

0
0
0
0
1
0

0
1
1
1
0
1

Comp. Time 00:04

Status Optimal
I-7
X7

I-8
X8

I-9
X9

I-10
I-11
I-12
I-13
I-14
X 10
X 11
X 12
X 13
X 14
0 1E-011
0
0
1
0
0
0
0
0
0
0
1
1
1
1
1
1

1
0
1

0
0
1

24

24

60

38

27

45

25

35

1
1
1
0
0
0

1
0
1
1
0
0

0
1
1
1
1
1

0
1
1
1
0
1

0
0
1
1
1
0

1
1
0
0
1
1

0
1
0
1
0
1

1
0
0
1
1
0

63

Linear Model
63
36
1
1
1
1
1
100

Change

Name:
Type:
Goal:
Objective:

TSP
LP1
Min
63

Solver:
Type:
Sens.:
Side:

Solve

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Linear Obj. Coef.:
Rel.
=
=
=
=
=
=
=
=
=
=
=
=
<=

Comp. Time

I-1
I-2
I-3
I-4
I-5
I-6
x1-1
x1-2
x1-3
x1-4
x1-5
x1-6
0
0
0
1 1E-013
0
0
0
0
0
0
0
1
1
1
1
1
1

Vary

Constraints
Num. Name Value
1
Leave1
1
2
Leave2
1
3
Leave3
1
4
Leave4
1
5
Leave5
1
6
Leave6
1
7
Enter1
1
8
Enter2
1
9
Enter3
1
10
Enter4
1
11
Enter5
1
12
Enter6
1
13
ST1
2

Excel Solver
Linear-Integer
No
No

1000

RHS
1
1
1
1
1
1
1
1
1
1
1
1
2

1
2
3
4
5
6

16

30

26

Linear Constraint Coefficients

1
1
1
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
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
0
1
0
1

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

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

5
30
30
5
18
1000
5

6
26
25
0
18
5
1000

1
1000
7
20
21
12
23

27

2
27
1000
13
16
46
5

43

3
43
16
1000
25
27
5

4
16
1
35
1000
48
9

Comp. Time 00:08

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-025
0
0
0
0 1E-013
0
0
1 4E-028
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

30

25

20

13

1000

35

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

0
1
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
1
0
0
0
0
0
0
0
1
0
0
1

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

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

0
0
1
0
0
0
1
0
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
1
0
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
1
0
0

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

Solutions
1
x1-4

x1-4

x2-1

x3-5

x4-2

x5-6

x6-3

z
54

x2-1

x3-5

x4-3

x5-6

x6-2

63

Subtours
x1-4
x4-2

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 ###
0 ###
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

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

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

0
0
0
1
0
0
0
0
1
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
0
1
0
0

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

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

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

0
0
0
0
1
0
0
0
1
0
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
1
0
0

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

x2-1

x3-5

x5-6

x6-3

Subtour Elimination Constraint

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-013
0
0
0
0
0
0
0
0
1
1
1
1
1
1

23

1000

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

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

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

0
0
0
0
0
1
0
0
0
1
0
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
1
0

Transportation Model
63
36
1
0
1
0
1
100

Change

Name:TSP_Trans
Type: Trans
Goal: Min
Objective:
63

Solve
Vary
Vary
Trans. Flows
1
Name
D1
1
S1
0
2
S2
1
3
S3
0
4
S4
0
5
S5
6E-012
6
S6
0
Demand
Min.:
1
Data
Max:
1
Revenue:
0
Received:
1
Trans. Costs
Name
1
S1
2
S2
3
S3
4
S4
5
S5
6
S6

1
D1
1000
7
20
21
12
23

2
D2

3
D3
0
0
0 4E-012
0
0
0
1
0
0
1 1E-013
1
1
1
1
0
0
1
1

2
D2
27
1000
13
16
46
5

3
D3
43
16
1000
25
27
5

Objective Term Solver: Excel Solver

Ship. Cost:
63 Type: Linear
Sup. Cost:
0 Sens.: No
Dem. Rev.:
0 nteger: No
Side: Yes

4
D4

5
D5

6
D6

1
0
0
###
0
0
0
1 6E-012
0 6E-012
0
0
0
1
0
0
0
1
1
1
1
1
1
0
0
0
1
1
1
4
D4
16
1
35
1000
48
9

5
D5
30
30
5
18
1000
5

Supply Data
Min.
Max.
1
1
1
1
1
1
1
1
1
1
1
1

6
D6
26
25
0
18 z
5
1000

Cost
0
0
0
0
0
0

Solution 1
S1-D4
S4-D2
S2-D1
S3-D5
S5-D6
S6-D3
54
Subtour
ConstraConst
1
2
2 6E-012

Comp. Time 00:08

Status Optimal

Shipped
1
1
1
1
1
1

Solution 2
S1-D2
S2-D4
S4-D5
S5-D1
S3_D6
S6D3
63
Lim
2
1

Solution 3
S1-D4
S4-D3
S3-D5
S5-D6
S6-D2
S2-D1
Tour
63

Linear Model
42
36
1
1
1
1
0
1
100

Change

Name:
Type:
Goal:
Objective:

MST
LP1
Min
42

Solver:
Type:
Sens.:
Side:

Solve

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Linear Obj. Coef.:
Rel.
>=
=
=
=
=
=
<=
<=
<=
<=

Comp. Time

I-1
I-2
I-3
I-4
I-5
I-6
x1-1
x1-2
x1-3
x1-4
x1-5
x1-6
0
0
0 4E-011
0
1
0
0
0
0
0
0
1
1
1
1
1
1

Vary

Constraints
Num. Name Value
1
Leave1
1
2
Enter2
1
3
Enter3
1
4
Enter4
1
5
Enter5
1
6
Enter6
1
7
ST1
1
8
ST2
1
9
ST3
1
10
ST4
1

Excel Solver
Linear-Integer
No
No

1000

RHS
1
1
1
1
1
1
1
2
1
2

16

30

26

Linear Constraint Coefficients

1
1
1
1
0
1
0
0
0
0
1
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
0

1
0
0
0
1
0
0
0
0
0

1
0
0
0
0
1
0
0
0
0

Solutions
1
x1-4

27

43

x3-6

x6-2

x6-3

x6-5

z
31

x1-4

x3-5

x5-6

x6-2

x6-3

36

x1-4

x5-6

x6-2

x6-3

x6-5

36

x1-4

x2-3

x3-6

x6-2

x6-5

42

x1-6

x2-4

x6-2

x6-3

x6-5

42

Comp. Time 00:10

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-011
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

30

25

20

13

1000

35

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
1

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
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

0
0
1
0
0
0
0
0
0
0

0
0
0
1
0
0
0
0
0
0

0
0
0
0
1
0
0
1
0
0

0
0
0
0
0
1
1
0
0
1

Subtours
x3-6
x6-3
x3-5

x5-6

x5-6

x6-5

x2-3

x3-6

ST1
x6-3

x6-2

No Subtours. Optimal Solution

Subtour Elimination Constraint

x3-6
x6-3
1

ST2

x3-5

x5-6

x6-3

ST3

x5-6

x6-5

ST4

x2-3

x3-6

x6-2

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

Constraint

21

16

25

1000

18

18

12

46

27

48

1000

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
1
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

0
0
1
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
1
0
1
1
0

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

1000

0
0
0
0
0
0
0
0
0
0

0
1
0
0
0
0
0
0
0
1

0
0
1
0
0
0
1
1
0
0

0
0
0
1
0
0
0
0
0
0

0
0
0
0
1
0
0
0
1
0

0
0
0
0
0
1
0
0
0
0

Linear Model
130
36
1
1
0
100

Change

Name:
Type:
Goal:
Objective:

SPT
LP1
Min
130

Solve

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary

Linear Obj. Coef.:

Constraints
Num. Name Value
1
Cons2
-1
2
Cons3
-1
3
Cons4
-1
4
Cons5
-1
5
Cons6
-1

Rel.
=
=
=
=
=

RHS
-1
-1
-1
-1
-1

Solver:
Type:
Sens.:
Side:

Excel Solver
Linear
No
No

Comp. Time

1
2
3
4
5
6
x1-1
x1-2
x1-3
x1-4
x1-5
x1-6
0
1
0
1
1
2
0
0
0
0
0
0
100
100
100
100
100
100
1000

27

43

16

30

26

Linear Constraint Coefficients

0
-1
0
0
0
0
-1
0
0
0
0
-1
0
0
0
0
0
0
0
0

0
0
0
-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

30

25

20

13

1000

35

1
0
0
0
0

1
0
0
0
0

1
-1
0
0
0

1
0
-1
0
0

1
0
0
-1
0

1
0
0
0
-1

0
1
0
0
0

-1
1
0
0
0

0
1
0
0
0

0
1
-1
0
0

0
1
0
-1
0

0
1
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

0
0
1
0
0

-1
0
1
0
0

0
-1
1
0
0

0
0
1
0
0

0
0
1
-1
0

0
0
1
0
-1

0
0
0
1
0

-1
0
0
1
0

0
-1
0
1
0

0
0
-1
1
0

0
0
0
1
0

0
0
0
1
-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

1000

0
0
0
0
1

-1
0
0
0
1

0
-1
0
0
1

0
0
-1
0
1

0
0
0
-1
1

0
0
0
0
1

Network Model
130
36
1
0
100

Change

Name:SPT_Net
Type: Net
Goal: Min
Objective:
130

Solver:
Type:
Sens.:
Side:

Excel Solver
Linear
No
No

Solve
Vary
Vary
Arc Data and Flows
Num. Name Flow Origin Term.
1
x1-1
0
1
1
2
x1-2
1
1
2
3
x1-3
0
1
3
4
x1-4
1
1
4
5
x1-5
1
1
5
6
x1-6
2
1
6
7
x2-1
0
2
1
8
x2-2
0
2
2
9
x2-3
0
2
3
10
x2-4
0
2
4
11
x2-5
0
2
5
12
x2-6
0
2
6
13
x3-1
0
3
1
14
x3-2
0
3
2
15
x3-3
0
3
3
16
x3-4
0
3
4
17
x3-5
0
3
5
18
x3-6
0
3
6
19
x4-1
0
4
1
20
x4-2
0
4
2
21
x4-3
0
4
3
22
x4-4
0
4
4
23
x4-5
0
4
5
24
x4-6
0
4
6
25
x5-1
0
5
1
26
x5-2
0
5
2
27
x5-3
0
5
3
28
x5-4
0
5
4
29
x5-5
0
5
5
30
x5-6
0
5
6
31
x6-1
0
6
1
32
x6-2
0
6
2
33
x6-3
1
6
3
34
x6-4
0
6
4
35
x6-5
0
6
5
36
x6-6
0
6
6

Cost
1000
27
43
16
30
26
7
1000
16
1
30
25
20
13
1000
35
5
0
21
16
25
1000
18
18
12
46
27
48
1000
5
23
5
5
9
5
1000

Node Data and Balance Constraints

Num. Name Fixed
1
N1
5
2
N2
-1
3
N3
-1
4
N4
-1
5
N5
-1
6
N6
-1

Comp. Time 00:08

Status Optimal

and Balance Constraints

Balance
3E-011
###
###
###
###
###

Linear Model
64
10
1
1
1
0
100

Change

Name: Cutting
Type: LP1
Goal: Min
Objective:
64

Solve

Solver:
Type:
Sens.:
Side:

Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:

I-1
X1
21
0
40

Linear Obj. Coef.:

Vary

Constraints
Num. Name
1
L17
2
L15
3
L12
4
L8
5
L5

Value
21
25
30
35
40

Rel.
>=
>=
>=
>=
>=

RHS
20
25
30
35
40

I-2
X2

Excel Solver
Linear-Integer
No
No

Comp. Time

0
0
40

I-3
X3
11
0
40

I-4
X4
14
0
40

I-5
X5
15
0
40

I-6
X6

Linear Constraint Coefficients

1
1
0
0
0
0
1
1
0
0
0
0
1
0
1
0
0
1
0
2

0
0
2
0
0

0
0
1
1
1

0
0
40

Comp. Time 00:13

Status Optimal
I-7
X7

I-8
X8

I-9
X9

I-10
X 10
0
3
0
0
40
40

0
0
40

0
0
40

0
0
1
0
2

0
0
0
3
0

0
0
0
2
1

0
0
0
1
4

Non_Lin_Coef

Table 2 Product Data

Profit per unit for sales less
than 30
Profit per unit for sales
between 30 and 60
Profit per unit for sales
between 60 and 100
Max. Sales

Sales

$60

40

20

45

60

70

35
100

65
100

20
100

0
10
20
30
40
50
60
70
80
90
100

0
600
1200
1800
2250
2700
3150
3500
3850
4200
4550

R
0
400
800
1200
1800
2400
3000
3650
4300
4950
5600

0
200
400
600
1300
2000
2700
2900
3100
3300
3500

Profit

6000
5000
4000

P
Q

3000

R
2000
1000

Sales

Page 68

Non_Lin_Coef

30
60

600
600
600
450
450
450
350
350
350
350

P
Q
R

Sales

Page 69

Linear Model

Name:Non_Lin
Type: LP1
Goal: Max
Objective: 7268

7268
15
Change
1
1
Solve
1
Variables
0
Name:
Vary
1
Values:
1
Change RelationLower Bounds:
1
Upper Bounds:
1
1
Linear Obj. Coef.:
100 Constraints
Num.
Name
Value
Rel.
RHS
1
MachA
2400 <=
2400
2
MachB
2400 <=
2400
3
MachC
2285 <=
2400
4
MachD
1064 <=
2400
5
LinkP
###
=
0
6
LinkQ
0
=
0
7
LinkR
0
=
0
8
Q1_lower 16.36 >=
0
9
Q2_lower
0 >=
0
10 Q2_upper
0 <=
0
11 Q3_upper
0 <=
0
12 R1_lower
0 >=
0
13 R2_upper
0 <=
0
14 R3_upper
-40 <=
0

Solver:
Type:
Sens.:
Side:
I-1
yQ2

I-2
yQ3

I-3
YR2

Excel Solver
Linear-Integer
No
No

0
0
1

0
0
1

4
5
P
Q
1 81.82 16.36
0
0
0
1
100
100

Linear Constraint
0
0
0
0
0
0
0
0
0
0
0
0
0
0
-30
0
0
-30
-30
0
0
-40
0
0
0
0
0
0

Comp. Time

6
R
60
0
100

Coefficients
0
20
0
12
0
15
0
10
0
-1
0
0
0
0
0
0
0
0
0
0
0
0
-30
0
-30
0
-40
0

10
28
6
15
0
-1
0
0
0
0
0
0
0
0

10
16
16
0
0
0
-1
0
0
0
0
0
0
0

Comp. Time 00:09

Status Optimal
7
P1
30
0
30

8
9
10
P2
P3
Q1
30 21.82 16.36
0
0
0
30
40
30

11
Q2

12
Q3
0
0
###

13
R1
30
0
30

14
R2
30
0
###

0
0
###

15
R3
0
0
###

60

45

35

40

60

65

20

70

20

0
0
0
0
1
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
0
1
0
0
0
0
0
0
0
0
0

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

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

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

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

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

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