Un algoritmo per allocazioni ottimali di risorse in sistemi con vincoli lineari.

This paper presents a new algorithm to determ an optimal strategy for sistems with linear constrains. Such method is proved to be computationally efficient and to have minimal storage requirements. Contrary to dynamic programming, the state variable does not have to be discretized. The convergence is monotonic and it is realized in no more than (N+1)-steps, where N is the stages number. An example is solved and the results are presented in [6]. [ABSTRACT FROM AUTHOR]