New Farkas-type constraintqualifications in convex infinite programming

Author： Dinh Nguyen   Goberna Miguel A.   López Marco A.   Son Ta Quang  

Publisher： Edp Sciences

E-ISSN： 1262-3377|13|3|580-597

ISSN： 1292-8119

Source： ESAIM: Control, Optimisation and Calculus of Variations, Vol.13, Iss.3, 2007-06, pp. : 580-597

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Farkas-type theorems for interval linear systems

By Xia Mengxue   Li Wei   Li Haohao  

Linear and Multilinear Algebra, Vol. 63, Iss. 7, 2015-07 ,pp. : 1390-1400

Taylor & Francis Ltd

Access to resources Recommend Favorite

Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach

By Bartl David  

Linear and Multilinear Algebra, Vol. 55, Iss. 4, 2007-07 ,pp. : 327-353

Taylor & Francis Ltd

Access to resources Recommend Favorite

Infinite numerical range is convex

By Roldan-Pensado Edgardo  

Linear and Multilinear Algebra, Vol. 56, Iss. 6, 2008-11 ,pp. : 731-733

Taylor & Francis Ltd

Access to resources Recommend Favorite

On calmness conditions in convex bilevel programming

By Henrion R.  

Applicable Analysis, Vol. 90, Iss. 6, 2011-06 ,pp. : 951-970

Taylor & Francis Ltd

Access to resources Recommend Favorite

Sensitivity Analysis for Convex Multiobjective Programming in Abstract Spaces

By Balbas A.   Guerra P.J.  

Journal of Mathematical Analysis and Applications, Vol. 202, Iss. 2, 1996-09 ,pp. : 645-658

Academic Press

Access to resources Recommend Favorite