Abstract
Researchers in the past dealt with the optimization problem relating to deterministic opportunistic replacement problem. Complete solutions were obtained for a two component situation for both finite and infinite time horizon. For the multi-component opportunistic replacements with fixed time horizon, a mixed integer linear programming formulation is given in the literature. In this paper, a simplified alternative approach to solving the two-component problem is given. A Dynamic Programming approach to solve the two-component problem which can be extended to K-component situation is also discussed. The mixed integer programming formulation is modified and computational advantages are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
