Optimality Conditions for A Cone-Convex Programming Problem

Abstract

Optimality conditions without constraint qualifications are given for the convex programming problem: Maximize f(x) such that g(x) є B, where F maps x into R and is concave, g maps A” into Rm and is B-concave, Xis a locally convex topological vector space and B is a closed.convex cone containing no line. In the case when B is the nonnegative orthant, the results reduce to some of those obtained recently by Ben-Israel, Ben-Tal and Zlobec. © 1979, Australian Mathematical Society. All rights reserved.