A framework for demand point and solution space aggregation analysis for location models

Many location problems can be formulated as minimizing some location objective function subject to upper bounds on other location constraint functions. When such functions are subadditive and nondecreasing in the distances (a common occurrence), worst-case demand point aggregation error bounds are k...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2004-12, Vol.159 (3), p.574-585
Main Authors: Francis, R.L, Lowe, T.J, Tamir, A, Emir-Farinas, H
Format: Article
Language:English
Subjects:
Aggregation error
Covering
Demand points
K-centers
Location
Location analysis
Mathematical models
Optimization
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Many location problems can be formulated as minimizing some location objective function subject to upper bounds on other location constraint functions. When such functions are subadditive and nondecreasing in the distances (a common occurrence), worst-case demand point aggregation error bounds are known. We show how to solve a relaxation and a restriction of the aggregated problem in such a way as to obtain lower and upper bounds on the optimal value of the original problem. We consider some applications to covering and related problems.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(03)00433-8