A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452)
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 study of the difference-of-convex approach for solving linear programs with complementarity constraints |
scientific article; zbMATH DE number 6869184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A study of the difference-of-convex approach for solving linear programs with complementarity constraints |
scientific article; zbMATH DE number 6869184 |
Statements
A study of the difference-of-convex approach for solving linear programs with complementarity constraints (English)
0 references
16 May 2018
0 references
difference-of-convex
0 references
complementarity constraints
0 references
penalty functions
0 references
bilevel programming
0 references
0 references
0 references
0 references
0 references
0.8781910538673401
0 references
0.8269558548927307
0 references
0.819919764995575
0 references
0.8032265305519104
0 references
0.7989044189453125
0 references
