On pricing and backward transformation in linear programming

DOI10.1007/BF01580221zbMath0278.90043OpenAlexW2082574280MaRDI QIDQ4404659

No author found.

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)

Related Items

An efficient approach to updating simplex multipliers in the simplex algorithm, 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, Novel update techniques for the revised simplex method, Methods for convex and general quadratic programming

Uses Software

• DEVEX

Cites Work

• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Pivot selection methods of the Devex LP code
• Unnamed Item
• Unnamed Item