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...

Full description

Saved in:
Bibliographic Details
Published in:INFOR. Information systems and operational research Vol. 29; no. 1; pp. 26 - 37
Main Authors: Coad, Leonard A., Panne, Cornelis Van De
Format: Journal Article
Language:English
Published: Ottawa Taylor & Francis 01.02.1991
Canadian Operational Research Society
Subjects:
Decomposition
Implementations
Linear programming
Mathematical models
Methods
Operations research
Theory
ISSN:0315-5986, 1916-0615
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0315-5986
1916-0615
DOI:10.1080/03155986.1991.11732153