New Farkas-type constraint qualifications in convex infinite programming
ESAIM: COCV, 13 3 (2007) 580-597
Published online: 2007-06-20
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
CODERIVATIVES OF EFFICIENT POINT MULTIFUNCTIONS IN PARAMETRIC VECTOR OPTIMIZATION
Thai Doan Chuong and Jen-Chih YaoTaiwanese Journal of Mathematics 13 (6A) (2009)
https://doi.org/10.11650/twjm/1500405608
Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
Chong Li, K. F. Ng and T. K. PongSIAM Journal on Optimization 19 (1) 163 (2008)
https://doi.org/10.1137/060676982
On strong and total Lagrange duality for convex optimization problems
Radu Ioan Boţ, Sorin-Mihai Grad and Gert WankaJournal of Mathematical Analysis and Applications 337 (2) 1315 (2008)
https://doi.org/10.1016/j.jmaa.2007.04.071
Characterizations of optimal solution sets of convex infinite programs
T. Q. Son and N. DinhTOP 16 (1) 147 (2008)
https://doi.org/10.1007/s11750-008-0039-2