Weighting factor results in vector optimization
This paper deals with the study, in a convex vector optimization problem, of the set of efficient solutions and the set of properly efficient solutions, the latter being obtained by a weighting factor technique. Relationships between these two sets are discussed; they are shown to be nonempty when the objective functions have no common direction of recession and to be closed and equal when, moreover, the objective functions are locally polyhedral. An example is provided where the set of efficient solutions is not included in the closure on the nonempty set of properly efficient solutions.
- On the choice of parameters for the weighting method in vector optimization
- Multiple‐objective weighting factor auxiliary optimization problems
- New results on proper efficiency for a class of vector optimization problems
- On convex vector optimization problems with possibilistic weights
- scientific article; zbMATH DE number 1424327
- An improved definition of proper efficiency for vector maximization with respect to cones
- Conditions for Convexity of Quasiconvex Functions
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Constrained minimization under vector-valued criteria in finite dimensional spaces
- Convex Analysis
- Existence of efficient solutions for vector maximization problems
- scientific article; zbMATH DE number 3837946 (Why is no real title available?)
- scientific article; zbMATH DE number 3891125 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 4033496 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- Images of connected sets by semicontinuous multifunctions
- Multi-Objective Interactive Programming
- On polyhedral extension of some LP theorems
- Points minimaux et ensembles optimaux dans les espaces de Banach
- Polyhedral extensions of some theorems of linear programming
- Problems and methods with multiple objective functions
- Proper efficiency and the theory of vector maximization
- Proper Efficient Points for Maximizations with Respect to Cones
- Sets of efficient points in a normed space
- Some characterizations of convex polyhedra
- The structure of admissible points with respect to cone dominance
- On convex vector optimization problems with possibilistic weights
- On the choice of parameters for the weighting method in vector optimization
- The effects of adding objectives to an optimisation problem on the solution set
- Robust multiobjective optimization \& applications in portfolio optimization
- Meilleure approximation en norme vectorielle et théorie de la localisation
- Set optimization with weighted criteria and efficiency
- Multiple‐objective weighting factor auxiliary optimization problems
- Stochastic multiobjective optimization: Sample average approximation and applications
- Multicriteria approach to bilevel optimization
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
This page was built for publication: Weighting factor results in vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093548)
