An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming

DOI10.1007/BF01589355zbMath0468.90042MaRDI QIDQ3922472

Etienne Loute, James K. Ho

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

decompositionlarge-scale systemscomputational experienceefficient implementationoptimization softwareMPSX/370structured linear programsDECOMPSX

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items

Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings ⋮ A price-directed decomposition approach for solving large-scale capacitated part-routing problems ⋮ Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs ⋮ Generalized proximal point algorithm for convex optimization ⋮ Decomposition of linear programs using parallel computation ⋮ Branch-and-price algorithm for fuzzy integer programming problems with block angular structure ⋮ A fuzzy satisficing method for large-scale linear programming problems with block angular structure ⋮ Revised dantzig-wolfe decomposition for staircase-structured linear programs ⋮ Converging upon basic feasible solutions through Dantzig-Wolfe decomposition ⋮ A heuristic decomposition approach to optimal control in a water supply model ⋮ An interactive fuzzy satisficing method for multiobjective block angular linear programming problems with fuzzy parameters ⋮ Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems ⋮ Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm ⋮ Extensions of TOPSIS for multi-objective large-scale nonlinear programming problems ⋮ A revised iterative algorithm for decomposition goal programming ⋮ An interactive algorithm for large scale multiple objective programming problems with fuzzy parameters through TOPSIS approach ⋮ Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning ⋮ Parallel bundle-based decomposition for large-scale structured mathematical programming problems ⋮ Computational experience with advanced implementation of decomposition algorithms for linear programming ⋮ Convergence behavior of decomposition algorithms for linear programs ⋮ Load balancing in the parallel optimization of block-angular linear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Elimination form of the Inverse and its Application to Linear Programming
• Decomposition Principle for Linear Programs
• The Decomposition Algorithm for Linear Programs
• A Comparative Study of Two Methods for Staircase Linear Programs
• A Structured Linear Programming Model in the Food Industry
• Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe
• The Extended Control Language of MPSX/370 and possible applications
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Experiences in Using a Decomposition Program