An algorithm to solve integer programming problems: an efficient tool for reliability design

Misra, Krishna B. (1991) An algorithm to solve integer programming problems: an efficient tool for reliability design Microelectronics Reliability, 31 (2-3). pp. 285-294. ISSN 0026-2714

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/002627...

Related URL: http://dx.doi.org/10.1016/0026-2714(91)90214-R

Abstract

In many reliability design problems, the decision variables can only have integer values. The redundancy allocation is an example of one such problem; others include spare parts allocation, or repairmen allocation, which necessitate an integer programming formulation. In other words, integer programming plays an important role in system reliability optimization. In this paper, an algorithm is presented which provides an exact, simple and economical solution to any general class of integer programming problems and thereby offers reliability designers an efficient tool for system design. The algorithm can be used effectively to solve a wide variety of reliability design problems. The scope of use of this algorithm is also indicated and the procedure is illustrated by an example.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:19989
Deposited On:20 Nov 2010 15:12
Last Modified:07 Jun 2011 06:44

Repository Staff Only: item control page