Solving interval linear systems with linear programming techniques

Linear Algebra and Its Applications

Volumn 281, Issue 1-3, 1998, Pages 293-309

  Beaumont, O ^a  

^a Inst Rech Info Syst Aleatoires   (France)

Author keywords

Interval computations; Linear programming; Linear systems

Indexed keywords

EID: 0042137188     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(98)10044-7     Document Type: Article

References (11)

1. A. Chvatal, Linear Programming, Freeman, New York, 1983.
2. P. Gill, W. Murray, M. Wright, Numerical Linear Algebra and Optimization, Addison-Wesley, Reading, MA, 1991.
3. V. Kreinovich, J. Rohn, Computing exact componentwise bounds on solutions of linear systems with interval data is NP-Hard, SIAM J. Matrix Anal. Appl. 16 (2) (1995) 415-420.
4. P. Lascaux, R. Theodor, Analyse Numérique Matricielle Appliquée à l'Art de l'Ingénieur, Masson.
5. A. Neumaier, Interval methods for systems of equations, Cambridge University Press, Cambridge, 1990.
6. W. Oettli, W. Prager, Computabitity of approximate solution of linear equations with given error bounds for coefficients and right-hand sides, Numer. Math. 6 (1964) 405-409.
7. S.M. Rump, On the solution of interval linear systems, Computing 47 (1992) 337-353.
8. S.M. Rump, Verification methods for dense and sparse systems of equations, in: J. Herzberger (Ed.), Topics in Validated computations, Elsevier, Amsterdam, 1994.
9. J. Rohn, NP-hardness results for linear algebraic problems with interval data, in: J. Herzberger (Ed.), Topics in Validated computations, Elsevier, Amsterdam, 1994.
10. J. Rohn, Checking bounds on solutions of linear interval equation is NP-hard, Linear Algebra Appl. 223-224 (1995) 589-596.
11. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.