Minimum effort approximation of the Pareto space of convex bi-criteria problems

DOI10.1023/A:1023993231971MaRDI QIDQ1405558zbMATH OpenOpenAlexFDO

Authors Yusheng Li, Georges M. Fadel, Vincent Y. Blouin, Margaret M. Wiecek

Publication date 25 August 2003

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1023993231971

zbMATH Keywords

approximationbi-criteria optimizationhyper-ellipsePareto set

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29)

Recommendations

• A method of approximating Pareto sets for assessments of implicit Pareto set elements
• Small approximate Pareto sets for biobjective shortest paths and other problems
• Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
• Tracing locally Pareto-optimal points by numerical integration
• Approximating Pareto curves using semidefinite relaxations

Cited in

(11)

• Approximating Pareto curves using semidefinite relaxations
• Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
• The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves
• Approximation methods in multiobjective programming
• An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
• Tracing locally Pareto-optimal points by numerical integration
• A method of approximating Pareto sets for assessments of implicit Pareto set elements
• On the calculation of a membership function for the solution of a fuzzy linear optimization problem
• scientific article; zbMATH DE number 614558 (Why is no real title available?)
• Optimality conditions in nondifferentiable fuzzy optimization
• An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems

Describes a project that uses

Uses Software

• NBI

This page was built for publication: Minimum effort approximation of the Pareto space of convex bi-criteria problems

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