A conic scalarization method in multi-objective optimization
From MaRDI portal
Publication:2392759
DOI10.1007/s10898-011-9789-8zbMath1298.90095OpenAlexW2046254531MaRDI QIDQ2392759
Publication date: 2 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9789-8
multi-objective optimizationproper efficiencycone separation theoremconic scalarization methodaugmented dual conesseparable conesublinear scalarizing functions
Related Items (20)
Quadratic scalarization for decomposed multiobjective optimization ⋮ Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method ⋮ Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods ⋮ The Nonlinear Separation Theorem and a Representation Theorem for Bishop–Phelps Cones ⋮ Nonlinear Cone Separation Theorems in Real Topological Linear Spaces ⋮ Characterization of approximate solutions of vector optimization problems with a variable order structure ⋮ A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures ⋮ Properly optimal elements in vector optimization with variable ordering structures ⋮ Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems ⋮ A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems ⋮ Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization ⋮ Comparison of some scalarization methods in multiobjective optimization ⋮ Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure ⋮ Duality in nonconvex vector optimization ⋮ Separation theorems for nonconvex sets and application in optimization ⋮ A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ Existence and characterization theorems in nonconvex vector optimization
Cites Work
- Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
- A multi-objective programming approach to 1.5-dimensional assortment problem
- Pareto optimality, game theory and equilibria
- A modified weighted Tchebycheff metric for multiple objective programming
- An improved definition of proper efficiency for vector maximization with respect to cones
- Compromise solutions and estimation of the noninferior set
- Proper efficiency with respect to cones
- Nonlinear multiobjective optimization
- Introducing oblique norms into multiple criteria programming
- Combined forecasts in portfolio optimization: a generalized approach
- On augmented Lagrangians for optimization problems with a single constraint
- A comparison of two reference point methods in multiple objective mathematical programming.
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- On scalarizing functions in multiobjective optimization
- The analytic hierarchy process and multiobjective 0--1 faculty course assignment
- Advances in multicriteria analysis
- A survey of recent developments in multiobjective optimization
- Scalarization in vector optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A Characterization of Properly Minimal Elements of a Set
- Proper Efficient Points for Maximizations with Respect to Cones
- Radial epiderivatives and set-valued optimization
- The modified subgradient algorithm based on feasible values
- Multicriteria Optimization
- Separation via polyhedral conic functions
- A Class of Solutions for Group Decision Problems
- Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A conic scalarization method in multi-objective optimization
