The Haar Condition in Vector Optimization

Abstract

In this paper the Haar condition which is well known in approximation theory is defined for vector optimization problems. Under suitable assumptions it can be proven that this condition is sufficient for the efficiency of a point satisfying the F. John conditions of the Chebyshev compromise program. If the Haar condition is not satisfied, the efficiency of such a point can only be proven under strong convexity and regularity assumptions.