Selective Maintenance in System Reliability with Random Costs of Repairing and Replacing the Components

In this paper we consider the problem of determining the optimum number of repairable and replaceable components to maximize a system's reliability when both, the cost of repairing the components and the cost of replacement of components by new ones, are random. We formulate it as a problem of non-linear stochastic programming. The solution is obtained through Chance Constrained programming. We also consider the problem of finding the optimal maintenance cost for a given reliability requirement of the system. The solution is then obtained by using Modified E-model. A numerical example is solved for both the formulations.     

A Combined Nonlinear Programming Model and Kibria Method for Choosing Ridge Parameter Regression

Ridge regression solves multicollinearity problems by introducing a biasing parameter that is called ridge parameter; it shrinks the estimates as well as their standard errors in order to reach acceptable results. Many methods are available for estimating a ridge parameter. This article has considered some of these methods and also proposed a combined nonlinear programming model and Kibria method. A simulation study has been made to evaluate the performance of the proposed estimators based on the minimum mean squared error criterion. The simulation study indicates that under certain conditions the proposed estimators outperform the least squares (LS) estimators and other popular existing estimators. Moreover, the new proposed model is applied on dataset that suffers also from the presence of heteroscedastic errors.     

Time Series Models for Count or Qualitative Observations

Time series sometimes consist of count data in which the number of events occurring in a given time interval is recorded. Such data are necessarily nonnegative integers, and an assumption of a Poisson or negative binomial distribution is often appropriate. This article sets ups a model in which the level of the process generating the observations changes over time. A recursion analogous to the Kalman filter is used to construct the likelihood function and to make predictions of future observations. Qualitative variables, based on a binomial or multinomial distribution, may be handled in a similar way. The model for count data may be extended to include explanatory variables. This enables nonstochastic slope and seasonal components to be included in the model, as well as permitting intervention analysis. The techniques are illustrated with a number of applications, and an attempt is made to develop a model-selection strategy along the lines of that used for Gaussian structural time series models. The applications include an analysis of the results of international football matches played between England and Scotland and an assessment of the effect of the British seat-belt law on the drivers of light-goods vehicles.     

A network algorithm for the exact treatment of the 2×k contingency table

A common statistical problem encountered in biomedical research is to test the hypothesis that the parameters of k binomial populations are all equal. An exact test of significance of this hypothesis is possible in principle, the appropriate null distribution being a normalized product of k binomial coefficients. However, the problem of computing the tail area of this distribution can be formidable since it requires the enumeration of all sets of k binomial coefficients whose product is less than a given constant. Existing algorithms, all of which rely on explicit enumeration to generate feasible binomial coefficients     

The best subset of parameters in min-max linear regression

These Fortran-77 subroutines provide building blocks for Generalized Cross-Validation (GCV) (Craven and Wahba, 1979) calculations in data analysis and data smoothing including ridge regression (Golub, Heath, and Wahba, 1979), thin plate smoothing splines (Wahba and Wendelberger, 1980), deconvolution (Wahba, 1982d), smoothing of generalized linear models (O'sullivan, Yandell and Raynor 1986, Green 1984 and Green and Yandell 1985), and ill-posed problems (Nychka et al., 1984, O'sullivan and Wahba, 1985). We present some of the types of problems for which GCV is a useful method of choosing a smoothing or regularization parameter and we describe the structure of the subroutines.Ridge Regression: A familiar example of a smoothing parameter is the ridge parameter X in the ridge regression problem which we write.     

Combinatoric classification of multivariate normal variates

Consider classifying an n × I observation vector as coming from one of two multivariate normal distributions which differ both in mean vectors and covariance matrices. A class of dis-crimination rules based upon n independent univariate discrim-inate functions is developed yielding exact misclassification probabilities when the population parameters are known. An efficient search of this class to select the procedure with minimum expected misclassification is made by employing an algorithm of the implicit enumeration type used in integer programming. The procedure is applied to the classification of male twins as either monozygotic or dizygotic.     

A multivariate solution of the multivariate ranking and selection problem

The problem of selection of the best multivariate population is given a new formulation which does not involve reducing the populations to univariate quantities. This formulation's solution is developed for known, and (using the Heteroscedastic Method) also for unknown, variance-covariance matrices. Preference reversals and arbitrary nonlinear preference functions are explicitly allowed in this new theory     

Testing for Stochastic Dominance Efficiency

We consider consistent tests for stochastic dominance efficiency at any order of a given portfolio with respect to all possible portfolios constructed from a set of assets. We justify block bootstrap approaches to achieve valid inference in a time series setting. The test statistics are computed using linear and mixed integer programming formulations. Monte Carlo results show that the bootstrap procedure performs well in finite samples. The empirical application reveals that the Fama and French market portfolio is first and second-order stochastic dominance efficient, although it is mean–variance inefficient.     

Extension of the pool-adjacent-violators algorithm

The pool-adjacent-violators algorithm (PAVA) is an efficient algorithm which converges in a finite number of steps. However, it has been applicable so far only in isotonic regression with the simple order. This report extends its applicability to other quadratic programming problems, including certain one-sided multivariate testing problems and concave regression problems.     

A counterexample to Beder's conjectures about Hadamard matrices

In this note we provide a counterexample which resolves conjectures about Hadamard matrices made in this journal. Beder [1998. Conjectures about Hadamard matrices. Journal of Statistical Planning and Inference 72, 7–14] conjectured that if H$\mathit{H}$ is a maximal m×n$m\times n$ row-Hadamard matrix then m is a multiple of 4; and that if n   is a power of 2 then every row-Hadamard matrix can be extended to a Hadamard matrix. Using binary integer programming we obtain a maximal 13×32$13\times 32$ row-Hadamard matrix, which disproves both conjectures. Additionally for n being a multiple of 4 up to 64, we tabulate values of m   for which we have found a maximal row-Hadamard matrix. Based on the tabulated results we conjecture that a m×n$m\times n$ row-Hadamard matrix with m?n-7$m?n-7$ can be extended to a Hadamard matrix.