Compromise solutions and estimation of the noninferior set

DOI10.1007/BF00933599zbMath0422.90074MaRDI QIDQ1134015

William B. Gearhart

Publication date: 1979

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

zbMATH Keywords

vector optimizationmulticriteria optimizationcompromise solutionmaximum normefficient pointsPareto optimal pointsestimation of the noninferior setnoninferior points

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
• Compromise solutions, domination structures, and Salukvadze's solution
• Proper efficiency and the theory of vector maximization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• The Attribute-Dynamic Attitude Model (Adam)
• Some New Results on Compromise Solutions for Group Decision Problems
• A Class of Solutions for Group Decision Problems

Related Items (25)

Parametric approximation problems arising in vector optimization ⋮ Characterizing the nondominated set by separable functions ⋮ On compromise solutions in multiple objective programming ⋮ Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches ⋮ A conic scalarization method in multi-objective optimization ⋮ Conic set-valued maps in vector optimization ⋮ Pareto set reduction based on an axiomatic approach with application of some metrics ⋮ Axiomatizations of the Euclidean compromise solution ⋮ Retrieval and use of the balance set in multiobjective global optimization ⋮ Characterization of properly efficient solutions by generalized scalarization methods ⋮ Proper efficiency in nonconvex vector-maximization-problems ⋮ The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem ⋮ An equivalent transformation of multi-objective optimization problems ⋮ Reference points and approximation algorithms in multicriteria discrete optimization ⋮ Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method ⋮ Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors. ⋮ Scalarization in vector optimization ⋮ Combined forecasts in portfolio optimization: a generalized approach ⋮ Some geometrical aspects of the efficient line in vector optimization ⋮ On min-norm and min-max methods of multi-objective optimization ⋮ Value functions, domination cones and proper efficiency in multicriteria optimization ⋮ An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization ⋮ Polar conic set-valued map in vector optimization. Continuity and derivability ⋮ On information functions and their polars ⋮ ε-approximate solutions in multiobjective optimization

This page was built for publication: Compromise solutions and estimation of the noninferior set