An Inner Approximation of the Minimal Point Set

by    Kristin Winkler

Preprint series: 07-05 , Reports on Optimization and Stochastics

MSC:
90C29 Multi-objective and goal programming; vector optimization
46B42 Banach lattices, See also {46A40, 46B40}
49M99 None of the above but in this section

Abstract: In this paper, we consider an approximation of the ordering cone by a sequence of convex well-based cones that are contained inside the original cone. We derive related results on approximating minimal point sequences and propose a density result being evocative of the well-known ABB theorem.

Keywords: vector optimization, partially ordered linear spaces, approximating cones, density, ABB-Theorem

Upload: 2007-01-30


The author(s) agree, that this abstract may be stored as full text and distributed as such by abstracting services.