An Implementation Of The Dual Local Decomposition Method

The paper deals with a method for solving a linear programming problem with a primal block-angular structure. Any basic solution of such a problem can be decomposed into a principal problem and the remaining independent subproblems. A dual method working on an infeasible principal problem interacts...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:INFOR. Information systems and operational research Ročník 29; číslo 1; s. 26 - 37
Hlavní autoři: Coad, Leonard A., Panne, Cornelis Van De
Médium: Journal Article
Jazyk:angličtina
Vydáno: Ottawa Taylor & Francis 01.02.1991
Canadian Operational Research Society
Témata:
Decomposition
Implementations
Linear programming
Mathematical models
Methods
Operations research
Theory
ISSN:0315-5986, 1916-0615
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The paper deals with a method for solving a linear programming problem with a primal block-angular structure. Any basic solution of such a problem can be decomposed into a principal problem and the remaining independent subproblems. A dual method working on an infeasible principal problem interacts with all the remaining independent subproblems to yield an optimal solution to the entire problem. Some implementation results for primally and dually feasible initial solutions using randomly generated problems are given.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0315-5986
1916-0615
DOI:10.1080/03155986.1991.11732153