Article contents
A note on Fritz John sufficiency
Published online by Cambridge University Press: 17 April 2009
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.
An elementary proof is given of a sufficient optimality condition recently proven by B.D. Craven. This proof avoids the use of a transposition theorem and this allows for a strengthening of Craven's result.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 15 , Issue 2 , October 1976 , pp. 293 - 296
- Copyright
- Copyright © Australian Mathematical Society 1976
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]Craven, B.D., “Sufficient Fritz John optimal!ty conditions”, Bull. Austral. Math. Soc. 13 (1975), 411–419.CrossRefGoogle Scholar
[3]Craven, B.D. and Mond, B., “Real and complex Fritz John theorems”, J. Math. Anal. Appl. 44 (1973), 773–778.CrossRefGoogle Scholar
[4]Craven, B.D. and Mond, B., “A Fritz John theorem in complex space”, Bull. Austral. Math. Soc. 8 (1973), 215–220.CrossRefGoogle Scholar
[5]Gulati, T.R., “A Fritz John type sufficient optimality theorem in complex space”, Bull. Austral. Math. Soc. 11 (1974), 219–224.CrossRefGoogle Scholar
[6]John, Fritz, “Extremum problems with inequalities as subsiduary conditions”, Studies and essays presented to R. Courant on his 60th birthday, 187–204 (Interscience, New York, 1948).Google Scholar
- 3
- Cited by