Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-28T13:41:55.499Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimality conditions for a cone-convex programming problem

Published online by Cambridge University Press:  09 April 2009

Hélène M. Massam
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

Secondary: 90C25: Convex programming
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 27 , Issue 2 , March 1979 , pp. 141 - 162
Copyright
Copyright © Australian Mathematical Society 1979

References

Averbukh, V. I. and Smolyanov, O. A. (1968), ‘The various definitions of the derivative in linear topological spaces’, Russian Math. Surveys 23, 67–114.CrossRefGoogle Scholar
Ben-Israel, A. (1969), ‘Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theory’, J. Math. Anal. Appl. 27, 367–389.Google Scholar
Ben-Israel, A., Ben-Tal, A. and Zlobec, S. (1976), ‘Optimality conditions in convex programming’, presented at the IX International Symposium on Mathematical Programming, Budapest, Hungary.Google Scholar
Ben-Tal, A., Ben-Israel, A., and Zlobec, S. (1976), ‘Characterization of optimality in convex programming without a constraint qualification’, J. Optimization Theory Appl. 20, 417–437.Google Scholar
Ben-Tal, A. and Zlobec, S. (1975), ‘A new class of feasible direction methods’, Research Report CCS 216, Center for Cybernetic Studies, The University of Texas, Austin, Texas.Google Scholar
Craven, B. D. (1974), ‘A transposition theorem, applied to convex programming in Banach spaces’, Mathematics Department, University of Melbourne, Australia, 1974.Google Scholar
Craven, B. D. (1977), ‘Lagrangean condition and quasiduality’, Bull. Austral. Math. Soc. 16, 325–339.CrossRefGoogle Scholar
Girsanov, I. V. (1970), Lectures on mathematical theory of extremum problems, No. 67 (Springer-Verlag, Berlin).Google Scholar
Guignard, M. (1969), ‘Generalized Kuhn-Tucker conditions for mathematical programming problems in Banach spaces’, SIAM J. Control Optimization 7, 232–241.Google Scholar
Holmes, R. B. (1972), A course on optimization and best approximation,Lecture notes in mathematics, No. 257 (Springer-Verlag, Berlin).CrossRefGoogle Scholar
Kuhn, H. W. and Tucker, A. W. (1951), ‘Nonlinear programming’, Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, edited by Neyman, J., University of California, Berkeley, California.Google Scholar
Mangasarian, O. L. (1969), Nonlinear programming (McGraw-Hill, New York).Google Scholar
Massam, H. M. (1977), Convex programming with cones (Ph.D. Thesis, McGill University, Monteral, Quebec, Canada).Google Scholar
Rockafellar, R. T. (1970), Convex analysis (Princeton University Press, Princeton, New Jersey).CrossRefGoogle Scholar