Linear Integer Programming and its Innovative Applications in Design of Experiments and Sample Surveys
18
Keywords:
Linear integer programming; Block designs; Balanced; Controlled Sampling; Distance balance; Inclusion probability.Abstract
Linear integer programming is a widely used optimization technique to solve various real life problems. The purpose of this article is to present some innovative applications of linear integer programming in the area of design of experiments and sample surveys. It is demonstrated how construction problems of various block designs and different classes of sampling plans can be solved using linear integer programming formulations.
Downloads
References
Avadhani, M.S., & Sukhatme, B.V. (1967). Controlled sampling with varying probabilities with and without replacement. *Australian Journal of Statistics*, *9*(1), 8–15.
Bose, R.C. (1939). On the construction of balanced incomplete block designs. *Annals of Eugenics*, *9*(4), 353–399.
Chen, D.-S., Batson, R.G., & Dang, Y. (2011). *Applied Integer Programming: Modeling and Solution*. John Wiley & Sons.
Cheng, C.-S., & Wu, C.-F. (1981). Nearly balanced incomplete block designs. *Biometrika*, *68*(2), 493–500.
Conforti, M., Cornuéjols, G., Zambelli, G., et al. (2014). *Integer Programming* (Vol. 271). Springer.
Fontana, R. (2013). Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming. *Computational Statistics*, *28*, 241–253.
Genova, K., & Guliashki, V. (2011). Linear integer programming methods and approaches–a survey. *Journal of Cybernetics and Information Technologies*, *11*(1), 1–25.
Hedayat, A.S., Rao, C.R., & Stufken, J. (1988). Sampling plans excluding contiguous units. *Journal of Statistical Planning and Inference*, *19*(2), 159–170.
John, J.A., & Mitchell, T.J. (1977). Optimal incomplete block designs. *Journal of the Royal Statistical Society: Series B (Methodological)*, *39*(1), 39–43.
Mandal, B.N., Gupta, V.K., & Parsad, R. (2014). Efficient incomplete block designs through linear integer programming. *American Journal of Mathematical and Management Sciences*, *33*(2), 110–124.
Mandal, B.N., & Koukouvinos, C. (2014). Optimal multi-level supersaturated designs through integer programming. *Statistics & Probability Letters*, *84*, 183–191.
Mandal, B.N., Parsad, R., & Gupta, V.K. (2008). Computer-aided construction of balanced sampling plans excluding contiguous units. *Journal of Statistics and Applications*, *3*(1–2).
Mandal, B.N., Parsad, R., & Gupta, V.K. (2010). Linear integer programming approach to construct distance balanced sampling plans. *Journal of Indian Society of Agricultural Statistics*, *64*(2), 303–312.
Mandal, B.N., Parsad, R., & Gupta, V.K. (2016). Cyclic circular balanced and strongly balanced crossover designs through integer programming. *Communications in Statistics: Theory and Methods*, *45*(4), 859–871.
Mandal, B.N., Parsad, R., Gupta, V.K., & Sud, U.C. (2009). A family of distance balanced sampling plans. *Journal of Statistical Planning and Inference*, *139*(3), 860–874.
Rao, J.N.K., & Nigam, A.K. (1990). Optimal controlled sampling designs. *Biometrika*, *77*(4), 807–814.
Schrijver, A. (1998). *Theory of Linear and Integer Programming*. John Wiley & Sons.
Stufken, J., Song, S.Y., See, K., & Driessel, K.R. (1999). Polygonal designs: Some existence and non‑existence results. *Journal of Statistical Planning and Inference*, *77*(1), 155–166.
Stufken, J., & Wright, J.H. (2001). Polygonal designs with blocks of size (k leq 10). *Metrika*, *54*(2), 179–184.
Tiwari, N., & Nigam, A. (1998). On two-dimensional optimal controlled selection. *Journal of Statistical Planning and Inference*, *69*(1), 89–100.
Tiwari, N., & Nigam, A. (2010). On two-dimensional optimal controlled nearest proportional to size sampling designs. *Statistical Methodology*, *7*(6), 601–613.
Wright, J.H., & Stufken, J. (2008). New balanced sampling plans excluding adjacent units. *Journal of Statistical Planning and Inference*, *138*(11), 3326–3335.