A Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints

Author： Júdice Joaquim Sherali Hanif Ribeiro Isabel Faustino Ana

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.36, Iss.1, 2006-09, pp. : 89-114

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

Mathematical Programming with System of Equilibrium Constraints

By Lin Lai-Jiu

Journal of Global Optimization, Vol. 37, Iss. 2, 2007-02 ,pp. : 275-286

Springer Publishing Company

Access to resources Recommend Favorite

A Contraction-based Ratio-cut Partitioning Algorithm

By Saab Youssef

VLSI Design, Vol. 15, Iss. 2, 2002-01 ,pp. : 485-489

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints

By Luo H. Sun X. Xu Y. Wu H.

Journal of Global Optimization, Vol. 46, Iss. 2, 2010-02 ,pp. : 217-232

Springer Publishing Company

Access to resources Recommend Favorite

A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints

By Li Jian-Ling Jian Jin-Bao

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 477-510

Springer Publishing Company

Access to resources Recommend Favorite

A Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints

By Lin Gui-Hua

Annals of Operations Research, Vol. 133, Iss. 1-4, 2005-01 ,pp. : 63-84

Springer Publishing Company

Access to resources Recommend Favorite