The final NETLIB-LP results
Please always quote using this URN: urn:nbn:de:0297-zib-7274
- The NETLIB has now served for 18 years as a repository of LP problem instances. From the beginning to the present day there was some uncertainness about the precise values of the optimal solutions. We implemented a program using exact rational arithmetic to compute proofs for the feasibility and optimality of an LP solution. This paper reports the \emph{exact} optimal objective values for all NETLIB problems.
Author: | Thorsten KochORCiD |
---|---|
Document Type: | ZIB-Report |
Tag: | Linear Programming; Netlib; Simplex; rational arithmetic |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C05 Linear programming |
Date of first Publication: | 2003/03/06 |
Series (Serial Number): | ZIB-Report (03-05) |
ZIB-Reportnumber: | 03-05 |
Published in: | Appeared in: Operations Research Letters 32 (2004) 138-142 |
DOI: | https://doi.org/10.1016/s0167-6377(03)00094-4 |