An algorithm for decomposition coordination of large scale convex programming problems (Q1109681)
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: An algorithm for decomposition coordination of large scale convex programming problems |
scientific article; zbMATH DE number 4070635
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for decomposition coordination of large scale convex programming problems |
scientific article; zbMATH DE number 4070635 |
Statements
An algorithm for decomposition coordination of large scale convex programming problems (English)
0 references
1988
0 references
This paper represents the authors' decomposition coordination algorithm based on the pricing mechanism discussed by \textit{L. S. Lasdon} [``Optimization theory for large systems'' (1970; Zbl 0224.90038)] for solving the large scale convex programming problem in which the objective function and the constraint functions are additively separable. The algorithm utilizes the stack data structure.
0 references
additive separable objective and constraint functions
0 references
decomposition coordination algorithm
0 references
pricing mechanism
0 references
large scale convex programming
0 references
stack data structure
0 references
