Abstract
A general alternative theorem for convexlike functions is given. This permits the establishment of optimality conditions for convexlike programming problems in which both inequality and equality constraints are considered. It is shown that the main results of the paper contain, in particular, those of Craven, Giannessi, Jeyakumar, Hayashi, and Komiya, Simons, Zalinescu, and a recent result of Tamminen.
Original language | English |
---|---|
Pages (from-to) | 243-257 |
Number of pages | 15 |
Journal | Journal of Optimization Theory and Applications |
Volume | 101 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1999 |
Externally published | Yes |
Keywords
- convexlike functions
- constrained optimization problems
- duality theory
- alternative theorems of Farkas type