Institute of Information Theories and Applications FOI ITHEA
Abstract
* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.beThe general discussion of the data flow algorithmic models, and the linear programming problem with
the variating by data flow criterion function coefficients are presented. The general problem is widely known in
different names - data streams, incremental and online algorithms, etc. The more studied algorithmic models
include mathematical statistics and clustering, histograms and wavelets, sorting, set cover, and others. Linear
programming model is an addition to this list. Large theoretical knowledge exists in this as the simplex algorithm
and as interior point methods but the flow analysis requires another interpretation of optimal plans and plan
transition with variate coefficients. An approximate model is devised which predicts the boundary stability point for
the current optimal plan. This is valuable preparatory information of applications, moreover when a parallel
computational facility is supposed