Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual (Q3892089): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:43, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual |
scientific article |
Statements
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual (English)
0 references
1980
0 references
resource allocation problems
0 references
nonconvex programming
0 references
surrogate duality
0 references
economics of scale
0 references
linearly constrained optimization problems
0 references
surrogate dual problem
0 references
economic interpretation
0 references
computation of lower bounds
0 references
explicity quasi-concave lower semicontinuous isotone cost function
0 references
branch-and-bound algorithm
0 references
