Convexlike alternative theorems and mathematical programming
- 1 January 1985
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 16 (5) , 643-652
- https://doi.org/10.1080/02331938508843061
Abstract
In this paper some alternative theorems are presented for convexlike functions. These are then applied to obtain global and local optimality conditions for constrained minimization problems.Keywords
This publication has 7 references indexed in Scilit:
- Theorems of the alternative and optimality conditionsJournal of Optimization Theory and Applications, 1984
- Perfect duality for convexlike programsJournal of Optimization Theory and Applications, 1982
- Regularity and stability for the mathematical programming problem in Banach spacesApplied Mathematics & Optimization, 1979
- Mathematical Programming and Control TheoryPublished by Springer Nature ,1978
- Duality in Fractional Programming: A Unified ApproachOperations Research, 1976
- A theorem of the alternative with application to convex programming: Optimality, duality, and stabilityJournal of Mathematical Analysis and Applications, 1973
- Minimax TheoremsProceedings of the National Academy of Sciences, 1953