What'sBest! 11.1.0.8 (Nov 20, 2012) - Library 7.0.1.

518 - 32-bit - Status Report DATE GENERATED: Feb 17, 2013 12:26 PM

MODEL INFORMATION: CLASSIFICATION DATA Current Capacity Limits -------------------------------------------------------Total Cells 1364 Numerics 1232 Adjustables 247 300 Continuous 198 Free 0 Integers/Binaries 0/49 30 Constants 846 Formulas 139 Strings 0 Constraints 132 150 Nonlinears 0 30 Coefficients 1080 Minimum Minimum Maximum Maximum coefficient coefficient coefficient coefficient value: in formula: value: in formula: 1 on Model!E77 Model!E77 10000 on <RHS> Model!E138

MODEL TYPE: OBJECTIVE VALUE: DIRECTION: SOLVER TYPE: TRIES: INFEASIBILITY: BEST OBJECTIVE BOUND: STEPS: ACTIVE: SOLUTION TIME:

Mixed Integer / Linear . . . . . . . . . 0 0 . . . 0 0 0 Hours 0 Minutes 0 Seconds

ERROR / WARNING MESSAGES: ***ERROR*** Integer Cells Limit (Help Reference: LICCAP3): The number of integer cells in this model: 49 exceeds the limit of: 30 The model has more integer cells than is allowed by your installation. You will need to either reduce the size of your model or upgrade to a

larger version. ***WARNING*** Unsupported external value or range in the Name list (Help Reference: NAME): Check name, value, or the validity of the link. Name will be taken as a 0 number. Name: WBMIN ***WARNING*** No Best Cell (Help Reference: NOBEST): Either no cell has been specified to be maximized or minimized, or the cell that is marked is not a function of any Adjustable cells. If this is an optimization model, use the Best command or the Minimize or Maximize toolbar button to specify a best cell as the objective of the optimization. This warning can be turned off via the WB|Options|General menu. End of Report

BASIC NETWORK

INPUTS
A 0 7 4 5 12 7 14 DEMANDS Node A B C D E F G Demand 100 200 120 45 250 80 75 B 7 0 11 12 5 14 11 DISTANCES C 4 11 0 7 16 3 11 D 5 12 7 0 15 5 9

A B C D E F G

COVER DIST CoverDist

NUMBER 2 SITE Number2Locate 2 MAX ALLOWABLE DISTANCE

MaxAllowableDist

100

MAX UNCOVERED DEMAND MaxUncovered 10000

OBJECTIVE FUNCTIONS
Min Min # needed Uncovered Demand Dem Wtd Dist+ weight*(Max dist) Avg Dist Maximum Distance +weight*(Avg dist) weight 42002 Locate at

420

Min

5455.0 6.27

Min

12.00 0.0001

DECISION VARIABLES
A 0 #NAME? 0 LOCATION VARIABLES B C D 0 0 0 #NAME? #NAME? #NAME? 0 0 0

Used to force sites For labels

A B C D E F G

A 0 0 0 0 0 0 0

ASSIGNMENT VARIABLES B C D 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 MAXIMUM DISTANCE

MaxDist

12

CONSTRAINTS

Number located 2

NUMBER TO LOCATE Number to Locate #NAME? 2

Node A B C D E F G

EACH NODE ASSIGNED Times Assigned 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME?

1 1 1 1 1 1 1

# Assigned # avail

A 0 #NAME? 0

ONLY TO OPEN SITES B C D 0 0 0 #NAME? #NAME? #NAME? 0 0 0

Node A B C D E F G

DEFINE MAX DISTANCE Assigned dist 12 #NAME? 5 #NAME? 12 #NAME? 9 #NAME? 0 #NAME? 12 #NAME? 6 #NAME?

12 12 12 12 12 12 12

MaxDist 12

CONSTRAIN MAX DISTANCE MaxAllowableDist #NAME? 100

CONSTRAIN UNCOVERED DEMAND uncovered 420 allowed 10000

#NAME?

COMPUTED MATRICES
A 1 0 COVERAGE MATRIX B C D 0 1 1 1 0 0

A B

C D E F G

1 1 0 0 0

0 0 1 0 0

1 0 0 1 0

0 1 0 1 0

A B C D E F G

A 0 200 0 0 250 80 75

UNCOVERED DEMAND B C D 100 0 0 0 200 200 120 0 120 45 45 0 0 250 250 80 0 0 75 75 75 DEMAND*DISTANCE B C D 700 400 500 0 2200 2400 1320 0 840 540 315 0 1250 4000 3750 1120 240 400 825 825 675

A B C D E F G

A 0 1400 480 225 3000 560 1050

