Optimizing ordered median functions with applications to single facility location
This paper considers the problem of minimizing the ordered median function of finitely many rational functions over compact semi-algebraic sets. Ordered median of rational functions are not, in general, neither rational functions nor the supremum of rational functions.We prove that the problem can be transformed into a new problem embedded in a higher dimension space where it admits a convenient representation. This reformulation admits a hierarchy of SDP relaxations that approximates, up to any degree of accuracy, the optimal value of those problems. We apply this general framework to a broad family of continuous location problems solving some difficult problems.
KeywordsRational Function Demand Point Ordered Weight Average Median Function Convenient Representation
Unable to display preview. Download preview PDF.
- 1.Blanco V., El-Haj Ben-Ali S. and Puerto J. (2011). A Semidefinite Programming approach for minimizing ordered weighted averages of rational functions. arXiv:1106.2407v2.Google Scholar
- 2.Drezner Z. and Nickel S. (2009). Solving the ordered one-median problem in the plane. European J. Oper. Res., 195 no. 1, 46–61.Google Scholar
- 5.Nickel S. and Puerto J. (2005). Facility Location - A Unified Approach. Springer Verlag. 6. Ogryczak W. and Śliwiński T. (2010). On solving optimization problems with ordered average criteria and constraints. Stud. Fuzziness Soft Comput. Springer, Berlin, 254, 209–230.Google Scholar
- 10.Yager R. and Kacprzyk J. (1997). The Ordered Weighted Averaging Operators: Theory and Applications, Kluwer: Norwell, MA.Google Scholar