Solving the routing optimization problem using the dynamic programming method

The present paper studies the effect of inexact computations on the effecti veness of the routing version of dynamic programming in the problem of bypa ssing sections of multivalued mappings. We study a specific definition of t he general routing procedure in the bypass problem for substantially nonsta tionary performance indices and "reachability domains" when the sequential motion in the space of problems along the paths that are formed in conformi ty with the route being realized under conditions of several possible passa ges from the solution of one problem to the solution of the other. The meth ods thus developed can be applied to the problems of freight transportation and of locating radio equipment components on printed circuit boards, etc.