A Comparative Study of Two Methods for Staircase Linear Programs

DOI10.1145/355873.355875zbMath0432.90048OpenAlexW2029905262MaRDI QIDQ3870661

James K. Ho, Etienne Loute

Publication date: 1980

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355873.355875

zbMATH Keywords

decompositionlarge-scale systemscomputational resultscomparison of algorithmsdynamic modelslarge-scale problemsempirical comparisonmultistage modelsbasis factorizationstaircase linear programsstructured linear programscomparative study of two methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

On solution of multicoupled models ⋮ Revised dantzig-wolfe decomposition for staircase-structured linear programs ⋮ A primal-dual subgradient method for time staged capacity expansion planning ⋮ An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming ⋮ Solving staircase linear programs by the simplex method, 2: Pricing ⋮ Computational experience with advanced implementation of decomposition algorithms for linear programming ⋮ Solving staircase linear programs by the simplex method, 1: Inversion ⋮ Sensitivity method for basis inverse representation in multistage stochastic linear programming problems

This page was built for publication: A Comparative Study of Two Methods for Staircase Linear Programs