YOU ARE DOWNLOADING DOCUMENT

Please tick the box to continue:

Transcript
Page 1: ISEN 601 Location Logistics

ISEN 601Location Logistics

Dr. Gary M. GauklerFall 2011

Page 2: ISEN 601 Location Logistics

Single Facility, Euclidean Distances• Total cost function:

• Properties:

Page 3: ISEN 601 Location Logistics

Single Facility, Euclidean Distances• First order conditions:

Page 4: ISEN 601 Location Logistics

Single Facility, Euclidean Distances• Iterative procedure:

Page 5: ISEN 601 Location Logistics

Single Facility, Euclidean Distances• When do we stop iterating?

Page 6: ISEN 601 Location Logistics

Single Facility, Euclidean Distances

Page 7: ISEN 601 Location Logistics

Single Facility, Euclidean Distances

Page 8: ISEN 601 Location Logistics

Single Facility, Euclidean Distances

Page 9: ISEN 601 Location Logistics

Single Facility, Euclidean Distances

Page 10: ISEN 601 Location Logistics

Single Facility, Euclidean Distances• Convex Hull property:

Page 11: ISEN 601 Location Logistics

Single Facility, Euclidean Distances• Convex Hull property:

Page 12: ISEN 601 Location Logistics

Single Facility, Euclidean Distances• Perturbed distance function:

Page 13: ISEN 601 Location Logistics

Minimax Single Facility Model

Idea:

Applications:

Page 14: ISEN 601 Location Logistics

Minimax with Euclidean Distances• Also known as Circle Covering Problem:

Page 15: ISEN 601 Location Logistics

Minimax with Euclidean Distances• Mathematical formulation:

• Alternative formulation:

Page 16: ISEN 601 Location Logistics

Algebraic Solution of Minimax• Recall problem formulation:

Page 17: ISEN 601 Location Logistics

Algebraic Solution of Minimax• Equivalent problem:

Page 18: ISEN 601 Location Logistics

Algebraic Solution of Minimax• Equivalent problem:


Related Documents