A note on mixed procedures for decomposing linear programming problems

DOI10.1080/02331937808842522MaRDI QIDQ4181602zbMATH OpenOpenAlexFDO

Authors Børge Obel

Publication date 1978

Published in Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331937808842522

zbMATH Keywords

Linear ProgrammingMixed ProceduresPrice and Budget Planning ProceduresPrimal and Dual Decomposition Procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Probabilistic models, generic numerical methods in probability and statistics (65C20)

Cited in

(3)

• Horizontal mixed decomposition
• Aggregation and decomposition for multi-divisional linear programs
• Decomposition and iterative aggregation in hierarchical and decentralised planning structures

This page was built for publication: A note on mixed procedures for decomposing linear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181602)