Su una estensione di un particolare modello (non lineare) per trasporti interni industriali.

Recently, by using the method of dynamic programming, M. Volpato determined a policy of minimized costs to supply many destinations from a single source, the transport costs being functions (linear or not linear) which satisfy only the condition of inferior semi-continuity. Among the feasible policies he admitted also the indireact shipping from source to destination (i.e. a policy, where a larger quantity than required is sent to certain destination, and the surplus is delivered to a destination which follows it in a given order). In this paper the problem is studied for the case in which there is more than one source, and the availability of every source is limited. In this case it is possible to consider the problem as a multi-stage process, and to solve again it by the method of dynamic programming. [ABSTRACT FROM AUTHOR]