Hostname: page-component-5c6d5d7d68-pkt8n Total loading time: 0 Render date: 2024-08-16T15:09:25.407Z Has data issue: false hasContentIssue false
  • English
  • Français

A Fritz John type sufficient optimality theorem in complex space

Published online by Cambridge University Press:  17 April 2009

T.R. Gulati
T.R. Gulati
Affiliation:
Department of Mathematics, Indian Institute of Technology, Hauz Khas, New DelhiIndia.
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.

A Fritz John type sufficient optimality theorem is proved for nonlinear programming problems in finite dimensional complex space over polyhedral cones, which may include equality as well as inequality constraints.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 11 , Issue 2 , October 1974 , pp. 219 - 224
Copyright
Copyright © Australian Mathematical Society 1974

References

[1]Abrams, Robert A., “Nonlinear programming in complex space: sufficient conditions and duality”, J. Math. Anal. Appl. 38 (1972), 619–632.CrossRefGoogle Scholar
[2]Abrams, Robert A. and Ben-Israel, Adi, “Nonlinear programming in complex space: necessary conditions”, SIAM J. Control 9 (1971), 606–620.CrossRefGoogle Scholar
[3]Ben-Israel, Adi, “Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory”, J. Math. Anal. Appl. 27 (1969), 367–389.CrossRefGoogle Scholar
[4]Ben-Israel, A., “Theorems of the alternative for complex linear inequalities”, Israel J. Math. 7 (1969), 129–136.CrossRefGoogle Scholar
[5]Craven, B.D. and Mond, B., “A Fritz John theorem in complex space”, Bull. Austral. Math. Soc. 8 (1973), 215–220.CrossRefGoogle Scholar
[6]Craven, B.D. and Mond, B., “Real and complex Fritz John theorems”, J. Math. Anal. Appl. 44 (1973), 773–778.CrossRefGoogle Scholar