On search for a feasible guaranteed plan in the problem of programmed control in face of a disturbance

Iterative algorithms are proposed for search for a feasible guaranteed plant in the problem of programmed control in face of a disturbance. A case is considered where a set of guaranteed plans (a system of constraints) is a finite or infinite set of control-convex functionals. Numerical algorithms employ the projection method. Theorems are proved on convergence of iterative sequences to a certain feasible quaranteed plan. For illustration a feasible plant is sought for a linear dynamic model of an economy.