The essence of invexity
- 407 Downloads
The convex case corresponds of course to η(x, u)≡x−u; but, as Hanson showed, invexity is sufficient to imply both weak duality and that the Kuhn-Tucker conditions are sufficient for global optimality.
It is shown here that elementary relaxations of the conditions defining invexity lead to modified invexity notions which are both necessary and sufficient for weak duality and Kuhn-Tucker sufficiency.
Key WordsInvexity convex mathematial programs Kuhn-Tucker conditions weak duality
Unable to display preview. Download preview PDF.
- 1.Hanson, M. A.,On Sufficiency of the Kuhn-Tucker Conditions, Journal of Mathematical Analysis and Applications, Vol. 80, pp. 545–550, 1981.Google Scholar
- 2.Craven, B. D.,Duality for Generalized Convex Fractional Programs, Generalized Concavity in Optimization and Economics, Edited by S. Schaible and W. T. Ziemba, Academic Press, New York, New York, 1981.Google Scholar
- 3.Craven, B. D.,Invex Functions and Constrained Local Minima, Bulletin of the Australian Mathematical Society, Vol. 24, pp. 357–366, 1981.Google Scholar
- 4.Hanson, M. A., andMond, B.,Further Generalizations of Convexity in Mathematical Programming, Journal of Information and Optimization Sciences, Vol. 3, pp. 25–32, 1982.Google Scholar
- 5.Craven, B. D., andGlover, B. M.,Invex Functions and Duality, Journal of the Australian Mathematical Society, Series A (to appear).Google Scholar
- 6.Hanson, M. A., andMond, B.,Necessary and Sufficient Conditions for Global Optimality and Constrained Optimization, Florida State University, Tallahassee, Florida, FSU Statistics Report No. M-600, 1981.Google Scholar
- 7.Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.Google Scholar