Nearest route problem (Q1584634): Difference between revisions

The author presents a straightforward dynamic programming approach for the following multistage optimization problem: given a target value, find a sequence of decisions such that the final outcome is as close as possible to the target value. The paper is illustrated by an example concerning paths in a layered network whose lengths should be as close as possible to a prescribed value (``nearest route problem'').