Finding preferred subsets of Pareto optimal solutions

DOI10.1007/s10589-007-9070-8zbMath1146.90063OpenAlexW2080160223MaRDI QIDQ2427390

Gio K. Kao, Jacobson, Sheldon H.

Publication date: 13 May 2008

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9070-8

zbMATH Keywords

heuristicspost-optimality analysis

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ A multi-objective production smoothing model with compressible operating times ⋮ A new scalarization method for finding the efficient frontier in non-convex multi-objective problems ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems

Uses Software

• NIMBUS

Cites Work

• The normalized normal constraint method for generating the Pareto frontier
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• The maximum edge biclique problem is NP-complete
• Interactive multiobjective optimization system WWW-NIMBUS on the Internet
• A post-optimality analysis algorithm for multi-objective optimization
• Multicriteria Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding preferred subsets of Pareto optimal solutions