A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798): Difference between revisions
From MaRDI portal
Revision as of 10:52, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints |
scientific article |
Statements
A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (English)
0 references
5 January 2007
0 references
active-set algorithm
0 references
branch-and-bound method
0 references
complementarity
0 references
disjunctive cuts
0 references
global optimization
0 references
0 references
0 references
