The final Netlib-LP results

被引：25

作者：

Koch, T ^{[1
]}

机构：

[1] Konrad Zuse Zentrum Informat Tech Berlin, D-14195 Berlin, Germany

来源：

OPERATIONS RESEARCH LETTERS | 2004年 / 32卷 / 02期

关键词：

linear-programming; NETLIB; rational-arithmetic;

D O I：

10.1016/S0167-6377(03)00094-4

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

With standard linear programming solvers there is always some uncertainty 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 exact optimal objective values for all NETLIB problems. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：138 / 142

页数：5

共 15 条

[1]

Avis D, 2000, DMV SEMINAR, V29, P177

[2]

Chvatal V, 1983, Linear programming

[3]

DHIFLAOUI M, 2003, P 14 ANN ACM SIAM S

[4]

FUKUDA K, 2001, CDDLIB REF MANUAL CD

[5]

GARTNER B, 1998, P 9 ANN ACM SIAM S D

[6]

Gay D.M., 1985, MATH PROGRAMMING SOC, V13, P10

[7]

Gill P.E, 1991, Numerical Linear Algebra and Optimization, V1

[8] WHAT EVERY COMPUTER SCIENTIST SHOULD KNOW ABOUT FLOATING-POINT ARITHMETIC [J].

GOLDBERG, D .

COMPUTING SURVEYS, 1991, 23 (01) :5-48

[9]

*IBM, 1997, IBM OPT LIB GUID REF

[10]

*ILOG CPLEX DIV, 2002, ILOG CPLEX 8 0 REF M

← 1 2 →