Please use this identifier to cite or link to this item:
Fulltext available Open Access
Title: Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library
Language: English
Authors: Keil, Christian 
Jansson, Christian 
Keywords: Rigorose Fehlerschranken;linear programming, interval arithmetic, rigorous error bounds, sensitivity analysis, Netlib linear programming library
Issue Date: 2005
Source: Reliable Computing, Volume 12, Issue 4, Pages 303 - 321
Abstract (english): The Netlib library of linear programming problems is a well known suite containing many real world applications. Recently it was shown by Ordonez 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.
DOI: 10.15480/882.39
Institute: Zuverlässiges Rechnen E-19 
Type: Preprint (Vorabdruck)
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
netlib_experience_5.5.pdf219,8 kBAdobe PDFThumbnail
Show full item record

Page view(s)

Last Week
Last month
checked on Sep 27, 2020


checked on Sep 27, 2020

Google ScholarTM


Note about this record


Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.