Dynamic programming is a multi-stage optimization method that is applicable to many problems in engineering. A statistical perspective of value function approximation in highdimensional, continuous-state stochastic dynamic programming (SDP) was first presented using orthogonal array (OA) experimental designs and multivariate adaptive regression splines (MARS). Given the popularity of artificial...

A general method for constructing asymmetric orthogonal arrays of arbitrary strength is proposed. Application of this method is made to obtain several new families of tight asymmetric orthogonal arrays of strength three. A procedure for replacing a column with 2 symbols in an orthogonal array of strength three by several 2-symbol columns, without disturbing the orthogonality of the array, leads...

In this paper we list some new orthogonal main e ects plans for three level designs for and factors in runs and compare them with designs obtained from the existing L orthogonal array We show that these new designs have better projection properties and can provide better parameter estimates for a range of possible models Additionally we study designs in other smaller run sizes when there are in...

In order to produce any product with desired quality by machining, proper selection of process parameters is essential. This can be accomplished by Full Factorial method. The aim of the present work is to investigate the effect of process parameter on surface finish and material removal rate (MRR) to obtain the optimal setting of these process parameters and the analysis of variance is also use...

We have performed a shape optimization of the disc in an industrial double-eccentric butterfly valve using the effect analysis of design variables to enhance the valve performance. For the optimization, we select three performance quantities such as pressure drop, maximum stress, and mass (weight) as the responses and three dimensions regarding the disc shape as the design variables. Subsequent...

This paper describes the application of a combined orthogonal array design and overlapping resolution mapping to the optimization of miceller electrokinetic chromatography for the separation of 10 substituted benzenes. The most important factors were first determined according to an OA16(2(15)) through 16 pre-designed experiments; a second set of experiments was carried out according to a trian...

Mixed orthogonal arrays of strength two and size s are constructed by grouping points in the finite projective geometry . can be partitioned into   1, PG mn s   1, PG mn s       1 1 mn n s s         –1 n -flats such that each   –1 n flat is associated with a point in . An orthogonal array  1, n PG m s        1 1 mn n mn s s n s L s         can be constructed ...

In this paper, the problem of target detection in phased-MIMO radars is considered and target detection performance of phased-MIMO radars is compared with MIMO and phased-array radars. Phased-MIMO radars combine advantages of the MIMO and phased-array radars. In these radars, the transmit array will be partitioned into a number of subarrays that are allowed to overlap and each subarray transmit...

When an orthogonal array is projected on a small number of factors, as is done in screening experiments, the question of interest is the structure of the projected design, by which we mean its decomposition in terms of smaller arrays of the same strength. In this paper we investigate the decomposition of arrays of strength t having t + 1 factors. The decomposition problem is well-understood for...

It is well-known that all orthogonal arrays of the form OA(N, t+1, 2, t) are decomposable into λ orthogonal arrays of strength t and index 1. While the same is not generally true when s = 3, we will show that all simple orthogonal arrays of the form OA(N, t + 1, 3, t) are also decomposable into orthogonal arrays of strength t and index 1.