On scaling linear programs—some experimental results

DOI10.1080/02331939308843895zbMath0818.90069MaRDI QIDQ3835674

No author found.

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939308843895

zbMATH Keywords

optimality conditions; preprocessing; optimal scaling models; row and column scaling

Mathematics Subject Classification ID

90C05: Linear programming

65F35: Numerical computation of matrix norms, conditioning, scaling

Related Items

Scaling linear optimization problems prior to application of the simplex method

Uses Software

• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the choice of the pivot columns of the simplex-method: Gradient criteria
• Worst case behavior of the steepest edge simplex method
• An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
• On some methods for entropy maximization and matrix scaling
• Condition numbers and equilibration of matrices
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• Evolution of Linear Programming Computing Techniques
• A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
• Computing optimal scalings by parametric network algorithms
• An Algorithm for Scaling Matrices
• A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm
• Characterizations of optimal scalings of matrices
• A practicable steepest-edge simplex algorithm
• Entropy in linear programs
• Solving staircase linear programs by the simplex method, 1: Inversion
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Contingency tables with given marginals
• On the Automatic Scaling of Matrices for Gaussian Elimination