Data Flow Analysis By Linear Programming Model
Abstract
The paper presents the general discussion of the data ow algorithms structuring problem on one hand, and, as an example of that particular problem class, the analysis of the linear programming problem when the objective function coe±cients vary depending on the data w. The problem is in reconstruction of current result with such an approach, which is the most plain from the full solution of the problem by the dynamic data set ow.
References
L. Aslanyan, J. Castellanos, F.Mingo, H .Sahakyan,V.Ryazanov, Algorithms for Data Flows, International Journal Information Theories and Applications, ISSN 1310-051 33, Volume 10, Number 3 (2003) ,pp. 279-282.
Barbara G. Ryder and Marvin C. Paull, Incremental data-ow analysis algorithms, ACM Transactions on Programming Languages and Systems (TOPLAS) ,Volume 10 Issue 1(1988) , pp. 1-50.
В. К. Леонтьев, Устойчивость в линейных дискретных задачах, ”Проблемы Кибернетики”,бып. 35, 1979.
A .Alaverdyan, Linear Programming With Changing Coeficients Of Objective Function, in Transactions of the Institute for Informatics and Automation Problems of NAS RA , Mathematical Problems of Computer Science, 2005, Yerevan.
Ch. Papadimitriu, K.Steiglitz, Combinatorial optimization: Algorithms and Complexity, Prentice-H all Inc,1982.
Ю. Кузнецов, В. Кузубов, А. Волощенко, Математическое программирование, Высшая школа, Москва, 1980.
Б. Муртаф, Современное линейное Программирование, теория и практика, Москва, Мир, 1984.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
