A conic scalarization method in multi-objective optimization

From MaRDI portal
Revision as of 20:22, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2392759


DOI10.1007/s10898-011-9789-8zbMath1298.90095OpenAlexW2046254531MaRDI 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



Related Items

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