Skip to main content
SpringerLink
Log in

Strong solvability of interval linear programming problems

Starke Lösbarkeit von Problemen der linearen Optimierung mit Intervallkoeffizienten

  • Short Communications
  • Published:
Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Necessary and sufficient conditions for a linear programming problem whose parameters (both in constraints and in the objective function) are prescribed by intervals are given under which any linear programming problem with parameters being fixed in these intervals has a finite optimum.

Zusammenfassung

Es werden notwendige und hinreichende Bedingungen für das Problem der linearen Optimierung mit Intervallkoeffizienten angegeben, bei denen jedes Problem der linearen Optimierung, dessen Koeffizienten in gegebenen Intervallen fixiert werden, eine optimale Lösung besitzt.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Nikaido, H.: Convex structures and economic theory. New York-London: Academic Press 1968.

    Google Scholar 

  2. Hansen, E.: On linear algebraic equations with interval coefficients. Topics in interval analysis. Oxford: Clarendon Press 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, CS-11800, Praha 1, Czechoslovakia

    J. Rohn

Authors
  1. J. Rohn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rohn, J. Strong solvability of interval linear programming problems. Computing 26, 79–82 (1981). https://doi.org/10.1007/BF02243426

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02243426

Keywords

Search

Navigation