A linear programming bound for orthogonal arrays with mixed levels
From MaRDI portal
Publication:1361727
DOI10.1016/S0378-3758(96)00025-0zbMATH Open0873.05023OpenAlexW2092198847MaRDI QIDQ1361727FDOQ1361727
Authors: N. J. A. Sloane, John Stufken
Publication date: 20 October 1997
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-3758(96)00025-0
Recommendations
Cites Work
- Title not available (Why is that?)
- Mixed orthogonal arrays for variance estimation with unequal numbers of primary selections per stratum
- The Geometry of Two-Weight Codes
- On the construction of asymmetrical orthogonal arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear programming bound for orthogonal arrays with mixed levels
- Orthogonal arrays with variable numbers of symbols
- Title not available (Why is that?)
- Construction of \(2^ m4^ n\) designs via a grouping scheme
- Nearly Orthogonal Arrays with Mixed Levels and Small Runs
- Title not available (Why is that?)
- Some Orthogonal Main-Effect Plans for Asymmetrical Factorials
- Some Main-Effect Plans and Orthogonal Arrays of Strength Two
- Title not available (Why is that?)
Cited In (27)
- Linear programming bounds for balanced arrays
- Generalized wordtype pattern for nonregular factorial designs with multiple groups of factors
- Theory of optimal blocking of nonregular factorial designs
- Parameter inequalities for orthogonal arrays with mixed levels
- Characterization of minimum aberration mixed factorials in terms of consulting designs
- On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
- A search of maximum generalized resolution quaternary-code designs via integer linear programming
- Theory of optimal blocking of \(2^{n-m}\) designs
- A Note on the Construction of Near-Orthogonal Arrays with Mixed Levels and Economic Run Size
- A scientific tour on orthogonal arrays
- Generalized minimum aberration for asymmetrical fractional factorial designs
- Generalized minimum aberration for asymmetrical fractional factorial designs.
- Theory of minimum aberration blocked regular mixed factorial designs
- Construction of uniform \(U\)-designs
- Approximation of bounds on mixed-level orthogonal arrays
- Uniformity in factorial designs with mixed levels
- A note on the connection between uniformity and generalized minimum aberration
- An application of information theory and error-correcting codes to fractional factorial experiments
- The lattice of \(N\)-run orthogonal arrays
- A linear programming bound for orthogonal arrays with mixed levels
- Design of experiments: useful orthogonal arrays for number of experiments from 4 to 16
- Some \(LP\) algorithms using orthogonal matrices
- Commutative association schemes
- Exact solutions to linear programming problems
- Improved WLP and GWP lower bounds based on exact integer programming
- Optimal Additions to and Deletions from Two-Level Orthogonal Arrays
- Title not available (Why is that?)
Uses Software
This page was built for publication: A linear programming bound for orthogonal arrays with mixed levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361727)