Pages that link to "Item:Q2442073"

The following pages link to A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (Q2442073):

Displaying 9 items.

• A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems (Q256666) (← links)
• Use of branch and bound method for search of an equilibrium in potential Cournot model (Q307757) (← links)
• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798) (← links)
• On branch-and-bound algorithms for global optimal solutions to mathematical programs with affine equilibrium constraints (Q934187) (← links)
• Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators (Q1730476) (← links)
• A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs (Q2005902) (← links)
• A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
• (Q3686504) (← links)
• A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints (Q4929860) (← links)