Abstract
Here we further develop the results of the previous chapter on Pareto set reduction using given finite collections of mutually dependent information quanta about the DM’s preference relation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The dimension of a cone coincides with the dimension of the minimal subspace containing it.
- 2.
A generator (edge) of a polyhedral cone is a vector of the cone that is not representable in the form of a positive linear combination of two other vectors belonging to this cone (see Subcection 2.1.2). All edges form the minimal system of vectors generating a given cone.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Noghin, V.D. (2018). Pareto Set Reduction Based on Collections of Information Quanta. In: Reduction of the Pareto Set. Studies in Systems, Decision and Control, vol 126. Springer, Cham. https://doi.org/10.1007/978-3-319-67873-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-67873-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67872-6
Online ISBN: 978-3-319-67873-3
eBook Packages: EngineeringEngineering (R0)