Interval arithmetic for guaranteed bounds in linear programming
暂无分享,去创建一个
In this note, we show how interval arithmetic can be used to give a solution to the linear programming problem which is guaranteed to be on the safe side of the true solution, where roundoff error is taken into account.
[1] R. J. Clasen. Techniques for automatic tolerance control in linear programming , 1966, CACM.
[2] E. Hansen,et al. Interval Arithmetic in Matrix Computations, Part II , 1965 .
[3] Eldon Hansen,et al. Topics in Interval Analysis , 1969 .
[4] Heiner Müller-Merbach,et al. On round-off errors in linear programming , 1970 .