Решение задач линейного программирования приведением к виду с очевидным ответом
Аннотация
Список литературы
1. S. I. Gass, Linear Programming: Methods and Applications. McGraw-Hill: New York, 1958.
2. A. Schrijver, Theory of linear and integer programming. Moscow: Mir, 1991.
3. D. B. Yudin and E. G. Holstein, Linear Programming: Theory and finite methods . Moscow: Fizmatlit, 1963.
4. G. B. Dantzig, Linear Programming and Extensions. Princeton University Press, 1963.
5. T. S. Hu, Integer programming and network flows. Addison-Wesley , 1969.
6. S. A. Ashmanov, Linear Programming. Moscow: Nauka, 1981.
7. C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization: algorithms and complexity. Prentice-Hall, 1982.
8. F. P. Vasiliev and A. Y. Ivanitsky, Linear Programming. MCCME, 2020.
9. E. Stiefel, “Note on Jordan elimination, linear programming and Tchebycheff approximation,” Numerische Mathematik, vol. 2, no. 1, pp. 1-17, 1960.
10. S. I. Zukhovitsky and L. I. Avdeeva, Linear and Convex Programming . Moscow: Nauka, 1967.
11. A. Charnes, “Optimality and degeneracy in linear programming,” Econometrica: Journal of the Econometric Society, vol. 20, no. 2, pp. 160-170 , 1952.
12. R. G. Bland, “New finite pivoting rules for the simplex method,” Mathematics of Operations Research, vol. 2, no. 2, pp. 103-107, 1977.
13. H. W. Kuhn, Class Notes. Princeton University, 1976.
14. A. S. Barsov, What is Linear Programming . Moscow: Fizmatgiz, 1959.
15. V. G. Karmanov, Mathematical Programming. Moscow: Fizmatlit, 2004.
16. Y. G. Evtushenko, A. A. Tret'yakov, and E. E. Tyrtyshnikov, “New approach to Farkas' theorem of the alternative ,” in Doklady Mathematics , 2019, vol. 99 , pp. 208-210.
17. G. D. Stepanov, “A Simple Algorithm for Finding a Non-negative Basic Solution of a System of Linear Algebraic Equations,” Modeling and analysis of information systems, vol. 28, no. 3, pp. 234-237 , 2021.
Рецензия
Для цитирования:
Степанов Г.Д. Решение задач линейного программирования приведением к виду с очевидным ответом. Моделирование и анализ информационных систем. 2021;28(4):434-451. https://doi.org/10.18255/1818-1015-2021-4-434-451
For citation:
Stepanov G.D. Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer. Modeling and Analysis of Information Systems. 2021;28(4):434-451. (In Russ.) https://doi.org/10.18255/1818-1015-2021-4-434-451