Numerical behavior of LP algorithms based upon the decomposition principle
type: Item
instance of: scholarly article
title: Numerical behavior of LP algorithms based upon the decomposition principle
zbMATH Open document ID: 0555.65040
DOI: 10.1016/0024-3795(84)90186-1
author: Larry Nazareth
published in: Linear Algebra and its Applications
publication date: 1984-01-01T00:00:00Z
review text: Although the full master program, obtained by applying the Dantzig-Wolfe decomposition principle to a given linear program has the same feasible and optimal solutions, the two programs are not numerically equivalent. In this paper the author presents some LP problems, involving only a few constraints and variables, each of which exhibits a particular numerical feature of the Dantzig-Wolfe decomposition algorithm, thus identifying numerical difficulties that can occur in general.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 3885228
zbMATH Keywords: numerical behavior
zbMATH Keywords: full master program
zbMATH Keywords: Dantzig-Wolfe decomposition
zbMATH Keywords: feasible and optimal solutions
describes a project that uses: DEVEX
MaRDI profile type: Publication
full work available at URL: 0024-3795(84)90186-1
OpenAlex ID: W2101940983
cites work: Decomposition Principle for Linear Programs
cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method
cites work: Q4178772
cites work: Q4132007
cites work: Error analysis of floating-point computation
cites work: Q3850185
cites work: Q5674306
Recommended article: Convergence behavior of decomposition algorithms for linear programs
Recommended article: The decomposition principle and algorithms for linear programming
Recommended article: Q4861609
Recommended article: Numerical experiments in a new class of algorithms in linear programming
Recommended article: Q5393075
Recommended article: Q3071609
Recommended article: Q3727750
Recommended article: A Decomposition Method and Its Application to Convex Programming
Recommended article: Q3688106
Recommended article: Lagrangean decomposition for integer nonlinear programming with linear constraints
description: scientific article; zbMATH DE number 3885228