Nonconvex theorems of the alternative and minimization
- 1 January 1987
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 18 (2) , 151-163
- https://doi.org/10.1080/02331938708843228
Abstract
Theorems of the alternative, in particular, Gordan and Motzkin type theorems for non-convex functions are presented, based on the Fuchssterner and König's extended minimax theorem. As applications of these theorems, optimality conditions and duality theorems are obtained for non-convex programming problems.Keywords
This publication has 19 references indexed in Scilit:
- Optimality conditions for some nonconvex problemsPublished by Springer Nature ,2005
- Convexlike alternative theorems and mathematical programmingOptimization, 1985
- On a theorem of Ky Fan and its application to nondifferentiame optimizationOptimization, 1985
- Nonlinear alternative theorems and nondifferentiable programmingMathematical Methods of Operations Research, 1984
- Perfect duality for convexlike programsJournal of Optimization Theory and Applications, 1982
- Homogeneous programmingJournal of Optimization Theory and Applications, 1980
- 100 Jahre gordanscher alternativsatz für lineare ungleichungenMathematische Operationsforschung und Statistik, 1975
- The fixed point theory of multi-valued mappings in topological vector spacesMathematische Annalen, 1968
- Duality in homogeneous programmingProceedings of the American Mathematical Society, 1961
- Systems of inequalities involving convex functionsProceedings of the American Mathematical Society, 1957