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.
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Nikaido, H.: Convex structures and economic theory. New York-London: Academic Press 1968.
Hansen, E.: On linear algebraic equations with interval coefficients. Topics in interval analysis. Oxford: Clarendon Press 1969.
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02243426