haku: @indexterm PLANNING MODELS / yhteensä: 165
viite: 54 / 165
| Tekijä: | Ozden, M. |
| Otsikko: | A dynamic planning technique for continuous activities under multiple resource constraints. |
| Lehti: | Management Science
1987 : OCT, VOL. 33:10, p. 1333-1347 |
| Asiasana: | RESOURCE ALLOCATION PLANNING MODELS DYNAMIC PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | Dynamic Programming is one of the most suitable solution procedures for planning problems which require the best allocation of resources to competing activities over a planning horizon. The solution technique developed here integrates the simplex search algorithm into the recursive calculations of dynamic programming in order to mitigate the course of dimensionality. This technique can be used in solution of planning problems, such as the multiple resource allocation problems which involve nondifferentiable and/or highly nonlinear performance functions. |
SCIMA