## Error bounds for the approximative solution of restricted planar location problems

• Facility location problems in the plane play an important role in mathematical programming. When looking for new locations in modeling real-word problems, we are often confronted with forbidden regions, that are not feasible for the placement of new locations. Furthermore these forbidden regions may habe complicated shapes. It may be more useful or even necessary to use approcimations of such forbidden regions when trying to solve location problems. In this paper we develop error bounds for the approximative solution of restricted planar location problems using the so called sandwich algorithm. The number of approximation steps required to achieve a specified error bound is analyzed. As examples of these approximation schemes, we discuss round norms and polyhedral norms. Also computational tests are included.

Author: Stefan Nickel, Barbara Käfer urn:nbn:de:hbz:386-kluedo-4586 Report in Wirtschaftsmathematik (WIMA Report) (17) Preprint English 1999 1999 Technische Universität Kaiserslautern 2000/04/03 Applications; Approximation ; Forbidden Regions ; Global Optimization ; Location Theory Fachbereich Mathematik 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$