Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem

In this paper we investigate the asymptotic stability of dynamic, multiple-objective linear programs. In particular, we show that a generalization of the optimal partition stabilizes for a large class of data functions. This result is based on a new theorem about asymptotic sign-solvable systems. The stability properties of the generalized optimal partition are used to address a dynamic version of the nonsubstitution theorem.