Misra, K. B. (1971) Dynamic programming formulation of the redundancy allocation problem International Journal of Mathematical Education in Science and Technology, 2 (3). pp. 207-215. ISSN 0020-739X
Full text not available from this repository.
Official URL: http://www.informaworld.com/smpp/content~db=all~co...
Related URL: http://dx.doi.org/10.1080/0020739710020301
Abstract
Dynamic programming formulation for obtaining the optimum number of redundancies at each stage in a system is explained in detail. It is also emphasized and illustrated by examples, that the 'summation' form of functional equations, as suggested in the paper, provide a faster solution to an otherwise computationally voluminous method.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Taylor and Francis Ltd. |
| ID Code: | 19991 |
| Deposited On: | 20 Nov 2010 15:12 |
| Last Modified: | 08 Jun 2011 04:41 |
Repository Staff Only: item control page
