Applications and Implementations of Continuous Robust Designs

In the literature concerning the construction of robust optimal designs, many resulting designs turn out to have densities. In practice, an exact design should tell the experimenter what the support points are and how many subjects should be allocated to each of these points. In particular, we consider a practical situation in which the number of support points allowed is constrained. We discuss an intuitive approach, which motivates a new implementation scheme that minimizes the loss function based on the Kolmogorov and Smirnov distance between an exact design and the optimal design having a density. We present three examples to illustrate the application and implementation of a robust design constructed: one for a nonlinear dose-response experiment and the other two for general linear regression. Additionally, we perform some simulation studies to compare the efficiencies of the exact designs obtained by our optimal implementation with those by other commonly used implementation methods.     

Some recent results for series system reliability

Asymptotic properties of key test results ate obtained. Some further results on the Lindstrom-Madden method are given, including a binomial-Poisson inequality, together with some numerical examples. Simplified proofs of some results of Pledger and Proschan (1971) and Nevius, Proschan and Sethuraman (1977) are provided and the listing of a FORTRAN program to calculate a lower bound to the 1-α lower confidence limit on the system reliability is given.     

Optimal dispatching control of an AGV in a JIT production system

This paper deals with an FMS (Flexible Manufacturing System) in a JIT (Just-In-Time) production system. The FMS consists of m workstations, one dispatching station and a single AGV (Automated Guided Vehicle). Each workstation has an input buffer of limited capacity and its processing times are distributed stochastically. When the processing of a new component starts at the workstation, a withdrawal Kanban attached to it is sent to the dispatching station. The AGV chooses one from workstations whose withdrawal Kanbans are accumulated at the dispatching station, and conveys a component with a withdrawal Kanban from the dispatching station to the workstation. The main purpose of this paper is to find an optimal dispatching policy of the AGV that maximizes the long-run expected average reward per unit time. The problem is formulated as a semi-Markov decision process and an optimal dispatching policy is computed. Numerical experiments are performed to make several comparisons.     

On minimax designs when there are two candidate models

This work is motivated by the need to find experimental designs which are robust under different model assumptions. We measure robustness by calculating a measure of design efficiency with respect to a design optimality criterion and say that a design is robust if it is reasonably efficient under different model scenarios. We discuss two design criteria and an algorithm which can be used to obtain robust designs. The first criterion employs a Bayesian-type approach by putting a prior or weight on each candidate model and possibly priors on the corresponding model parameters. We define the first criterion as the expected value of the design efficiency over the priors. The second design criterion we study is the minimax design which minimizes the worst value of a design criterion over all candidate models. We establish conditions when these two criteria are equivalent when there are two candidate models. We apply our findings to the area of accelerated life testing and perform sensitivity analysis of designs with respect to priors and misspecification of planning values.     

An evolutionary algorithm for A-optimal incomplete block designs

Evolutionary algorithms are heuristic stochastic search and optimization techniques with principles taken from natural genetics. They are procedures mimicking the evolution process of an initial population through genetic transformations. This paper is concerned with the problem of finding A-optimal incomplete block designs for multiple treatment comparisons represented by a matrix of contrasts. An evolutionary algorithm for searching optimal, or nearly optimal, incomplete block designs is described in detail. Various examples regarding the application of the algorithm to some well-known problems illustrate the good performance of the algorithm     

Optimal design for linear regression models in the presence of heteroscedasticity caused by random coefficients

Random coefficients may result in heteroscedasticity of observations. For particular situations, where only one observation is available per individual, we derive optimal designs based on the geometry of the design locus.     

Bounds on dispersion of order statistics based on dependent symmetrically distributed random variables

We consider a fixed number of arbitrarily dependent random variables with a common symmetric marginal distribution. For each order statistic based on the variables, we determine a common optimal bound, dependent in a simple way on the sample size and number of order statistics, for various measures of dispersion of the order statistics, expressed in terms of the same dispersion measure of the single original variable. The dispersion measures are connected with the notion of M-functional of a random variable location with respect to a symmetric and convex loss function. The measure is defined as the expected loss paid for the discrepancy between the M-functional and the variable. The most popular examples are the median absolute deviation and variance.     

Composite Forecasting: An Integrated Approach and Optimality Reconsidered

This article shows when the theoretical Lagrange multiplier solution for combining forecasts has a regression representation. This solution is not optimal in general because it imposes a restriction on an otherwise more general linear form. The optimal linear predictor based on N forecasts is presented. This predictor is or is not a regression function depending on whether the latter function is linear. I also show that the Lagrange multiplier solution may often be nearly optimal. Hence, when estimating a composite forecast, the restriction imposed by this solution may prove useful. This observation is supported in an empirical example.     

Comparison of Three Sampling Designs

Three sampling designs are considered for estimating the sum of k population means by the sum of the corresponding sample means. These are (a) the optimal design; (b) equal sample sizes from all populations; and (c) sample sizes that render equal variances to all sample means. Designs (b) and (c) are equally inefficient, and may yield a variance up to k times as large as that of (a). Similar results are true when the cost of sampling is introduced, and they depend on the population sampled.     

Managing Product Rollovers

We study the product rollover strategy decision, where a firm decides whether to phase out an old generation of a product to be replaced by a new with either a dual or single roll. Our model considers a final build of the old product and preannouncement of the new, and incorporates dynamic pricing and inventory decisions. We find that the optimal price path closely follows changes in reservation price curves for the two products over time. We also identify the drivers of the rollover strategy decision, finding that lower market risk (faster diffusion, higher market responsiveness to preannouncements) and higher performance improvement for the new generation are associated with the single roll strategy.