Further Generalizations of Convexity in Mathematical Programming
- 1 January 1982
- journal article
- research article
- Published by Taru Publications in Journal of Information and Optimization Sciences
- Vol. 3 (1) , 25-32
- https://doi.org/10.1080/02522667.1982.10698716
Abstract
The Kuhn-Tucker conditions for the existence of solutions to inequality constrained minimization problems are sufficient conditions when all the functions involved are convex. Various concepts such as pseudo-convexity and quasi-convexity have been introduced for the purpose of weakening this limitation of convexity in mathematical programming. Still wider classes of functions are introduced in this paper and applied in Kunh-Tucker theory and in duality theory.Keywords
This publication has 1 reference indexed in Scilit:
- On sufficiency of the Kuhn-Tucker conditionsJournal of Mathematical Analysis and Applications, 1981