A new class of stagewise rejective test procedures is proposed for the multiple test problem consisting of n ≥ 2 pairs of null and alternative hypotheses with mutually independent test statistics. The members of this class, called stagewise rejective linear minmax tests, are generated by the closing principle applied to global combination tests whose corresponding test statistics are linear combinations of the minimum, P
(1), and the maximum, P
(n), of the p-values associated with the single tests. The respective weights are determined by a single parameter k ∈ [0,1] and the level α. The well-known test based exclusively on P
(1) proposed by Tippett (1931) is a special case (K = 0); its extension to a multiple test is due to Holm (1979). On the other hand, the test for K = 1 rejects the global null hypothesis if (1 − α)P
(1) + αP(n) ≤ α. It is shown that all tests of the class exhaust the multiple level a and therefore cannot be improved uniformly. Their relative merits have to be judged by means of power functions for multiple test procedures. Such functions are presented and discussed in a more general context. The expected number of correctly rejected null hypotheses is recommended as a relatively simple and comprehensive way to summarize the performance of multiple tests. The various power functions are illustrated by their application to three members of the class (k = 0, 0.9, 1) and to the Simes-Hommel test by means of simulations. For the simultaneous test with k = 1 numerical derivations of the power functions are presented. On the basis of these results, it is argued that the stagewise rejective linear minmax test with k = 0.9 has a performance that is always close to that of the best performing competitor and is therefore to be recommended when little a priori information on the number and type of possible alternatives is available.