Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970): Difference between revisions
From MaRDI portal
Latest revision as of 03:16, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints |
scientific article |
Statements
Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (English)
0 references
3 December 2015
0 references
optimization with complementarity constraints
0 references
linear programs
0 references
relaxations
0 references
lower bounds
0 references
0 references
0 references
0 references
0 references
0 references
0 references