On Generalized Constrained Optimization and Separation Theorems

Abstract

In this paper a generalized format for a constrained extremum problem is considered. Subsequently, the paper investigates and deepens some aspects concerning the linear separation between two sets in the Euclidean space, that are a convex cone and a generic set. A condition equivalent to their linear separation is given. Moreover, a condition equivalent to regular linear separation is proposed; this condition includes also the nonconvex case and it is finalized to the application to the generalized constrained extremum problems.