Scaling linear optimization problems prior to application of the simplex method
From MaRDI portal
Publication:453620
DOI10.1007/S10589-011-9420-4zbMATH Open1250.90052OpenAlexW2027244403MaRDI QIDQ453620FDOQ453620
Authors: Joseph M. Elble, Nikolaos V. Sahinidis 
Publication date: 27 September 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9420-4
Recommendations
- On scaling linear programs—some experimental results
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
- Scaling problems in linear-fractional programming
- An analysis of an available set of linear programming test problems
- Computational techniques of the simplex method
Cites Work
- Characterizations of optimal scalings of matrices
- Condition numbers and equilibration of matrices
- Evolution of linear programming computing techniques
- Solving Real-World Linear Programs: A Decade and More of Progress
- Optimally scaled matrices
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- On the Automatic Scaling of Matrices for Gaussian Elimination
- An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
- Scaling by binormalization
- Condition, equilibration and pivoting in linear algebraic systems
- On scaling linear programs—some experimental results
- An Algorithm for Scaling Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Best Conditioned Matrices
Cited In (10)
- A regularized simplex method
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- On scaling linear programs—some experimental results
- Scale characteristics of variable returns-to-scale production technologies with ratio inputs and outputs
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
- Performance analysis of linear and nonlinear techniques for automatic scaling of discretized control problems
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Scaling problems in linear-fractional programming
- A space decomposition-based deterministic algorithm for solving linear optimization problems
Uses Software
This page was built for publication: Scaling linear optimization problems prior to application of the simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453620)
