Pages that link to "Item:Q1777600"
From MaRDI portal
The following pages link to Global optimization method for solving mathematical programs with linear complementarity constraints (Q1777600):
Displaying 13 items.
- Methods for finding global optimal solutions to linear programs with equilibrium constraints. (Q696138) (← links)
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (Q704808) (← links)
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- DC programming techniques for solving a class of nonlinear bilevel programs (Q839322) (← links)
- Solving linear optimization problems with max-star composition equation constraints (Q849775) (← links)
- Global optimization techniques for mixed complementarity problems (Q1579944) (← links)
- Methods for finding global optimal solutions to linear programs with equilibrium constraints (Q1862683) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience (Q2488050) (← links)
- A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints (Q3008599) (← links)
- The global solver in the LINDO API (Q3396390) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (Q5963234) (← links)
