Methods to find the most preferred element on a set of Pareto-optimal decisions

DOI10.1007/BF01068546MaRDI QIDQ4007428zbMATH OpenOpenAlexFDO

Authors Mikhail Mikhalevich

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01068546

zbMATH Keywords

Pareto-optimal decisionsStochastic interactive procedures

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29)

Cites work

• Analysis of the error tolerance of stochastic methods to find the most preferred element
• scientific article; zbMATH DE number 3275139 (Why is no real title available?)
• The stochastic quasigradient projection method

Cited in

(4)

• Finding preferred subsets of Pareto optimal solutions
• Arithmetic modeling of random processes and \(r\)-algorithms
• Constructing a Pareto front approximation for decision making
• Ordering Pareto-optima through majority voting

This page was built for publication: Methods to find the most preferred element on a set of Pareto-optimal decisions

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