The decomposition principle and algorithms for linear programming
type: Item
instance of: scholarly article
title: The decomposition principle and algorithms for linear programming
zbMATH Open document ID: 0729.65042
DOI: 10.1016/0024-3795(91)90270-7
author: N. E. Zubov
published in: Linear Algebra and its Applications
publication date: 1991-01-01T00:00:00Z
review text: The paper deals with the computational difficulties encountered in the Dantzig-Wolfe decomposition algorithm. The DKN-algorithm is proposed. Numerical experiments are given, which illustrate this procedure, and computational results are described. The DKN-algorithm is exemplified by further discussion of the case of decentralized decision.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 4205886
zbMATH Keywords: linear programming
zbMATH Keywords: Dantzig-Wolfe decomposition algorithm
zbMATH Keywords: DKN-algorithm
zbMATH Keywords: Numerical experiments
zbMATH Keywords: computational results
zbMATH Keywords: decentralized decision
Wikidata QID: Q114852080
MaRDI profile type: Publication
full work available at URL: 0024-3795(91)90270-7
OpenAlex ID: W2072867904
cites work: Q4079613
cites work: Q3844775
cites work: The Decomposition Algorithm for Linear Programs
cites work: Q5583564
cites work: Q4040713
cites work: Mathematics in economics: Achievements, difficulties, perspectives
cites work: A new polynomial-time algorithm for linear programming
cites work: Q4051879
cites work: Q3786267
cites work: Q3694577
cites work: Q5680669
cites work: Q3947447
description: scientific article; zbMATH DE number 4205886