Suchergebnisse

AbstractAn algorithm is derived for allocating finite resources in discrete amounts to a number of activities subject to a set of nonlinear constraints. The algorithm differs from those previously described in that the amount of the resource consumed for an additional unit of any one activity need not be constant. The algorithm is then applied to the problem of allocating a spares budget when repair of failed subsystems is allowed and the cost of unit subsystems is a function of the number to be spared. Two models are presented: one with an unrestricted repair facility, exponential failure distributions, and general repair distributions; and another with more limited repair and exponential failure and repair distributions.