A new sufficient condition for most rapid approach paths
We show that in some previous literature the most rapid approach theorems are incomplete. This is proved by providing a counterexample. We also introduce an additional condition that guarantees the optimality of the most rapid approach path.
scientific article; zbMATH DE number 3962583