Bottleneck stability in path problems

Path problems are considered with a minimal functional which are determined on a space of rectangular matrices which specify numerical parameters. Numerous constraints imposed on the norm in this space define a fairly wide range of normalizing techniques to be used in discrete-time optimization problems. The stability of solutions to such problems is studied. Formulae and estimates are obtained for the stability radius.