Theoretical framework for the analysis of linearly constrained convex programs (Q3328294)
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: Theoretical framework for the analysis of linearly constrained convex programs |
scientific article; zbMATH DE number 3858865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical framework for the analysis of linearly constrained convex programs |
scientific article; zbMATH DE number 3858865 |
Statements
Theoretical framework for the analysis of linearly constrained convex programs (English)
0 references
1984
0 references
conjugate functions
0 references
duality theory
0 references
generalized geometric programming
0 references
linear constraints
0 references
upper and lower bounds
0 references
multi-resource allocation
0 references
shadow price
0 references
reduction of the dimensionality
0 references
entropy maximization
0 references
0 references
0 references
0.8319578766822815
0 references
0.8189103603363037
0 references
0.8139854073524475
0 references
0.7907183766365051
0 references
