Generation of orthogonal fractional factorial designs (OFFDs) is an important and extensively studied subject in applied statistics. In this paper we show how searching for an OFFD that satisfies a set of constraints, expressed in terms of orthogonality between simple and interaction effects, is, in many applications, equivalent to solving an integer linear programming problem.We use a recent methodology, based on polynomial counting functions and strata, that represents OFFDs as the positive integer solutions of a system of linear equations. We use this system to set up an optimization problem where the cost function to be minimized is the size of the OFFD and the constraints are represented by the system itself. Finally we search for a solution using standard integer programming techniques. Some applications are also presented in the computational results section. It is worth noting that the methodology does not put any restriction either on the number of levels of each factor or on the orthogonality constraints and so it can be applied to a very wide range of designs, including mixed orthogonal arrays.

Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming / Fontana, Roberto. - In: COMPUTATIONAL STATISTICS. - ISSN 0943-4062. - STAMPA. - 28:1(2013), pp. 241-253. [10.1007/s00180-011-0296-7]

Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming.

FONTANA, ROBERTO
2013

Abstract

Generation of orthogonal fractional factorial designs (OFFDs) is an important and extensively studied subject in applied statistics. In this paper we show how searching for an OFFD that satisfies a set of constraints, expressed in terms of orthogonality between simple and interaction effects, is, in many applications, equivalent to solving an integer linear programming problem.We use a recent methodology, based on polynomial counting functions and strata, that represents OFFDs as the positive integer solutions of a system of linear equations. We use this system to set up an optimization problem where the cost function to be minimized is the size of the OFFD and the constraints are represented by the system itself. Finally we search for a solution using standard integer programming techniques. Some applications are also presented in the computational results section. It is worth noting that the methodology does not put any restriction either on the number of levels of each factor or on the orthogonality constraints and so it can be applied to a very wide range of designs, including mixed orthogonal arrays.
File in questo prodotto:
File Dimensione Formato  
10.1007_s00180-011-0296-7.pdf

non disponibili

Tipologia: Altro materiale allegato
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 462.39 kB
Formato Adobe PDF
462.39 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
2464780.pdf

accesso aperto

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 258.75 kB
Formato Adobe PDF
258.75 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11583/2464780
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo