Computational experience with advanced implementation of decomposition algorithms for linear programming

DOI10.1007/BF02591904MaRDI QIDQ3670456zbMATH OpenOpenAlexFDO

Authors James K. Ho, Etienne Loute

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02591904

zbMATH Keywords

large-scale systemsdecomposition algorithmstest problemscomputational experienceoptimization softwarestructured linear programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites work

• scientific article; zbMATH DE number 3856814 (Why is no real title available?)
• scientific article; zbMATH DE number 3555711 (Why is no real title available?)
• A Comparative Study of Two Methods for Staircase Linear Programs
• A set of staircase linear programming test problems
• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
• Nested decomposition for dynamic models
• The Decomposition Algorithm for Linear Programs

Cited in

(17)

• Extensions of TOPSIS for multi-objective large-scale nonlinear programming problems
• Nested decomposition of multistage nonlinear programs with recourse
• An interactive fuzzy satisficing method for multiobjective block angular linear programming problems with fuzzy parameters
• Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
• Load balancing in the parallel optimization of block-angular linear programs
• Cascading-heuristics for the solution of staircase linear programs
• An interactive algorithm for large scale multiple objective programming problems with fuzzy parameters through TOPSIS approach
• Scheduling training for a tank battalion: how to measure readiness
• Extended VIKOR as a new method for solving multiple objective large-scale nonlinear programming problems
• Revised dantzig-wolfe decomposition for staircase-structured linear programs
• Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
• Parallel solution of large-scale, block-angular linear programs
• Convergence behavior of decomposition algorithms for linear programs
• A survey of dynamic network flows
• Generalized proximal point algorithm for convex optimization
• A barrier method for dynamic Leontief-type linear programs
• Capital budgeting with Benders' decomposition

Describes a project that uses

Uses Software

• LIFT

This page was built for publication: Computational experience with advanced implementation of decomposition algorithms for linear programming

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