Methods for finding global optimal solutions to linear programs with equilibrium constraints.

zbMATH Open1087.90525MaRDI QIDQ696138FDOQ696138

Authors: Le Dung Muu, Nguyen V. Quy 

Publication date: 2001

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Recommendations

• Methods for finding global optimal solutions to linear programs with equilibrium constraints
• Global optimization method for solving mathematical programs with linear complementarity constraints
• On branch-and-bound algorithms for global optimal solutions to mathematical programs with affine equilibrium constraints
• scientific article; zbMATH DE number 1306979
• A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints

zbMATH Keywords

branch-and-bound algorithmglobal optimizationlinear problemequilibrium constraint

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited In (4)

• Potential function methods for approximately solving linear programming problems: theory and practice.
• Semidefinite relaxation for linear programs with equilibrium constraints
• On branch-and-bound algorithms for global optimal solutions to mathematical programs with affine equilibrium constraints
• Methods for finding global optimal solutions to linear programs with equilibrium constraints

This page was built for publication: Methods for finding global optimal solutions to linear programs with equilibrium constraints.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696138)