Optimality conditions for a cone-convex programming problem
- 1 March 1979
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 27 (2) , 141-162
- https://doi.org/10.1017/s1446788700012064
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 X into Rm and is B-concave, X is 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.Keywords
This publication has 7 references indexed in Scilit:
- Lagrangean conditions and quasidualityBulletin of the Australian Mathematical Society, 1977
- Characterization of optimality in convex programming without a constraint qualificationJournal of Optimization Theory and Applications, 1976
- A Course on Optimization and Best ApproximationLecture Notes in Mathematics, 1972
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theoryJournal of Mathematical Analysis and Applications, 1969
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach SpaceSIAM Journal on Control, 1969
- The various definitions of the derivative in linear topological spacesRussian Mathematical Surveys, 1968