Statistical problems of choice and synthesis of optimal algorithms

Statistical approach to a construction of the optimal compound algorithm under condition of bounded complexity is described. It is shown that different variants of the problem are reducible to the linear programming problem.