Pareto set reduction based on an arbitrary finite collection of numerical information on the preference relation

DOI10.1134/S1064562411030288zbMATH Open1236.90017MaRDI QIDQ656363FDOQ656363

Authors: O. V. Baskov, Vladimir D. Noghin 

Publication date: 17 January 2012

Published in: Doklady Mathematics (Search for Journal in Brave)

Recommendations

• Reduction of the Pareto set based on some compound information on the relative importance of criteria
• Pareto set reduction based on an axiomatic approach with application of some metrics
• scientific article; zbMATH DE number 3948016
• On Degree of Pareto Set Reduction Using Information Quanta
• Approximation of Pareto set on the basis of inexact information
• Approximating the Pareto optimal set using a reduced set of objective functions
• Particular structures of the Pareto set and its reduction in bicriteria discrete problems
• On the approximation of a pareto set
• scientific article; zbMATH DE number 3910156
• The reduction of the Pareto set of a special structure in bicriteria discrete problems

zbMATH Keywords

Edgeworth-Pareto principledecision maker (DM)multicriteria choice problem

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06)

Cited In (5)

• Higher and lower-level knowledge discovery from Pareto-optimal sets
• Multicriteria Group Choice via Majority Preference Relation Based on Cone Individual Preference Relations
• On Degree of Pareto Set Reduction Using Information Quanta
• Some properties of fuzzy dual cones
• Algorithm for recalculating the generatrix lines of a finitely generated fuzzy cone after adding a generatrix to its dual cone

This page was built for publication: Pareto set reduction based on an arbitrary finite collection of numerical information on the preference relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656363)