On calmness conditions in convex bilevel programming

Author： Henrion R.  

Publisher： Taylor & Francis Ltd

ISSN： 0003-6811

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

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

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

New Farkas-type constraintqualifications in convex infinite programming

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

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

Edp Sciences

Access to resources Recommend Favorite

A duality theorem for nondifferentiable convex programming with operatorial constraints

By  

Bulletin of the Australian Mathematical Society, Vol. 22, Iss. 1, 1980-08 ,pp. : 145-152

Cambridge University Press

Access to resources Recommend Favorite

Semilocal E-convexity and semilocal E-convex programming

By  

Bulletin of the Australian Mathematical Society, Vol. 75, Iss. 1, 2007-02 ,pp. : 59-74

Cambridge University Press

Access to resources Recommend Favorite

Necessary and Sufficient Conditions for Minimax Fractional Programming

By Lai H.C.   Liu J.C.   Lee K.E.S.  

Journal of Mathematical Analysis and Applications, Vol. 230, Iss. 2, 1999-02 ,pp. : 311-328

Academic Press

Access to resources Recommend Favorite