Zur Approximation von Maximintests
It is well known that the problem to obtain a maximin size- α test Φ* can be formulated as an infinite linear programming problem, if the sample space or the parameter space is not finite. To approximate Φ* a series of finite linear programming problems is constructed such that its solution is feasable for the infinite problem and you can get an upper bound for the distance to an optimal solution.
Unable to display preview. Download preview PDF.