A conic scalarization method in multi-objective optimization

From MaRDI portal
Publication:2392759


DOI10.1007/s10898-011-9789-8zbMath1298.90095MaRDI QIDQ2392759

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


90C29: Multi-objective and goal programming


Related Items

Weak subgradient method for solving nonsmooth nonconvex optimization problems, Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches, Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods, The Nonlinear Separation Theorem and a Representation Theorem for Bishop–Phelps Cones, A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method, Quadratic scalarization for decomposed multiobjective optimization, Characterization of approximate solutions of vector optimization problems with a variable order structure, Properly optimal elements in vector optimization with variable ordering structures, Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure, A coradiant based scalarization to characterize approximate solutions of vector optimization problems 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, Duality in nonconvex vector optimization, Comparison of some scalarization methods in multiobjective optimization, Separation theorems for nonconvex sets and application in optimization, Existence and characterization theorems in nonconvex vector optimization, Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization, A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case



Cites Work