Methods for the Elimination of Unknowns from Systems of Linear Inequalities and Their Applications
- 21 Downloads
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.
KeywordsLinear Inequality Generalize Conservation Helly Theorem
Unable to display preview. Download preview PDF.
- 1.S. N. Chernikov, Linear Inequalities [in Russian], Nauka, Moscow (1968).Google Scholar
- 2.I. I. Eremin and N. N. Astaf'ev, Introduction to the Theory of Linear and Convex Programming [in Russian], Nauka, Moscow (1976).Google Scholar
- 3.L. Danzer, B. Grünbaum, and V. L. Klee, Helly's Theorem and Its Relatives [Russian translation], Mir, Moscow (1968).Google Scholar
- 4.L. R. Ford and D. R. Fulkerson, Flows in Networks [Russian translation], Nauka, Moscow (1966).Google Scholar
- 5.S. E. Lovetskii and I. I. Melamed, “Statistical flows in networks,” Avtomat. Telemekh. No. 10, 3–29 (1987).Google Scholar
- 6.E. E. Kirik and B. N. Pshenichnyi, “Theory and methods of calculation of networks,” Obozr. Prikl. Prom. Mat. 2, No. 1, 49–69 (1995).Google Scholar
- 7.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).Google Scholar