Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library

Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library The Netlib library of linear programming problems is a well known suite containing many real world applications. Recently it was shown by Ordóñez and Freund that 71% of these problems are ill-conditioned. Hence, numerical difficulties may occur. Here, we present rigorous results for this library that are computed by a verification method using interval arithmetic. In addition to the original input data of these problems we also consider interval input data. The computed rigorous bounds and the performance of the algorithms are related to the distance to the next ill-posed linear programming problem. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Reliable Computing Springer Journals

Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library

Loading next page...
 
/lp/springer_journal/computational-experience-with-rigorous-error-bounds-for-the-netlib-uoZRuF2VAB
Publisher
Springer Netherlands
Copyright
Copyright © 2006 by Springer Science + Business Media, Inc.
Subject
Mathematics; Numeric Computing; Mathematical Modeling and Industrial Mathematics; Approximations and Expansions; Computational Mathematics and Numerical Analysis
ISSN
1385-3139
eISSN
1573-1340
D.O.I.
10.1007/s11155-006-9004-7
Publisher site
See Article on Publisher Site

Abstract

The Netlib library of linear programming problems is a well known suite containing many real world applications. Recently it was shown by Ordóñez and Freund that 71% of these problems are ill-conditioned. Hence, numerical difficulties may occur. Here, we present rigorous results for this library that are computed by a verification method using interval arithmetic. In addition to the original input data of these problems we also consider interval input data. The computed rigorous bounds and the performance of the algorithms are related to the distance to the next ill-posed linear programming problem.

Journal

Reliable ComputingSpringer Journals

Published: Jul 29, 2006

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from
Google Scholar,
PubMed
Create lists to
organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off