Document Type

Post-Print

Publication Date

12-2006

Abstract

In this paper we investigate the asymptotic stability of dynamic, multipleobjective 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 extend a dynamic version of the Nonsubstitution Theorem.

Document Object Identifier (DOI)

10.1007/s00186-006-0095-z

Publication Information

Mathematical Methods of Operations Research

Included in

Mathematics Commons

Share

COinS