Sect.
1
PQR
PQR_Sens
PQR_S
4
PQ
PQ_Sens
PQ2
6
Prod
Res_Al
Res_Al_Sens
Mix
Mix_Sens
CarRent
CarRent_Sens
Agg
Agg_Sens
Power
Power_Sens
Sup.
Chem
Chem_Sens
Page 1
Instructions
Chapter 2 Examples
Operations Research Models and Methods
Paul A. Jensen and Jonathan F. Bard
http://www.me.utexas.edu/~jensen/ORMM/computation/unit/mp_add/index.html
http://www.me.utexas.edu/~jensen/ORMM/methods/unit/linear/subunits/teach/index.html
Instructions
To use this workbook, you must first load the Math Programming add-in. See the Excel help file
topic "About add-ins" before continuing.
For cases using the LP/IP Solver you must first load the Jensen LP/IP Solver.
This workbook comes without control buttons. To make the buttons choose Add Buttons from
the Math
This to
adds
buttons
to all the
worksheets.
When
youProgramming
are moving amenu.
workbook
another
computer,
use
the Remove Buttons command.
This simplifies opening the workbook on the other computer. Buttons are removed from all
worksheets.
Solution Characteristics
The Manufacturing Example in Two Variables
Sensitivity Analysis
The Manufacturing Example in Two Variables with market constraints explicit
Problem Classes
Resource Allocation Problem with ranges identified
Resource Allocation Problem
Sensitivity Analysis
Blending or Mixing Problem
Sensitivity Analysis
Car Rental Problem
Sensitivity Analysis
Aggregate Planning Problem
Sensitivity Analysis
Network Flow Programming Problem
Sensitivity Analysis
Page 2
Instructions
Add-ins Used
Math Programming - Linear-LP/IP Solver
Math Programming - Linear-LP/IP Solver
Math Programming - Linear/Excel Solver
Math Programming - Linear-LP/IP Solver
Math Programming - Linear-LP/IP Solver
Math Programming - Linear-LP/IP Solver
Math
Math
Math
Math
Math
Math
Math
Math
Math
Math
Math
Programming
Programming
Programming
Programming
Programming
Programming
Programming
Programming
Programming
Programming
Programming
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Linear-LP/IP
Solver
Solver
Solver
Solver
Solver
Solver
Solver
Solver
Solver
Solver
Solver
Page 3
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name:
Type:
Goal:
Objective:
PQR
LP1
Max
7664
Solve
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary
Rel.
<=
<=
<=
<=
RHS
2400
2400
2400
2400
Solver:
Type:
Sens.:
Side:
1
2
P
Q
81.82 16.36
0
0
100
40
45
60
Jensen LP/IP
Linear
Yes
No
3
R
60
0
60
50
Ph. 1 Iter.
Total Iter.
Comp. Time
Ph. 1 Iter.
0
Total Iter.
4
Comp. Time 00:01
Status Optimal
Objective Value:
Statu
s
Basic
Basic
Upper
###
Objective
Coefficient
0
45
0
60
10.4545
50
Range
Lower
Limit
25.7143
22.5
39.5455
Range
Upper
Limit
83.3333
83
---
Shadow
Constraint
Price
Limit
1.2273
2,400
1.7045
2,400
0
2,400
0
2,400
Range
Lower
Limit
###
2,040
###
###
Range
Upper
Limit
###
2,920
-----
Reduced
Cost
Constraint Analysis
Statu
s
Upper
Upper
Upper
Upper
Adjustable Cells
Cell
Name
$H$8 Values: P
$I$8 Values: Q
$J$8 Values: R
Final
Reduced
Objective Allowable Allowable
Value
Cost
Coefficient Increase
Decrease
81.8181818
0
45 38.3333333 19.2857143
16.3636364
0
60
23
37.5
60 10.4545455
50 1.000E+030 10.4545455
Constraints
Cell
Name
$D$15 MachA Valu
$D$16 MachB Valu
$D$17 MachC Valu
$D$18 MachD Valu
Final
Shadow
Constraint Allowable Allowable
Value
Price
R.H. Side
Increase
Decrease
2400 1.22727273
2400 144.827586 866.666667
2400 1.70454545
2400
520
360
2285.45455
0
2400 1.000E+030 114.545455
1063.63636
0
2400 1.000E+030 1336.36364
Linear Model
7664
3
1
1
1
100
Change
Name: PQR_S
Type: LP1
Goal: Max
Objective: 7664
Solve
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary
Rel.
<=
<=
<=
<=
RHS
2400
2400
2400
2400
Solver:
Type:
Sens.:
Side:
1
2
P
Q
81.82 16.36
0
0
100
40
45
60
Excel Solver
Linear
Yes
No
3
R
60
0
60
50
Comp. Time
Adjustable Cells
Cell
Name
$H$8 Values: P
$I$8 Values: Q
$J$8 Values: R
Final
Reduced
Objective Allowable Allowable
Value
Cost
Coefficient Increase
Decrease
81.8181818
0
45 38.3333333 19.2857143
16.3636364
0
60
23
37.5
60 10.4545455
50 1.000E+030 10.4545455
Constraints
Cell
Name
$D$15 MachA Valu
$D$16 MachB Valu
$D$17 MachC Valu
$D$18 MachD Valu
Final
Shadow
Constraint Allowable Allowable
Value
Price
R.H. Side
Increase
Decrease
2400 1.22727273
2400 144.827586 866.666667
2400 1.70454545
2400
520
360
2285.45455
0
2400 1.000E+030 114.545455
1063.63636
0
2400 1.000E+030 1336.36364
Linear Model
1
0
1
0
0
100
100
0
100
Change
Name:PQ_Web
Type: LP1
Goal: Max
Objective: 6300
Solve
Solver:
Type:
Sens.:
Side:
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
1
P
100
0
100
45
Vary
Constraints
Num. Name
1
A
2
B
3
C
4
D
Value
1800
2400
1650
1150
Rel.
<=
<=
<=
<=
RHS
2400
2400
2400
2400
Jensen LP/IP
Linear
Yes
No
2
Q
30
0
50
60
Ph. 1 Iter.
Total Iter.
Comp. Time
Ph. 1 Iter.
0
Total Iter.
3
Comp. Time 00:01
Status Optimal
Objective Value:
Statu
Num. Name Value
s
1
P
100 Upper
2
Q
30 Basic
Reduced
Objective
Cost
Coefficient
15
45
0
60
6,300
Range
Lower
Limit
30
0
Range
Upper
Limit
--90
Constraint Analysis
Statu
s
Basic
Upper
Basic
Basic
Shadow
Price
0
2
0
0
Constraint
Limit
2,400
2,400
2,400
2,400
Range
Lower
Limit
1,800
1,500
1,650
1,150
Range
Upper
Limit
--3,000
-----
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name:
Type:
Goal:
Objective:
PQ
LP1
Max
4664
Solve
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary
Rel.
<=
<=
<=
<=
RHS
1800
1440
2040
2400
Solver:
Type:
Sens.:
Side:
Jensen LP/IP
Linear
Yes
No
1
2
P
Q
81.82 16.36
0
0
100
40
45
60
Ph. 1 Iter.
Total Iter.
Comp. Time
Ph. 1 Iter.
0
Total Iter.
3
Comp. Time 00:00
Status Optimal
Objective Value:
Statu
Num. Name Value
s
1
P
### Basic
2
Q
### Basic
###
Objective
Coefficient
0
45
0
60
Range
Lower
Limit
25.7143
22.5
Range
Upper
Limit
120
105
Shadow
Constraint
Price
Limit
1.2273
1,800
1.7045
1,440
0
2,040
0
2,400
Range
Lower
Limit
933.3333
1,080
###
###
Range
Upper
Limit
###
1,960
-----
Reduced
Cost
Constraint Analysis
Statu
s
Upper
Upper
Basic
Basic
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name:
Type:
Goal:
Objective:
PQ2
LP1
Max
4664
Solve
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary
Rel.
<=
<=
<=
<=
<=
<=
RHS
1800
1440
2040
2400
100
40
Solver:
Type:
Sens.:
Side:
Jensen LP/IP
Linear
No
No
1
2
P
Q
81.82 16.36
0
0
9999 9999
45
60
Ph. 1 Iter.
Total Iter.
Comp. Time
Ph. 1 Iter.
0
Total Iter.
3
Comp. Time 00:00
Status Optimal
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name:
Type:
Goal:
Objective:
Prod
LP1
Max
2989
Solve
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary
Value
160
200
120
280
Rel.
<=
<=
<=
<=
RHS
160
200
120
280
Solver:
Type:
Sens.:
Objective Funct Side:
Jensen LP/IP
Linear
No
No
1
2
3
4
5
P1
P2
P3
P4
P5
58.96 62.63
0 10.58 15.64
0
0
0
0
0
99999 99999 99999 99999 99999
18
12
15
0.5
1
0.8
0.6
Constraint Values
Constraint Names
Constraint Limits
Constraint Relationships
25
10
Ph. 1 Iter.
Total Iter.
Comp. Time
Ph. 1 Iter.
0
Total Iter.
5
Comp. Time 00:00
Status Optimal
Variable Names
Simple Lower Bounds
Simple Upper Bounds
Objective Coefficients
Constraint Coefficients
Linear Model
0
0
1
0
0
100
100
0
60
Change
Solve
Vary
Name: Mix
Type: LP2
Goal: Min
Objective: 49.16
Solver:
Type:
Sens.:
Side:
Variables
Name:
Values:
Lower Bounds:
Upper Bounds:
1
2
3
L
C
S
0.028 0.649 0.323
0
0
0
1
1
1
10
30.5
Jensen LP/IP
Linear
Yes
No
90
Ph. 1 Iter.
Total Iter.
Comp. Time
Ph. 1 Iter.
1
Total Iter.
3
Comp. Time 00:01
Status Optimal
Objective Value:
49.1563
Objective
Coefficient
0
10
0
30.5
0
90
Range
Lower
Limit
--24.4
30.4459
Range
Upper
Limit
17.439
90.2116
123.8889
Statu Shadow
Constraint
Num. Name Value
s
Price
Limit
1 Calcium0.012 Upper -19.6167
0.012
2 Protein 0.22 Lower 145.1698
0.22
3
Fiber ### Basic
0
0.05
4 Conserve
1Equality 17.4543
1
Range
Lower
Limit
0.008
0.0874
0.0388
0.4693
Range
Upper
Limit
0.2137
0.2963
--1.2876
Statu
s
Basic
Basic
Basic
Reduced
Cost
Constraint Analysis
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name: Res_Al
Type: LP1
Goal: Max
Objective: 2989
Solve
Variables
Name:
Values:
Vary
Solver:
Type:
Sens.:
Side:
1
2
P1
P2
58.96 62.63
3
P3
Jensen LP/IP
Linear
Yes
No
4
5
P4
P5
0 10.58 15.64
Change Relation
Value
160
200
120
280
Rel.
<=
<=
<=
<=
RHS
160
200
120
280
18
25
10
12
15
0.5
1
0.8
0.6
Ph. 1 Iter.
Total Iter.
Comp. Time
Ph. 1 Iter.
0
Total Iter.
5
Comp. Time 00:01
Status Optimal
Objective Value:
Statu
s
Basic
Basic
Lower
Basic
Basic
###
Objective
Coefficient
18
25
10
12
15
Range
Lower
Limit
13.2552
23.8437
--11.29
9.9091
Range
Upper
Limit
24.8066
41.8158
23.5303
17.9222
15.3631
Shadow
Constraint
Price
Limit
4.8195
160
5.2016
200
8.9635
120
0.3631
280
Range
Lower
Limit
99.3485
184.6901
101.1299
259.3189
Range
Upper
Limit
172.9961
230.3636
237.505
295.6412
Reduced
Cost
0
0
-13.5303
0
0
Constraint Analysis
Statu
s
Upper
Upper
Upper
Upper
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name: CarRent
Type: LP1
Goal: Min
Objective: 2150
Solve
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary
Value
5
5
10
5
16
7
11
Rel.
>=
>=
>=
>=
>=
>=
>=
RHS
2
5
10
3
16
7
11
Solver:
Type:
Sens.:
Side:
Jensen LP/IP
Linear
Yes
No
Ph. 1 Iter.
Total Iter.
Comp. Time
1
Sat
2
Sun
3
M
4
Tu
5
W
6
Th
0
0
###
0
0
###
5
0
###
0
0
###
9
0
100
0
0
100
35
35
50
50
50
50
0
0
0
0
1
0
0
0
0
0
0
0
1
0
Ph. 1 Iter.
7
Total Iter. 10
Comp. Time 00:01
Status Optimal
7
F
8
9
10
11
12
13
MTuW TuWTh WThF Weekend
Weekday Week
4
0
0
2
0
0
5
0
0
0
0
0
0
0
100 ### ### ### ### ###
100
50
125
125
125
60
180
200
0
0
0
0
0
0
1
0
0
1
1
1
0
0
0
0
0
1
1
1
0
0
0
0
0
1
1
1
1
1
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
1
1
1
1
Objective Value:
Statu
s
Lower
Lower
Basic
Lower
Basic
Lower
Basic
Lower
Lower
Basic
Lower
Lower
Basic
Reduced
Objective
Cost
Coefficient
35
35
10
35
0
50
50
50
0
50
25
50
0
50
25
125
50
125
0
125
35
60
5
180
0
200
2,150
Range
Lower
Limit
0
25
40
0
25
25
25
100
75
115
25
175
175
Range
Upper
Limit
----55
--75
--75
----130
----210
Constraint Analysis
Num.
1
2
3
4
5
6
7
Name Value
Sat
5
Sun
5
Mon
10
Tues
5
Wed
16
Thurs
7
Fri
11
Statu
s
Basic
Lower
Lower
Basic
Lower
Lower
Lower
Shadow
Price
0
25
50
0
50
25
50
Constraint
Limit
2
5
10
3
16
7
11
Range
Lower
Limit
---
Range
Upper
Limit
3
5
--7
5
7
5
7
--5
107
11
107
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name:
Type:
Goal:
Objective:
Agg
LP1
Min
###
Solve
Solver:
Type:
Sens.:
Side:
Jensen LP/IP
Linear
Yes
No
Ph. 1 Iter.
Total Iter.
Comp. Time
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
1
P1
1350
0
###
2
P2
1400
0
###
3
P3
1000
0
###
4
P4
550
0
###
5
P5
1700
0
###
6
P6
2000
0
###
100
105
110
115
110
110
0
0
0
0
1
0
0
0
0
0
0
1
Vary
Constraints
Num. Name
1
M1
2
M2
3
M3
4
M4
5
M5
6
M6
Value
1300
1400
1000
800
1700
1900
Rel.
=
=
=
=
=
=
RHS
1300
1400
1000
800
1700
1900
Ph. 1 Iter.
6
Total Iter.
9
Comp. Time 00:01
Status Optimal
7
I0
200
200
200
8
I1
250
0
250
9
I2
250
0
250
10
I3
250
0
250
1
0
0
0
0
0
-1
1
0
0
0
0
0
-1
1
0
0
0
11
I4
12
I5
0
0
250
0
0
250
13
I6
100
100
100
0
0
-1
1
0
0
0
0
0
-1
1
0
0
0
0
0
-1
1
0
0
0
0
0
-1
Objective Value:
Statu
s
Basic
Basic
Basic
Basic
Basic
Basic
Upper
Upper
Upper
Upper
Lower
Lower
Upper
Reduced
Cost
0
0
0
0
0
0
-96
-1
-1
-1
9
4
110
Objective
Coefficient
100
105
110
115
110
110
4
4
4
4
4
4
0
866,050
Range
Lower
Limit
4
104
109
114
106
0
---------5
0
---
Range
Upper
Limit
101
106
111
--119
114
100
5
5
5
-----110
Constraint Analysis
Statu Shadow
Constraint
Num. Name Value
s
Price
Limit
1
M1 1,300Equality
100
1,300
2
M2 1,400Equality
105
1,400
3
M3 1,000Equality
110
1,000
4
M4
800Equality
115
800
5
M5 1,700Equality
110
1,700
6
M6 1,900Equality
110
1,900
Range
Lower
Limit
-50
0
0
250
0
-100
Range
Upper
Limit
-------------
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name: Power
Type: LP1
Goal: Min
Objective: 48313
Solve
Variables
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Vary
Value
###
0
###
-25
-50
-30
Rel.
=
=
=
=
=
=
RHS
0
0
0
-25
-50
-30
Solver:
Type:
Sens.:
Side:
1
PA
0
0
100
2
PB
17.5
0
75
3
PC
100
0
100
500
475
400
Jensen LP/IP
Linear
Yes
No
Ph. 1 Iter.
Total Iter.
Comp. Time
4
xAB
5
xAC
6
xBA
0
0
###
0
0
###
0
0
###
1
0
-0.95
0
0
0
-0.95
1
0
0
0
0
Ph. 1 Iter.
6
Total Iter. 10
Comp. Time 00:01
Status Optimal
7
xBC
8
xCA
0 16.67
0
0
### ###
9
xCB
10
yAX
0
0
###
11
yAZ
0 15.83
0
0
### ###
12
yBY
0
0
###
13
14
15
yBZ
yCX
yCY
17.5 27.78 55.56
0
0
0
### ### ###
0
1
-0.95
0
0
0
-0.95
0
1
0
0
0
0
-0.95
1
0
0
0
1
0
0
-0.9
0
0
1
0
0
0
0
-0.9
0
1
0
0
-0.9
0
0
1
0
0
0
-0.9
0
0
1
-0.9
0
0
0
0
1
0
-0.9
0
Num.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
Name
PA
PB
PC
xAB
xAC
xBA
xBC
xCA
xCB
yAX
yAZ
yBY
yBZ
yCX
yCY
Value
0
17.5
100
0
0
0
0
###
0
0
###
0
17.5
###
###
Objective Value:
Statu
s
Lower
Basic
Upper
Lower
Lower
Lower
Lower
Basic
Lower
Lower
Basic
Lower
Basic
Basic
Basic
48,312.5
Reduced
Objective
Cost
Coefficient
25
500
0
475
-51.25
400
23.75
0
46.3125
0
23.75
0
46.3125
0
0
0
0
0
23.75
0
0
0
23.75
0
0
0
0
0
0
0
Range
Lower
Limit
475
421.0526
---23.75
-46.3125
-23.75
-46.3125
-23.75
0
-23.75
-25
-23.75
0
-----
Range
Upper
Limit
--500
451.25
--------0
----0
--25
23.75
23.75
Shadow
Constraint
Price
Limit
-475
0
-475
0
-451.25
0
-501.3889
-25
-501.3889
-50
-527.7778
-30
Range
Lower
Limit
-15.8333
-57.5
-16.6667
-40
-65
-81.75
Range
Upper
Limit
17.5
17.5
18.4211
-8.4211
-33.4211
-14.25
Constraint Analysis
Statu
Num. Name Value
s
1
A
0Equality
2
B
0Equality
3
C
0Equality
4
X
0Equality
5
Y
0Equality
6
Z
0Equality
Linear Model
1
0
1
0
0
100
100
0
60
Change
Solve
Vary
Name: Chem
Type: LP2
Goal: Max
Objective: ###
Solver:
Type:
Sens.:
Side:
Variables
Name:
Values:
Lower Bounds:
Upper Bounds:
0
0
###
-4
Constraints
Num. Name Value Lower Upper
1
A_CON
0
0
0
2
B_CON ###
0
0
3
C_CON
0
0
0
4 M1_CONI ###
0
0
5 M1_CONO
3E-012
0
0
6 M2_CONI
0
0
0
7 M2_CONO
9E-012
0
0
8
X_CON
0
0
0
9
Y_CON 5E-012
0
0
10 Z_CON
0
0
0
11 YB_CON
0
0
0
12
AM1% 833.3
0 ###
13
BM1%
###
0 ###
14
BM2%
0
0
0
15
XM1%
###
0
0
16
YM%
###
0
0
17
YM2%
0
0
0
18
ZM2%
###
0
0
19
ZLIM
9286 1000 ###
20 Con 20 5000 ### 10000
1
A
Jensen LP/IP
Linear
Yes
No
2
3
4
B
C
M1
5000 16071 7143
0
0
0
5000 ### 10000
-3
-1
Ph. 1 Iter.
Total Iter.
Comp. Time
5
6
AM1
BM1
1548 357.1
0
0
### ###
-1
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
-1
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
Ph. 1 Iter. 22
Total Iter. 24
Comp. Time 00:02
Status Optimal
7
CM1
5238
0
###
8
XM1
5000
0
###
9
10
11
YM1
WM1
M2
1429 714.3 15476
0
0
0
### ### ###
12
13
BM2
CM2
4643 10833
0
0
### ###
14
YM2
4643
0
###
15
16
ZM2 AOM2
9286 1548
0
0
### ###
0
0
-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
1
0
0
0
0
0
0
1
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
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
0
0
0
0
0
0
-0.3
0
0
-0.3
-0.6
0
0
0
-1
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
-1
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
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
-1
0
0
1
0
0
0
0
0
0
0
1
0
0
17
X
5000
0
5000
18
Y
6071
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
0
0
0
0
0
0
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
19
Z
9286
0
###
20
Y1
500
0
500
21
Y2
5571
0
###
10
11
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
0
0
-1
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
Num.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
Name
A
B
C
M1
AM1
BM1
CM1
XM1
YM1
WM1
M2
BM2
CM2
YM2
ZM2
AOM2
X
Y
Z
Y1
Y2
Value
0
5,000
###
###
###
###
###
5,000
###
###
###
###
###
###
###
###
5,000
###
###
500
###
Objective Value:
Statu
s
Lower
Upper
Basic
Basic
Basic
Basic
Basic
Basic
Basic
Basic
Basic
Basic
Basic
Basic
Basic
Basic
Upper
Basic
Basic
Upper
Basic
Reduced
Objective
Cost
Coefficient
-3
-4
23
-3
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
0
0
4.0714
5
0
0
0
10
3
11
0
8
###
Range
Lower
Limit
---26
-4
-2.85
-69
-57
-2.9483
-4.0714
-14.25
-28.5
-6.9
-23
-9.8571
-23
-11.5
-69
0.9286
-19
-1.5
8
-11
Range
Upper
Limit
-1
------3
25
69
------17.1
57
24.4286
57
28.5
171
----38.5
--11
Constraint Analysis
Range
Statu Shadow
Constraint
Lower
Num. Name Value
s
Price
Limit
Limit
1 A_CON
0Equality
-1
0
###
2 B_CON
0Equality
-26
0
###
3 C_CON
0Equality
-1
0
###
4 M1_CONI
0Equality
-1
0
###
5 M1_CONO
0Equality
0
0
--6 M2_CONI
0Equality
-1
0
###
7 M2_CONO
0Equality
-1
0
###
8 X_CON
0Equality
-0.9286
0
###
9 Y_CON
0Equality
-8
0
--10 Z_CON
0Equality
-10
0
--11 YB_CON
0Equality
-8
0
--12 AM1% ### Basic
0
0
--13 BM1%
0 Lower
-25
0 -357.1429
14 BM2%
0Equality
-25
0
###
15 XM1%
0Equality
0.9286
0
-2,000
16 YM%
0Equality
8
0
###
17 YM2%
0Equality
7
0
###
Range
Upper
Limit
833.3333
2,500
----714.2857
--833.3333
2,000
###
###
###
833.3333
2,500
2,500
625
714.2857
833.3333
18 ZM2%
0Equality
19 ZLIM ### Basic
20 Con 205,000 Basic
9
0
0
0
1,000
10,000
###
--5,000
833.3333
###
---
Objective Value:
Statu
s
Basic
Basic
Lower
Basic
Basic
Lower
Reduced
Cost
0
0
0
0
0
0
Objective
Coefficient
1
1
1
1
1
1
1
0
1
0
1
0
Constraint
Limit
4
8
10
7
12
4
26
Range
Lower
Limit
Range
Upper
Limit
0
0
1
1
1
1
1
1
--1
1
---
Constraint Analysis
Num.
1
2
3
4
5
6
Name Value
D0
4
D4
14
D8
10
D12
8
D16
12
D20
4
Statu
s
Lower
Basic
Lower
Basic
Lower
Lower
Shadow
Price
Range
Lower
Limit
0
Range
Upper
Limit
---
---
---
14
---
8
11
0
--5
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name:
Type:
Goal:
Objective:
Solve
Bus
LP1
Min
26
Variables
Name:
Values:
Vary
Solver:
Type:
Sens.:
Side:
1
x0
4
2
x4
10
3
x8
Jensen LP/IP
Linear
Yes
No
4
x12
Ph. 1 Iter.
Total Iter.
Comp. Time
5
x16
6
x20
0
0
0
0
1
1
1
0
0
0
0
1
Change Relation
Value
4
14
10
8
12
4
Rel.
>=
>=
>=
>=
>=
>=
RHS
4
8
10
7
12
4
Ph. 1 Iter.
7
Total Iter.
7
Comp. Time 00:00
Status Optimal
Linear Model
1
0
1
0
0
100
100
0
60
Change
Name:Dist1_LP
Type: LP1
Goal: Min
Objective: 5300
Solve
Variables
Vary
Name:
Values:
Lower Bounds:
Change Relation
Upper Bounds:
Linear Obj. Coef.:
Constraints
Num. Name
1
Phoe
2
Chi
3
LA
4
Dal
5
Atl
6
NY
7
Aus
8
Gain
Value
700
-200
-200
-300
-150
-250
200
200
Rel.
=
=
=
=
=
=
=
=
RHS
700
-200
-200
-300
-150
-250
200
200
Solver:
Type:
Sens.:
Side:
1
2
3
4
5
6
7
Phoe- Phoe- Phoe- Phoe- Dal- Dal- DalChi
LA
Dal
Atl
LA
Chi
NY
200 200 200 100
0
0
50
0
0
0
0
0
0
0
200 200 200 200 200 200 200
6
0
0
-1
1
0
0
0
0
0
-1
0
1
0
0
0
0
0
0
0
1
0
-1
0
0
12
17
###
Optimal
8
9
10
11
12
13
14
15
16
17
Dal- AtlAtlAtl- Aus- Aus- Aus- Gain- Gain- GainAtl
NY
Dal
Chi
LA
Dal
Atl
Dal
Atl
NY
50
0
0
0
0 200
0
0
0 200
0
0
0
0
0
0
0
0
0
0
200 200 200 200 200 200 200 200 200 200
2
0
0
0
1
-1
0
0
0
0
0
0
0
1
-1
0
0
0
0
0
-1
1
0
0
0
0
-1
0
0
1
0
0
0
0
0
-1
0
0
0
1
0
0
0
0
-1
0
0
1
0
0
0
0
0
-1
0
1
0
0
0
0
-1
0
0
0
1
0
0
0
0
-1
0
0
1
0
0
0
0
0
-1
0
1
Network Model
1
0
1
0
0
100
100
0
60
0
0
0
Change
Name: Dist1
Type: Net
Goal: Min
Objective: 5300
Solver:
Type:
Sens.:
Side:
Jensen Network
Linear
No
No
Solve
Vary
Arc Data and Flows
Num. Name Flow Origin Term. Lower Upper
1 Phoe-Chi 200
1
2
0
200
2
Phoe-LA
200
1
3
0
200
3 Phoe-Dal 200
1
4
0
200
4 Phoe-Atl
100
1
5
0
200
5
Dal-LA
0
4
3
0
200
6
Dal-Chi
0
4
2
0
200
7
Dal-NY
50
4
6
0
200
8
Dal-Atl
50
4
5
0
200
9
Atl-NY
0
5
6
0
200
10
Atl-Dal
0
5
4
0
200
11
Atl-Chi
0
5
2
0
200
12 Aus-LA
0
7
3
0
200
13 Aus-Dal
200
7
4
0
200
14 Aus-Atl
0
7
5
0
200
15 Gain-Dal
0
8
4
0
200
16 Gain-Atl
0
8
5
0
200
17 Gain-NY
200
8
6
0
200
Cost
6
3
3
7
5
4
6
2
5
2
4
7
2
5
6
4
7
Gain Flow_O
1
200
1
200
1
200
1
100
1
0
1
0
1
50
1
50
1
0
1
0
1
0
1
0
1
200
1
0
1
0
1
0
1
200
en Network
Flow_O
Ph. 1 Iter.
2
Total Iter.
11
Comp. Time 00:01
Status Optimal