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. Copyright Springer-Verlag 2006

MoreLess

Year of publication:	2006
Authors:	Cayton, L. ; Herring, R. ; Holder, A. ; Holzer, J. ; Nightingale, C. ; Stohs, T.
Published in:	Mathematical Methods of Operations Research. - Springer. - Vol. 64.2006, 3, p. 541-555
Publisher:	Springer
Subject:	Multiple-objective linear programming \| Asymptotic programming \| Sign-solvability \| Nonsubstitution theorem \| Computational economics

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010950314