Achieving System Reliability with the Fewest Identical Components
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 24, Issue 6
Abstract
enerally, redundancy allocation problems are NP-hard. This paper presents an explicit polynomially bounded algorithm for a special class of redundancy allocation models.
Authors and Affiliations
Benedict Nmah
Keywords
Related Articles
- EP ID EP322577
- DOI 10.9734/JAMCS/2017/36521
- Views 81
- Downloads 0
Research on the Dual Problem of Trust Region Bundle Method
With the rapid development of science and technology as well as the cross-integration between the various disciplines, the nonsmooth optimization problem plays an increasingly important role in operational research. In t...
Velocity Profiles of Unsteady Blood Flow through an Inclined Circular Tube with Magnetic Field
The present paper is devoted to study the flow of incompressible viscous, electrically conducting fluid (blood) in a rigid inclined circular tube with magnetic field. The blood is considered to be Newtonian fluid and the...
On a Discrete Time Semi-Markov Risk Model with Dividends and Stochastic Premiums
A discrete semi-Markov risk model with dividends and stochastic premiums is investigated. We derive recursive equations for the expected penalty function by using the technique of probability generating function. Finally...
A Stochastic Model of the Dynamics of Stock Price for Forecasting
In this work, a stochastic model of some selected stocks in the Nigerian Stock Exchange (NSE) is formulated. We considered four different stocks and their market prices. The likelihood of each change occurring in the sto...
Comparison of State-Estimation Algorithms for a Noise-Injected Lithium-ion Battery System
This paper deals with one of the most prominent problems in industrial prognostics, namely the estimation of the Remaining Useful Life (RUL) of the most popular industrial battery, viz., the lithium-ion battery. The pape...