S E 12 5 16 15 0 14 6 F 7 14 3 5 14 0 8 G 14 11 11 9 6 8 0

E, G

S
E 1 #NAME? 0 E, F 0 #NAME? 0 G 1 #NAME? 0 G,

ABLES

RIABLES E 1 1 0.2 0 1 0.66666667 1 F 0 0 0 0 0 0 0 G 0 0 0.8 1 0 0.333333 0

ANCE

SITES E 4.86666667 #NAME? 7 F G 0 2.133333 #NAME? #NAME? 0 7

S
E 0 1 F 0 0 G 0 0

ATRIX

0 0 1 0 0

1 1 0 1 0

0 0 0 0 1

EMAND E 100 0 120 45 0 80 75 F 100 200 0 0 250 0 75 G 100 200 120 45 250 80 0

ANCE E 1200 1000 1920 675 0 1120 450 F 700 2800 360 225 3500 0 600 G 1400 2200 1320 405 1500 640 0

INPUTS
A 0 7 4 5 12 7 14 B 7 0 11 12 5 14 11 DISTANCES C D 4 5 11 12 0 7 7 0 16 15 3 5 11 9 E 12 5 16 15 0 14 6

A B C D E F G Coverage Distance

7 COVERAGE MATRIX C D 1 1 0 0 1 1 1 1 0 0 1 1 0 0

A B C D E F G

A 1 1 1 1 0 1 0

B 1 1 0 0 1 0 0

E 0 1 0 0 1 0 1

DECISION VARIABLES
A 1 #NAME? Used to force sites 0 For labels A, B 0 #NAME? 0 Location Variables C D 0 0 #NAME? #NAME? 0 0 E 0 #NAME? 0

A, G,

OBJECTIVE
Minimize # needed 2 Locate at A, G,

CONSTRAINTS
A B C D E F G Times covered 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? Required 1 1 1 1 1 1 1

F 7 14 3 5 14 0 8

G 14 11 11 9 6 8 0

X F 1 0 1 1 0 1 0 G 0 0 0 0 1 0 1

F 0 #NAME? 0

G 1 #NAME? 0 G,

INPUTS
A 0 7 4 5 12 7 14 B 7 0 11 12 5 14 11 Number to locate DISTANCES C D 4 5 11 12 0 7 7 0 16 15 3 5 11 9 E 12 5 16 15 0 14 6

A B C D E F G Coverage Distance

2 COVERAGE MATRIX C D 1 1 0 0 1 0 0 1 0 0 1 1 0 0

A B C D E F G

A 1 0 1 1 0 0 0

B 0 1 0 0 1 0 0

E 0 1 0 0 1 0 0

DECISION VARIABLES
A 0 #NAME? Used to force sites 0 For labels B 0 #NAME? 0 Location Variables C D 0 0 #NAME? #NAME? 0 0 E 0 #NAME? 0

Coverage Variables A B C D E F G 0 0 0 0 0 0 0

OBJECTIVE
Maximize Covered demand 0 Locate at

CONSTRAINTS
Number to Locate 0 #NAME? 2

A B C D E F G

Times covered Cov Variable 0 #NAME? 0 0 #NAME? 0 0 #NAME? 0 0 #NAME? 0 0 #NAME? 0 0 #NAME? 0 0 #NAME? 0

F 7 14 3 5 14 0 8

G 14 11 11 9 6 8 0

DEMANDS Node Demand A 100 B 200 C 120 D 45 E 250 F 80 G 75

X F 0 0 1 1 0 1 0 G 0 0 0 0 0 0 1

F 0 #NAME? 0

G 0 #NAME? 0

INPUTS
A 0 7 4 5 12 7 14 B 7 0 11 12 5 14 11 Number to locate DISTANCES C D 4 5 11 12 0 7 7 0 16 15 3 5 11 9 E 12 5 16 15 0 14 6

A B C D E F G

A B C D E F G

A 0 1400 480 225 3000 560 1050

B 700 0 1320 540 1250 1120 825

DISTANCES * DEMANDS C D 400 500 2200 2400 0 840 315 0 4000 3750 240 400 825 675

E 1200 1000 1920 675 0 1120 450

DECISION VARIABLES
A 0 =>= Used to force sites 0 For labels B 0 =>= 0 Location Variables C D 0 0 =>= =>= 0 0 E 0 =>= 0

G,

A B C D E F G

A 0 0 0 0 0 0 0

B 0 0 0 0 0 0 0

Assignment Variables C D 0 0 0 0 0 0 0 0 0 0 0 0 0 0

E 0 0 0 0 0 0 0

OBJECTIVE FUNCTION
Minimize DemWtdDist 7465 Locate at G,

