scientific article; zbMATH DE number 3564123
From MaRDI portal
Publication:4136368
zbMath0362.62077MaRDI QIDQ4136368
Jagdish N. Srivastava, D. V. Chopra
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
On the robustness of the optimum balanced \(2^ m\) factorial designs of resolution V (given by Srivastava and Chopra) in the presence of outliers ⋮ On the characteristic polynomial of the information matrix of balanced fractional \(s^ m\) factorial designs for resolution \(V_{p,q}\) ⋮ \(2^m\) fractional factorial designs of resolution V with high \(A\)-efficiency, \(7\leq m\leq 10\) ⋮ Weighted A-optimality for fractional \(2^m\) factorial designs of resolution \(V\) ⋮ A-optimal partially balanced fractional \(2^{m_ 1+m_ 2}\) factorial designs of resolution V, with \(4\leq m_ 1+m_ 2\leq 6\) ⋮ J.N. Srivastava and experimental design ⋮ On robustness of optimal balanced resolution V plans ⋮ Bounds on the number of constraints for balanced arrays of strength t ⋮ Fractional factorial designs of two and three levels ⋮ Robustness of balanced fractional \(2^ m\) factorial designs derived from simple arrays ⋮ On the robustness of balanced fractional \(2^ m\) factorial designs of resolution \(2l+1\) in the presence of outliers ⋮ More precise tables of optimal balanced \(2^ m\) fractional factorial designs of Srivastava and Chopra, 7\(\leq m\leq 10\) ⋮ On some optimal fractional \(2^ m \)factorial designs of resolution V ⋮ Search designs for \(2^ m\) factorials derived from balanced arrays of strength \(2(\ell +1)\) and AD-optimal search designs
This page was built for publication:
