Open Access. Powered by Scholars. Published by Universities.®

Education Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 181 - 183 of 183

Full-Text Articles in Education

On Stochastic Comparisons Of Energy Functions With Applications, Broderick O. Oluyede Jan 2001

On Stochastic Comparisons Of Energy Functions With Applications, Broderick O. Oluyede

Department of Mathematical Sciences Faculty Publications

We develop simple methods for the stochastic comparisons of informational energy functions. We introduce modified informational energy functions and uncertainty of parameter functions are introduced for models with realistic parameter spaces. We present inequalities, comparisons, and applications including test procedures for testing the equality of informational energy functions. Some illustrative examples are also presented.


On Some Length Biased Inequalities For Reliability Measures, Broderick O. Oluyede Jan 2000

On Some Length Biased Inequalities For Reliability Measures, Broderick O. Oluyede

Department of Mathematical Sciences Faculty Publications

In this note, inequalities for length biased and the original residual life function and equilibrium distribution function with monotone hazard rate and mean residual life functions are derived. We also obtain estimates of the length biased probability density function and hazard function under random censoring. Finally, the Bayesian exponential reliability estimate under length biased sampling using a conjugate prior for the scale parameter is given.


Interior-Point Methods And Modern Optimization Codes, Goran Lesaja Nov 1999

Interior-Point Methods And Modern Optimization Codes, Goran Lesaja

Department of Mathematical Sciences Faculty Publications

During the last fifteen years we have witnessed an explosive development in the area of optimization theory due to the introduction and development of interior-point methods. This development has quickly led to the development of new and more efficient optimization codes. In this paper, the basic elements of interior-point methods for linear programming will be discussed as well as extensions to convex programming, complementary problems, and semidefinite programming. Interior-point methods are polynomial and effective algorithms based on Newton 's method. Since they have been introduced, the classical distinction between linear programming methods, based on the simplex algorithm, and those methods …