A difference of convex and polyhedral convex functions programming problem (Q5117520)
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 difference of convex and polyhedral convex functions programming problem |
scientific article; zbMATH DE number 7239763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A difference of convex and polyhedral convex functions programming problem |
scientific article; zbMATH DE number 7239763 |
Statements
25 August 2020
0 references
difference of convex and polyhedral convex functions programming
0 references
basic constraint qualification
0 references
fractional programming
0 references
0.9241318702697754
0 references
0.8380616307258606
0 references
0.8314335942268372
0 references
0.8269356489181519
0 references
0.8196017742156982
0 references
