Abstract:
We consider a discrete problem of the best uniform approximation of multivalued mapping by segment images by an algebraic polynomial with constraints upon the value of the approximating polynomial in several nodes of a grid. We establish a criterion of optimality of the solution, which is a generalization of the P. L. Chebyshev's alternance.