Farkas-type results for max-functions and applications (2004)
by
R. I. Bot
,
G. Wanka
| Citations: | 3 - 2 self |
BibTeX
@TECHREPORT{Bot04farkas-typeresults,
author = {R. I. Bot and G. Wanka},
title = {Farkas-type results for max-functions and applications},
institution = {},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present some Farkas-type results for inequality systems involving finitely many convex constraints as well as convex max-functions. Therefore we use the dual of a minmax optimization problem. The main theorem and its consequences allows us to establish, as particular instances, some set containment characterizations and to rediscover two famous theorems of the alternative. Keywords: duality, Farkas-type results, minmax programming, set containment, theorems of the alternative AMS subject classification: 49N15, 90C25, 90C46 1.
Citations
| 2333 | Convex Analysis - Rockafellar - 1970 |
| 316 | Convex Analysis and Minimization Algorithms I - Hiriart-Urruty, Lemarechal - 1993 |
| 155 | Nonlinear programming - Mangasarian - 1969 |
| 16 | Strong duality for generalized convex optimization problems - Boț, Kassay, et al. |
| 14 | On the relations between different dual problems in convex mathematical programming - Wanka, Bot¸ - 2002 |
| 11 | Characterizing set containments involving infinite convex constraints and reverseconvex constraints - Jeyakumar |
| 5 | Fenchel-Lagrange versus geometric duality in convex optimization - Bot¸, Grad, et al. - 2006 |
| 4 | Einführung in die Nichtlineare - Elster, Reinhardt, et al. - 1977 |
| 2 | Set Containment characterization - Mangasarian - 2006 |
| 2 | R.: Duality for Minmax Programs - Scott, Jefferson - 1984 |
| 1 | Farkas type results with conjugate functions - Bot¸, Wanka |
