A Forward Simplex Method for Staircase Linear Programs

DOI10.1287/MNSC.31.6.664MaRDI QIDQ3750519zbMATH OpenOpenAlexFDO

Authors Jay E. Aronson, Thomas E. Morton, G. L. Thompson

Publication date 1985

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.31.6.664

zbMATH Keywords

forward algorithmmany time periodsstaircase or dynamic linear program

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4118190
• A forward convex-simplex method
• scientific article; zbMATH DE number 3887432
• Dual nested decomposition of staircase linear programs
• scientific article; zbMATH DE number 3852820

Cited in

(12)

• A clustering heuristic to detect staircase structures in large scale linear programming models
• Cascading-heuristics for the solution of staircase linear programs
• Basis factorization method for multistage linear programming problems with an application to optimal energy plant operation
• scientific article; zbMATH DE number 3887432 (Why is no real title available?)
• scientific article; zbMATH DE number 3852820 (Why is no real title available?)
• scientific article; zbMATH DE number 3916016 (Why is no real title available?)
• Revised dantzig-wolfe decomposition for staircase-structured linear programs
• scientific article; zbMATH DE number 18252 (Why is no real title available?)
• Formalization of Incremental Simplex Algorithm by Stepwise Refinement
• scientific article; zbMATH DE number 4118190 (Why is no real title available?)
• On the Combinatorial Diameters of Parallel and Series Connections
• A survey of dynamic network flows

This page was built for publication: A Forward Simplex Method for Staircase Linear Programs

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