Characterization of optimality in convex programming without a constraint qualification (Q1226443)
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: Characterization of optimality in convex programming without a constraint qualification |
scientific article; zbMATH DE number 3513559
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterization of optimality in convex programming without a constraint qualification |
scientific article; zbMATH DE number 3513559 |
Statements
Characterization of optimality in convex programming without a constraint qualification (English)
0 references
1976
0 references
0 references
0 references
0 references
