Abstract:
The paper is concerned with identification of an extremal plant, a problem reducible to linear programming. Two solution methods are described, conditions for convergence of the algorithms are formulated and proved, the convergence rate is estimated.