Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
Abstract This paper proposes an efficient heuristic approach to solving the constrained redundancy optimization problem in multi-state systems (MSS) with multi-state components using minimal path vectors. A discrete multi-state model is considered, where the system state depends on the discipline of the elements' interaction in the system. When the multi-state nature of the system is considered, exact solution methodologies e.g. Dynamic, Integer Programming are no longer valid. The proposed heuristic offers an efficient and straightforward analysis. To illustrate the simplicity and ease of the application of the algorithm, solutions of a flow network problem with linear constraint and, bridge structure with linear as well as nonlinear constraints are obtained. The results would be applicable to multi-state design problems in real life.
Economic Quality Control – de Gruyter
Published: Oct 1, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.