On pricing and backward transformation in linear programming

DOI10.1007/BF01580221MaRDI QIDQ4404659zbMATH OpenOpenAlexFDO

Authors

Publication date 1974

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear programming (90C05)

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• Pivot selection methods of the Devex LP code
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method

Cited in

(9)

• Novel update techniques for the revised simplex method
• Methods for convex and general quadratic programming
• Formal optimization of some reduced linear programming problems
• Experiments in mixed-integer linear programming using pseudo-costs
• On the Bartels—Golub decomposition for linear programming bases
• Large-scale linearly constrained optimization
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Solving staircase linear programs by the simplex method, 2: Pricing
• An efficient approach to updating simplex multipliers in the simplex algorithm

Describes a project that uses

Uses Software

• DEVEX

This page was built for publication: On pricing and backward transformation in linear programming

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