Abstract
We study methods for the elimination of an unknown or a group of unknowns from systems of linear inequalities. We justify these methods by using the Helly theorem. The methods considered are applied to the calculation of streams in networks with a generalized conservation law.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
S. N. Chernikov, Linear Inequalities [in Russian], Nauka, Moscow (1968).
I. I. Eremin and N. N. Astaf'ev, Introduction to the Theory of Linear and Convex Programming [in Russian], Nauka, Moscow (1976).
L. Danzer, B. Grünbaum, and V. L. Klee, Helly's Theorem and Its Relatives [Russian translation], Mir, Moscow (1968).
L. R. Ford and D. R. Fulkerson, Flows in Networks [Russian translation], Nauka, Moscow (1966).
S. E. Lovetskii and I. I. Melamed, “Statistical flows in networks,” Avtomat. Telemekh. No. 10, 3–29 (1987).
E. E. Kirik and B. N. Pshenichnyi, “Theory and methods of calculation of networks,” Obozr. Prikl. Prom. Mat. 2, No. 1, 49–69 (1995).
V. V. Ostapenko and A. P. Yakovleva, “Mathematical questions of modeling and control in water distribution problems,” Control Cybern. 20, No. 4, 99–111 (1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ostapenko, V.V., Finin, G.S. Methods for the Elimination of Unknowns from Systems of Linear Inequalities and Their Applications. Ukrainian Mathematical Journal 53, 59–66 (2001). https://doi.org/10.1023/A:1010436816921
Issue Date:
DOI: https://doi.org/10.1023/A:1010436816921