Linear Programming with Changing Coeffcients of Objective Function
Abstract
The article studies the problem of linear programming, when the objective function'scoeffcients change depending on the data ow. The set of objective function coeffcients under which the vertex of the feasible set of linear programming is an optimal solution is described.
References
П.Ланкастер,Теория матриц, - М.:Наука.1978.
Х.Пападимитриу, К.Стайглиц, Комбинаторная оптимизация: Алгоритмы и сложность. -М.:Мир. 1985.
А.Схрейвер, Теория линейного и целочисленного программирования. - М.: Мир. 1991.
Downloads
Published
2021-12-10
How to Cite
Alaverdyan, A. H. . (2021). Linear Programming with Changing Coeffcients of Objective Function. Mathematical Problems of Computer Science, 24, 11–15. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/565
Issue
Section
Articles
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.