Solving linear programs with complementarity constraints using branch-and-cut (Q2281449): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 22:22, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving linear programs with complementarity constraints using branch-and-cut |
scientific article |
Statements
Solving linear programs with complementarity constraints using branch-and-cut (English)
0 references
19 December 2019
0 references
linear programs with complementarity constraints
0 references
MPECs
0 references
branch-and-cut
0 references
