1. ISEN 601 Location Logistics
Dr. Gary M. Gaukler
Fall 2011

2. Single Facility, Euclidean Distances
Total cost function:
Properties:

3. Single Facility, Euclidean Distances
First order conditions:

4. Single Facility, Euclidean Distances
Iterative procedure:

5. Single Facility, Euclidean Distances
When do we stop iterating?

6. Single Facility, Euclidean Distances

7. Single Facility, Euclidean Distances

8. Single Facility, Euclidean Distances

9. Single Facility, Euclidean Distances

10. Single Facility, Euclidean Distances
Convex Hull property:

11. Single Facility, Euclidean Distances
Convex Hull property:

12. Single Facility, Euclidean Distances
Perturbed distance function:

13. Minimax Single Facility Model
Idea:
Applications:

14. Minimax with Euclidean Distances
Also known as Circle Covering Problem:

15. Minimax with Euclidean Distances
Mathematical formulation:
Alternative formulation:

16. Algebraic Solution of Minimax
Recall problem formulation:

17. Algebraic Solution of Minimax
Equivalent problem:

18. Algebraic Solution of Minimax
Equivalent problem: