Skip to main content
Log in

Ordering of Intervals and Optimization Problems with Interval Parameters

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The general problem of comparison of numbers specified by intervals of possible values is considered in connection with optimization of systems with undetermined parameters. The solution of the problem is obtained that uses a measure of proximity of intervals. This solution is extended to any intervals that are arbitrarily located relative to one another.

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

Access this article

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. V. I. Levin, “Discrete optimization under interval uncertainty,” Avtomat. Telemekh., No. 7, 97–107 (1992).

    Google Scholar 

  2. V. I. Levin, “Boolean linear programming with interval coefficients,” Avtomat. Telemekh., No. 7, 111–122 (1994).

    Google Scholar 

  3. V. I. Levin, “Interval discrete programming,” Kibern. Sist. Anal., No. 6, 91–103 (1994).

    Google Scholar 

  4. G. Alefeld and J. Herzberger, Introduction to Interval Computations [Russian translation], Mir, Moscow (1987).

    Google Scholar 

  5. V. I. Levin, “Optimization of time-tables in systems with uncertain processing time. I, II,” Avtomat. Telemekh., No. 2, 99–110; No. 3, 106–116 (1995).

    Google Scholar 

  6. V. I. Levin, “Interval approach to optimization under uncertainty,” Information Technologies, No. 1, 7–12 (1999).

    Google Scholar 

  7. V. I. Levin, “Nonlinear optimization under interval uncertainty,” Kibern. Sist. Anal., No. 2, 138–147 (1999).

    Google Scholar 

  8. V. I. Levin, “Antagonistic games with interval parameters,” Kibern. Sist. Anal., No. 3, 149–160 (1999).

    Google Scholar 

  9. V. I. Levin, “Mathematical theory of comparison of interval quantities,” Izmerit. Tekhnika, No. 5, 3–8 (1998).

    Google Scholar 

  10. M. Libura, “Integer programming problems with inexact objective function,” Control and Cybernetics, 9, No. 4, 189–202 (1980).

    Google Scholar 

  11. S. G. Timokhin and A. V. Shapkin, “Linear programming problems with inexact data,” Ekonom. Mat. Metody, 17, No. 5, 955–963 (1981).

    Google Scholar 

  12. R. E. Steuer, “Algorithms for linear programming problems with interval objective function coefficients,” Math. Oper. Res., 6, 222–248 (1981).

    Google Scholar 

  13. A. A. Vatolin, “Linear programming problems with interval coefficients,” Zh. Vychisl. Mat. Mat. Fiz., 24, No. 11, 1629–1637 (1984).

    Google Scholar 

  14. A. P. Voshchinin and G. R. Sotirov, Optimization under Uncertainty [in Russian], Izd. MEI-Tekhnika, Moscow-Sofia (1989).

  15. V. I. Levin, Interval Methods of Optimization of Systems under Uncertainty [in Russian], Izd. Penz. Tekhn. Inst., Penza (1999).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levin, V.I. Ordering of Intervals and Optimization Problems with Interval Parameters. Cybernetics and Systems Analysis 40, 316–324 (2004). https://doi.org/10.1023/B:CASA.0000041988.20251.d7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CASA.0000041988.20251.d7

Navigation