Pages that link to "Item:Q1134015"
From MaRDI portal
The following pages link to Compromise solutions and estimation of the noninferior set (Q1134015):
Displaying 25 items.
- An equivalent transformation of multi-objective optimization problems (Q513605) (← links)
- Value functions, domination cones and proper efficiency in multicriteria optimization (Q583121) (← links)
- Axiomatizations of the Euclidean compromise solution (Q637569) (← links)
- Some geometrical aspects of the efficient line in vector optimization (Q706931) (← links)
- Conic set-valued maps in vector optimization (Q878244) (← links)
- Polar conic set-valued map in vector optimization. Continuity and derivability (Q1035935) (← links)
- Parametric approximation problems arising in vector optimization (Q1078092) (← links)
- Characterizing the nondominated set by separable functions (Q1093551) (← links)
- Characterization of properly efficient solutions by generalized scalarization methods (Q1173016) (← links)
- Proper efficiency in nonconvex vector-maximization-problems (Q1179009) (← links)
- Pareto set reduction based on an axiomatic approach with application of some metrics (Q1682909) (← links)
- Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
- Combined forecasts in portfolio optimization: a generalized approach (Q1762047) (← links)
- On min-norm and min-max methods of multi-objective optimization (Q1777223) (← links)
- On information functions and their polars (Q1835643) (← links)
- Retrieval and use of the balance set in multiobjective global optimization (Q1962989) (← links)
- A conic scalarization method in multi-objective optimization (Q2392759) (← links)
- Scalarization in vector optimization (Q3328302) (← links)
- ε-approximate solutions in multiobjective optimization (Q4227987) (← links)
- On compromise solutions in multiple objective programming (Q4553879) (← links)
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem (Q4637508) (← links)
- Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches (Q5070621) (← links)
- Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method (Q5413898) (← links)
- Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors. (Q5929428) (← links)
- An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization (Q6564729) (← links)
