Hostname: page-component-7479d7b7d-k7p5g Total loading time: 0 Render date: 2024-07-08T19:10:05.828Z Has data issue: false hasContentIssue false
  • English
  • Français

On a sufficient optimality condition over convex feasible regions

Published online by Cambridge University Press:  17 April 2009

C.D. Alders  and
V.A. Sposito
C.D. Alders
Affiliation:
Department of Statistics, Iowa State University, Ames, Iowa, USA.
V.A. Sposito
Affiliation:
Department of Statistics, Iowa State University, Ames, Iowa, USA.
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.

In this note a sufficient optimality condition is established for nonlinear programming problems over arbitrary cone domains. A Kuhn-Tucker type sufficient condition is established if the programming problem has a pseudoconvex objective function and a convex feasible region.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 16 , Issue 2 , April 1977 , pp. 199 - 202
Copyright
Copyright © Australian Mathematical Society 1977

References

[1]Borwein, J.M., “A note on Fritz John sufficiency”, Bull. Austral. Math. Soc. 15 (1976), 293–296.CrossRefGoogle Scholar
[2]Craven, B.D., “Sufficient Fritz John optimality conditions”, Bull. Austral. Math. Soc. 13 (1975), 411–419.CrossRefGoogle Scholar
[3]Craven, B.D. and Mond, B., “A Fritz John theorem in complex space”, Bull. Austral. Math. Soc. 8 (1973), 215–220.CrossRefGoogle Scholar
[4]Gulati, T.R., “A Fritz John type sufficient optimality theorem in complex space”, Bull. Austral. Math. Soc. 11 (1974), 219–224.CrossRefGoogle Scholar
[5]Mangasarian, Olvi L., Nonlinear programming (McGraw-Hill, New York, St. Louis, San Francisco, London, Sydney, Toronto, Mexico, 1969).Google Scholar
[6]Sposito, V.A., “Modified regularity conditions for nonlinear programming problems over mixed cone domains”, Math. Programming 6 (1974), 167–179.CrossRefGoogle Scholar
[7]Sposito, V.A., Linear and nonlinear programming (Iowa State University Press, Ames, 1975).Google Scholar
[8]Sposito, Vince A. and David, H.T., “Saddle-point optimality criteria of nonlinear programming problems over cones without differentiability”, SIAM J. Appl. Math. 20 (1971), 698–702.CrossRefGoogle Scholar