|
|||||
|
|
Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem |
|
| Authors: | L. Cayton R. Herring A. Holder J. Holzer C. Nightingale T. Stohs |
| Affiliation: | (1) University of California, San Diego, La Jolla, CA, USA;(2) Oberlin College, Oberlin, OH, USA;(3) Trinity University Mathematics, San Antonio, TX, USA;(4) University of Wisconsin, Madison, WI, USA;(5) Mills College, Oakland, CA, USA;(6) University of Nebraska-Lincoln, Lincoln, NE, USA |
| Abstract: | 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.All research was conducted at Trinity University and was supported by NSF Grant 0097366. |
| Keywords: | Multiple-objective linear programming Asymptotic programming Sign-solvability Nonsubstitution theorem Computational economics |
| 本文献已被 SpringerLink 等数据库收录！ | |