Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Linear Interval Tolerance Problem and Linear Programming Techniques

  • Published:
Reliable Computing

Abstract

In this paper, we consider the linear interval tolerance problem, which consists of finding the largest interval vector included in ∑∀∃([A], [b]) = {x ∈ Rn | ∀A ∈ [A], ∃b ∈ [b], Ax = b}. We describe two different polyhedrons that represent subsets of all possible interval vectors in ∑∀∃([A], [b]), and we provide a new definition of the optimality of an interval vector included in ∑∀∃([A], [b]). Finally, we show how the Simplex algorithm can be applied to find an optimal interval vector in ∑∀∃([A], [b]).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Beaumont, O.: Solving Interval Linear Systems with Linear Programming Techniques, Linear Algebra and Its Applications 281 (1998), pp. 293-309.

    Google Scholar 

  2. Chvatal, A.: Linear Programming, W. H. Freeman and Company, 1983.

  3. Jansson, C.: Calculation of Exact Bounds for the Solution Set of Linear Interval Systems, Linear Algebra and Its Applications 251 (1997), pp. 321-340.

    Google Scholar 

  4. Neumaier, A.: Interval Methods for Systems of Equations, Cambridge Univ. Press, Cambridge, 1990.

    Google Scholar 

  5. Oettli, W. and Prager, W.:Computability of Approximate Solution of Linear Equations with Given Error Bounds for Coefficients and Right-Hand Sides, Numer. Math. 6 (1964), pp. 405-409.

    Google Scholar 

  6. Rohn, J.: Inner Solutions of Linear Interval Systems, in: Nickel, K. (ed.), Interval Mathematics 1985, Lecture Notes in Computer Science 212, Springer, Berlin, 1986, pp. 157-158.

    Google Scholar 

  7. Rohn, J.: NP-Hardness Results for Linear Algebraic Problems with Interval Data, in: Herzberger, J. (ed.), Topics in Validated Computations, Elsevier Science, 1994.

  8. Rohn, J.: Systems of Linear Interval Equations, Linear Algebra and Its Applications 126(1989), pp. 39-78.

    Google Scholar 

  9. Rump, S.M.: VerificationMethods forDense and Sparse Systems of Equations, in: Herzberger, J. (ed.), Topics in Validated Computations, Elsevier Science, 1994.

  10. Shary, S. P.: Algebraic Approach to the Interval Linear Static Identification, Tolerance, and Control Problems, or One More Application of Kaucher Arithmetic, Reliable Computing 2(1) (1996), pp. 3-33.

    Google Scholar 

  11. Shary, S. P.: Solving the Linear Interval Tolerance Problem, Mathematics and Computers in Simulation 39(1995), pp. 53-85.

    Google Scholar 

  12. Schrijver, A.: Theory of Linear and Integer Programming, John Wiley & Sons, 1986.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beaumont, O., Philippe, B. Linear Interval Tolerance Problem and Linear Programming Techniques. Reliable Computing 7, 433–447 (2001). https://doi.org/10.1023/A:1014758201565

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014758201565

Keywords