A conic scalarization method in multi-objective optimization
From MaRDI portal
Publication:2392759
DOI10.1007/S10898-011-9789-8zbMATH Open1298.90095OpenAlexW2046254531MaRDI QIDQ2392759FDOQ2392759
Authors: Refail Kasimbeyli 
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
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
multi-objective optimizationproper efficiencycone separation theoremconic scalarization methodaugmented dual conesseparable conesublinear scalarizing functions
Cites Work
- Nonlinear multiobjective optimization
- On scalarizing functions in multiobjective optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- A Class of Solutions for Group Decision Problems
- Adaptive Scalarization Methods in Multiobjective Optimization
- A survey of recent developments in multiobjective optimization
- Separation via polyhedral conic functions
- Pareto optimality, game theory and equilibria
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Radial epiderivatives and set-valued optimization
- Advances in multicriteria analysis
- Title not available (Why is that?)
- A comparison of two reference point methods in multiple objective mathematical programming.
- The analytic hierarchy process and multiobjective 0--1 faculty course assignment
- Scalarization in vector optimization
- Combined forecasts in portfolio optimization: a generalized approach
- A modified weighted Tchebycheff metric for multiple objective programming
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- The modified subgradient algorithm based on feasible values
- On augmented Lagrangians for optimization problems with a single constraint
- Title not available (Why is that?)
- A multi-objective programming approach to 1.5-dimensional assortment problem
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
- Compromise solutions and estimation of the noninferior set
- A Characterization of Properly Minimal Elements of a Set
- Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
- Introducing oblique norms into multiple criteria programming
- Title not available (Why is that?)
Cited In (30)
- 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
- Separation theorem via superlinear functions and characterization of maximal elements in multiobjective optimization
- Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure
- Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches
- Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
- Cone contraction method with visual interaction for multiple‐objective non‐linear programmes
- An Adaptive Scalarization Method in Multiobjective Optimization
- Duality in nonconvex vector optimization
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case
- Separation theorems for nonconvex sets and application in optimization
- Characterization of approximate solutions of vector optimization problems with a variable order structure
- The nonlinear separation theorem and a representation theorem for Bishop-Phelps cones
- Quadratic scalarization for decomposed multiobjective optimization
- 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
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective 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)
