Generalized convexity in mathematical programming
- 17 April 1983
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 27 (2) , 185-202
- https://doi.org/10.1017/s0004972700025661
Abstract
The role of convexity in the development of mathematical programming is reviewed. Many recent generalizations of convexity and their applications to optimization theory are discussed.Keywords
This publication has 10 references indexed in Scilit:
- A note onK-convex functionsMathematical Methods of Operations Research, 1982
- Further Generalizations of Convexity in Mathematical ProgrammingJournal of Information and Optimization Sciences, 1982
- Invex functions and constrained local minimaBulletin of the Australian Mathematical Society, 1981
- On sufficiency of the Kuhn-Tucker conditionsJournal of Mathematical Analysis and Applications, 1981
- Strong pseudo-convex mappings in dual problemsMathematische Operationsforschung und Statistik. Series Optimization, 1981
- Mathematical Programming and Control TheoryPublished by Springer Nature ,1978
- On generalized means and generalized convex functionsJournal of Optimization Theory and Applications, 1977
- Solution of certain nonlinear programs involvingr-convex functionsJournal of Optimization Theory and Applications, 1973
- r-convex functionsMathematical Programming, 1972
- Seven Kinds of ConvexitySIAM Review, 1967