A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-017-1208-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2607956614 / rank | |||
Normal rank | |||
Revision as of 20:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A study of the difference-of-convex approach for solving linear programs with complementarity constraints |
scientific article |
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
