Dynamically restricted pricing in the simplex method for linear programming

DOI10.1007/BF01583796MaRDI QIDQ3941191zbMATH OpenFDO

Authors Richard J. Herman

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

approximated solutionscomputational experiencedynamically restricted pricinglarge numbers of columnsmodified simplex methodsampling techniques

Mathematics Subject Classification ID

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

Cited in

(1)

• Solving staircase linear programs by the simplex method, 2: Pricing

This page was built for publication: Dynamically restricted pricing in the simplex method for linear programming

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