Summer 2021 ISE3214 – Exam 1 Topics and Preparation
This is a closed notes, closed book exam except for:
A stand-alone calculator (no phones or similar devices)
Only 1 “workout problem” for which it will be helpful to have a spare sheet of paper handy.
Facilities Planning and Supply Chain – Know the purpose and process
Distance Measures – Know the formulas and when to apply each
Single-Facility Models
Discrete – weighted scoring
Continuous -
1. Rectilinear Minisum
2. Euclidean Minisum
3. Rectilinear Minimax
a. You don’t need to memorize the formulas (i.e., c1 to c5), if needed they will
be provided to you
4. Euclidean Minimax
a. You won’t need to draw circles but you will need to know and understand
the process
For each model type
identify when applicable
solve with appropriate algorithm
understand unique characteristics of solutions – e.g. critical customers, median
condition, shape of coverag area, when you’ve reached optimality
Multi-Facility Models
Continuous - Minisum Rectilinear - location allocation heuristic
Discrete - Integer Programming Model with multiple stages (e.g. Plants and Warehouses)
You will not be asked to create an entire model but you will need to understand the
elements and parts of the model
Page 2 of 8
Version 1
Practice Problems
The PQR Auto Parts Company has 12 retail stores in the city of Springdale. The PQR Company
is planning to build a new warehouse to service its retail stores. The location of the stores and the
expected deliveries per week from the warehouse to the store are given below.
Store Location Expected
Deliveries
1 (4,2) 1
2 (4,5) 1
3 (5,2) 1
4 (5,1) 1
5 (2,2) 3
6 (2,3) 5
7 (2,4) 6
8 (2,5) 2
9 (1,0) 4
10 (0,1) 1
11 (0,3) 2
12 (3,2) 3
Solve the single facility problem with each scenario of objectives and distance measures.
a. Solve as rectilinear MiniSum – solve the problem with the half-sum algorithm
(check answer with solver)
b. Solve as rectilinear MiniMax - find the solution with the linear programming-
based algorithm (calculating the c-values).
c. Solve as Euclidean MiniSum –find the solution with the iterative algorithm that
searches for the point where partials are both near zero.
d. Solve as Euclidean MiniMax with Excel Solver and determine the critical
customers.
e. Solve as a location-allocation problem with rectilinear distance and MiniSum
objective, assuming two new facilities are needed.
Rectilinear Minisum
DC X Y Min z= 59.0
locatio
n 2 3
Euclidean Minisum
X Y z
2.00 3.00 48.56
Page 3 of 8
Version 1
Rectilinear Minimax
Z 4
(X1,
Y1) 2.5 2.5
(X2,
Y2) 3 2
Euclidean Minimax
X Y z
2.60223 2.39776
9 1 2.95
Page 4 of 8
Version 1
Previous Exam Questions
If you are solving a minimax rectilinear single-facility location problem with two customers, the
optimal solution will always be which of the following? Drawings are encouraged.
A)A point, instead of a 45-degree line
B) A 45-degree line, like usual
C) Either a 45-degree line or a point, depending on the location of the customers
D)A rectangular area with the customer locations at opposite corners of the rectangle
E) VT-shaped
Point if customers are in same x or y axis, 45-degree line otherwise
Grading – partial credit for A and B if also includes drawings or argument that demonstrates
understanding.
Page 5 of 8
Version 1
If you have three customers with different weights, w 1 , w 2 ,∧w 3 located along a line in a
rectilinear mini-sum single-facility location problem, which scenario will guarantee that the
lowest-weighted customer’s location corresponds to the optimal facility location? Select one
answer.
A) If that customer is at one end, but next to the highest-weighted customer
B) If that customer is in the middle and the distance to the middle-weighted customer is
less than half the distance to the highest-weight customer
C) If that customer is in the middle and neither of the other two customers have a weight
greater than or equal to ∑ wi /2
i
D) None of the above (it can never be guaranteed)
C is correct
Page 6 of 8
Version 1
Coffee stands are planned to be placed in an office building. The office tenants are located at P1 (20,70),
P2 (30,40), P3 (90,30) and P4 (50,100). Fifty persons per day are expected to visit the first office, 30 the
second office, 70 the third office and 60 the last office. Assume 70% of visitors are expected to drop by
the coffee stand. Each unit distance which a customer has to travel costs the owner of the coffee shops the
loss of $0.25 in revenue. The fixed daily cost of n shops is $ 3000 n. Assume the optimal location for a
single stand is (50,70). Determine if the investor open one or two stands with a clear, and accurate,
argument.
4
The objective function is ¿+ operating=3000 n+ ∑ 0.25 ( 0.7 ) wi d i
i=1
Where w i=¿ number of people at office i AND d i=¿ distance from officei to closest coffee stand
One stand at (50,70) costs $ 3000+$ 0.25 ( 0.70 ) [ ( 50 )( 30 ) + ( 30 ) ( 50 ) + ( 70 ) ( 80 ) + ( 60 ) ( 30 ) ] =3000+1820 .
The greatest cost reduction that could be achieved with a second stand is $1820, which does not outweigh
the fixed costs of $3000.
Page 7 of 8
Version 1
Consider the customers (A-H) their locations and weights as shown in the graph.
9
B-4 C-2 G-8
8
F-3
7
A-5
6
5 E-6
4 D-2
3
2
1 H-4
1 2 3 4 5 6 7 8 9
Find the rectilinear mini-max solution. Provide both the coordinates for the facility and the z-value.
Rectilinear Single-Facility Minimax
customer i ai bi a+b -a+b
A 1 6 7 5
B 0 9 9 9
C 3 8 11 5
green solutions contribute to
D 3 4 7 1
solution - however either A or
E 5 4 9 -1 D are needed, not both
F 5 7 12 2
G 7 8 15 1 Could remove:
H 9 2 11 -7 C,E,F, and A or D
c1 7
c2 15
c3 -7
c4 9
c5 16
z= 8
X* Y*
7
Page 8 of 8
Version 1
1 7 8
2 3 4
What happens to the optimal solution if customers C, A, and D are all removed? Address both the
change, or lack of change, for both the z-value and optimal (x,y) solution locations.
C is meaningless – it can be removed without consequence to z or line.
If either customer A or D is removed the solution is unchanged.
If both A and D are removed, the z-value is unchanged, because it is still constrained by
B and H. However, the endpoint of the line changes from (7,8) to (8,9) because A or D
were both forcing the limit on the end of the line at (7,8)