CONSTRAINTS
# to Locate 1 <= 3 Required 1 1 1 1 1 1 1 C 0 =<= 0 D 0 =<= 0 E 0 =<= 0

A B C D E F G

Times Assigned 1 1 1 1 1 1 1 A 0 =<= 0

= = = = = = = B 0 =<= 0

F 7 14 3 5 14 0 8

G 14 11 11 9 6 8 0

DEMANDS Node Demand A 100 B 200 C 120 D 45 E 250 F 80 G 75

DS F 700 2800 360 225 3500 0 600 G 1400 2200 1320 405 1500 640 0

F 0 =>= 0

G 1 >= 0 G,

es F 0 0 0 0 0 0 0 G 1 1 1 1 1 1 1

F 0 =<= 0

G 7 =<= 7

INPUTS
A 0 7 4 5 12 7 14 B 7 0 11 12 5 14 11 Number to locate DISTANCES C D 4 5 11 12 0 7 7 0 16 15 3 5 11 9 E 12 5 16 15 0 14 6

A B C D E F G

DECISION VARIABLES
A 0 #NAME? Used to force sites 0 For labels B 0 #NAME? 0 Location Variables C D 0 0 #NAME? #NAME? 0 0 E 1 #NAME? 0 E,

E,

A B C D E F G

A 0 0 0 0 0 0 0

B 0 0 0 0 0 0 0

Assignment Variables C D 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Max Distance

E 1 1 1 1 1 1 1

CenterDist

16

Locate at E,

OBJECTIVE
Min Max Dist 16

OBJECTIVE
# to Locate 1 #NAME? 1 Required 1

Times Assigned 1 #NAME?

B C D E F G

1 1 1 1 1 1 A 0 #NAME? 0

#NAME? #NAME? #NAME? #NAME? #NAME? #NAME? B 0 #NAME? 0

1 1 1 1 1 1 C 0 #NAME? 0 D 0 #NAME? 0 E 7 #NAME? 7

A B C D E F G

Assigned Dist Center Distance 12 #NAME? 16 5 #NAME? 16 16 #NAME? 16 15 #NAME? 16 0 #NAME? 16 14 #NAME? 16 6 #NAME? 16

F 7 14 3 5 14 0 8

G 14 11 11 9 6 8 0

DEMANDS Node Demand A 100 B 200 C 120 D 45 E 250 F 80 G 75

F 0 #NAME? 0

G 0 #NAME? 0

es F 0 0 0 0 0 0 0 G 0 0 0 0 0 0 0

F 0 #NAME? 0

G 0 #NAME? 0

INPUTS
A 0 7 4 5 12 7 14 B 7 0 11 12 5 14 11 DISTANCES C D 4 5 11 12 0 7 7 0 16 15 3 5 11 9 DISTANCES * DEMANDS C D 400 500 2200 2400 0 840 315 0 4000 3750 240 400 825 675 FIXED COSTS C D 1400 800 E 12 5 16 15 0 14 6

A B C D E F G

A B C D E F G

A 0 1400 480 225 3000 560 1050

B 700 0 1320 540 1250 1120 825

E 1200 1000 1920 675 0 1120 450

Node Fixed cost

A 2000

B 1500

E 1800

DECISION VARIABLES
A 0 #NAME? Used to force sites 0 B, C, E, For labels B 1 #NAME? 0 B, Location Variables C D 1 0 #NAME? #NAME? 0 0 C, Assignment Variables C D 1 0 0 0 1 0 1 0 0 0 1 0 0 0 E 1 #NAME? 0 E,

A B C D E F G

A 0 0 0 0 0 0 0

B 0 1 0 0 0 0 0

E 0 0 0 0 1 0 1

OBJECTIVE FUNCTION
Fixed Cost Dem x Dist 4700 1405

Minimize

$/dem mile Total cost

2 7510

Locate at B, C, E,

CONSTRAINTS
A B C D E F G Times Assigned 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? 1 #NAME? A 0 #NAME? 0 B 1 #NAME? 7 Required 1 1 1 1 1 1 1 C 4 #NAME? 7 D 0 #NAME? 0 E 2 #NAME? 7

F 7 14 3 5 14 0 8

G 14 11 11 9 6 8 0

DEMANDS Node Demand A 100 B 200 C 120 D 45 E 250 F 80 G 75

DS F 700 2800 360 225 3500 0 600 G 1400 2200 1320 405 1500 640 0

F 2500

G 1300

F 0 #NAME? 0

G 0 #NAME? 0

es F 0 0 0 0 0 0 0 G 0 0 0 0 0 0 0

F 0 #NAME? 0

G 0 #NAME? 0