A conic scalarization method in multi-objective optimization
From MaRDI portal
Recommendations
- Conic scalarization method in multiobjective optimization and relations with other scalarization methods
- Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
- Conic scalarizations for approximate efficient solutions in nonconvex vector optimization problems
- On nonlinear scalarization in vector optimization
- Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- scientific article; zbMATH DE number 3522693 (Why is no real title available?)
- scientific article; zbMATH DE number 1784657 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- A Characterization of Properly Minimal Elements of a Set
- A Class of Solutions for Group Decision Problems
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A comparison of two reference point methods in multiple objective mathematical programming.
- A modified weighted Tchebycheff metric for multiple objective programming
- A multi-objective programming approach to 1.5-dimensional assortment problem
- A survey of recent developments in multiobjective optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Advances in multicriteria analysis
- An improved definition of proper efficiency for vector maximization with respect to cones
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Combined forecasts in portfolio optimization: a generalized approach
- Compromise solutions and estimation of the noninferior set
- Introducing oblique norms into multiple criteria programming
- Multicriteria Optimization
- Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
- Nonlinear multiobjective optimization
- On augmented Lagrangians for optimization problems with a single constraint
- On scalarizing functions in multiobjective optimization
- Pareto optimality, game theory and equilibria
- Proper Efficient Points for Maximizations with Respect to Cones
- Proper efficiency with respect to cones
- Radial epiderivatives and set-valued optimization
- Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
- Scalarization in vector optimization
- Separation via polyhedral conic functions
- The analytic hierarchy process and multiobjective 0--1 faculty course assignment
- The modified subgradient algorithm based on feasible values
Cited in
(30)- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
- Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems
- Nonlinear strict cone separation theorems in real normed spaces
- Conic scalarization method in multiobjective optimization and relations with other scalarization methods
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- Existence and characterization theorems in nonconvex vector optimization
- Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure
- Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
- Separation theorem via superlinear functions and characterization of maximal elements in multiobjective optimization
- Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches
- Cone contraction method with visual interaction for multiple‐objective non‐linear programmes
- An Adaptive Scalarization Method in Multiobjective Optimization
- Duality in nonconvex vector optimization
- A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- Separation theorems for nonconvex sets and application in optimization
- Characterization of approximate solutions of vector optimization problems with a variable order structure
- Quadratic scalarization for decomposed multiobjective optimization
- The nonlinear separation theorem and a representation theorem for Bishop-Phelps cones
- Properly optimal elements in vector optimization with variable ordering structures
- A unified scheme for scalarization in set optimization
- Comparison of some scalarization methods in multiobjective optimization
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- Multi-choice conic goal programming model-based network data envelopment analysis
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone
- A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method
- Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method
- A nonlinear scalarization method for multi-objective optimization problems
This page was built for publication: A conic scalarization method in multi-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392759)
