Abstract
In this paper we study the problem of universally reducing a multi-stage vector optimization problem to a one-stage vector optimization problem. Our analysis is restricted to the case of finite sets of alternatives, and thus has independent appeal from the stand point of finite/discrete mathematics as well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aizerman M.A. and Aleskerov F. “Theory of Choice”, North Holland (1995).
Aizerman M.A. and Malishevski A.V. “Conditions for Universal Reducibility of a Two-Stage Extremization Problem to a One-Stage Problem”, Journal of Mathematical Analysis and Applications, 119 (1986) 361–388.
Donaldson D. and Weymark J.A. “A Quasi ordering Is The Intersection of Orderings” Journal of Economic Theory, 78 (1998) 382–387.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lahiri, S. Reducing a Multi Stage Vector Optimization Problem to a Single Stage Vector Optimization Problem. OPSEARCH 37, 124–133 (2000). https://doi.org/10.1007/BF03398603
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398603