Finding Short Paths on Simple Polytopes

Alexander E. Black, Raphael Steiner

We prove that computing a shortest monotone path to the optimum of a linear program over a simple polytope is NP-hard, thus resolving a 2022 open question of De Loera, Kafer, and S…