Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization
The goal of this paper is to develop some computational experience and test the practical relevance of the theory of condition numbers C(d) for linear optimization, as applied to problem instances that one might encounter in practice. We used the NETLIB suite of linear optimization problems as a tes...
Main Authors: | Ordónez, Fernando, Freund, Robert M. |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3547 |
Similar Items
-
An Algorithm for Computing the Symmetry Point of a Polytope
by: Belloni, Alexandre, et al.
Published: (2003) -
Computation of Minimum Volume Covering Ellipsoids
by: Sun, Peng, et al.
Published: (2004) -
Summary Conclusions on Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization*
by: Ordóñez, Fernando, et al.
Published: (2003) -
A Primal-Dual Interior-Point Method for Facility Layout Problem with Relative-Positioning Constraints
by: Shunichi Ohmori, et al.
Published: (2021-02-01) -
Summary Conclusions: Computation of Minimum Volume Covering Ellipsoids*
by: Sun, Peng, et al.
Published: (2003)