Unbiased approximation in multicriteria optimization
From MaRDI portal
Publication:1812292
DOI10.1007/s001860200217zbMath1064.90042OpenAlexW1989707854MaRDI QIDQ1812292
Margaret M. Wiecek, Jørgen Tind, Kathrin Klamroth
Publication date: 23 June 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860200217
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (21)
On upper approximations of Pareto fronts ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ An improved algorithm for solving biobjective integer programs ⋮ An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy ⋮ On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods ⋮ Constrained optimization using multiple objective programming ⋮ Computing the Set of Approximate Solutions of a Multi-objective Optimization Problem by Means of Cell Mapping Techniques ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Outer approximation algorithms for convex vector optimization problems ⋮ An Image Set-Oriented Method for the Numerical Treatment of Bi-Level Multi-objective Optimization Problems ⋮ Multicriteria optimization with a multiobjective golden section line search ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ Pareto optimization or cascaded weighted sum: a comparison of concepts ⋮ A simple method for approximating a general Pareto surface ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ Pareto navigator for interactive nonlinear multiobjective optimization ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ Solving generalized convex multiobjective programming problems by a normal direction method
This page was built for publication: Unbiased approximation in multicriteria optimization
