Name
Title | ||
|---|---|---|
Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem |
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s00186-006-0095-z | Math. Meth. of OR |
Keywords | DocType | Volume |
asymptotic stability | Journal | 64 |
Issue | ISSN | Citations |
3 | 1432-5217 | 0 |
PageRank | References | Authors |
0.34 | 6 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lawrence Cayton | 1 | 152 | 8.27 |
| R. Herring | 2 | 0 | 0.34 |
| A. Holder | 3 | 25 | 3.97 |
| J. Holzer | 4 | 0 | 0.34 |
| C. Nightingale | 5 | 0 | 0.34 |
| T. Stohs | 6 | 0 | 0.34 |