A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints |
scientific article; zbMATH DE number 5081900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints |
scientific article; zbMATH DE number 5081900 |
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
0.8368474841117859
0 references
0.8019861578941345
0 references
0.7895663976669312
0 references
0.7881439328193665
0 references
0.7876244783401489
0 references
