Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T14:14:43.291Z Has data issue: false hasContentIssue false

Optimality conditions for a cone-convex programming problem

Published online by Cambridge University Press:  09 April 2009

Hélène M. Massam
Affiliation:
Department of MathematicsUniversity of Toronto, Toronto, Canada
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1979