Disjunctive cuts for continuous linear bilevel programming

Author： Audet Charles   Haddad Jean   Savard Gilles  

Publisher： Springer Publishing Company

ISSN： 1862-4472

Source： Optimization Letters, Vol.1, Iss.3, 2007-06, pp. : 259-267

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

A Study of Local Solutions in Linear Bilevel Programming

By Campêlo M.   Scheimberg S.  

Journal of Optimization Theory and Applications, Vol. 125, Iss. 1, 2005-04 ,pp. : 63-84

Springer Publishing Company

Access to resources Recommend Favorite

A class of integer linear fractional bilevel programming problems

By Sharma Vikas   Dahiya Kalpana   Verma Vanita  

Optimization, Vol. 63, Iss. 10, 2014-10 ,pp. : 1565-1581

Taylor & Francis Ltd

Access to resources Recommend Favorite

Links Between Linear Bilevel and Mixed 0–1 Programming Problems

By Audet C.   Hansen P.   Jaumard B.   Savard G.  

Journal of Optimization Theory and Applications, Vol. 93, Iss. 2, 1997-05 ,pp. : 273-300

Springer Publishing Company

Access to resources Recommend Favorite

Deriving the Properties of Linear Bilevel Programming via a Penalty Function Approach

By Xu Z.K.  

Journal of Optimization Theory and Applications, Vol. 103, Iss. 2, 1999-11 ,pp. : 441-456

Springer Publishing Company

Access to resources Recommend Favorite

Disjunctive programming and relaxations of polyhedra

By Conforti Michele   Del Pia Alberto  

Mathematical Programming, Vol. 144, Iss. 1-2, 2014-04 ,pp. : 307-314

Elsevier

Access to resources Recommend Favorite