A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: KNITRO / rank | |||
Normal rank | |||
Revision as of 16:45, 28 February 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
