Faculty Publications

On A Constrained Optimal Location Algorithm

Document Type

Conference

Keywords

Chebyshev center, Constrained approximation, Symmetric hull

Journal/Book/Conference Title

Journal of Computational Analysis and Applications

Volume

5

Issue

1

First Page

119

Last Page

127

Abstract

In problems of optimal location, one seeks a position or location that optimizes a particular objective function; this objective function typically relates location and distances to a fixed point set. When one's search is restricted to a given set, we refer to this as a constrained optimal location problem. For a finite point set A, there exist numerous finite algorithms to solve optimal location problems. In this paper we demonstrate how an algorithm, solving optimal location problems in inner-product spaces, can be modified to solve certain constrained optimal location problems. We then apply this modification to a particularly simple (and easily implemented) algorithm and investigate the complexity of the result. In particular we improve a known estimate from exponential to polynomial.

Department

Department of Mathematics

Original Publication Date

1-1-2003

DOI of published version

10.1023/A:1021482206911

Link to Full Text

Comments?

Share

COinS