Some extremal problems in designing discriminating experiments

This paper is devoted to some properties of local T-optimaj. designs fox discriminating between two rival regression models. It is demonstrated that the problem of searching for an optimal design is closely connected with the problem of searching for a Tchebycheff extremal basis. The question raised concerns the number of supporting points in an optimal design.