A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
type: Item
instance of: scholarly article
title: A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
zbMATH Open document ID: 1409.90174
published in: Operations Research Letters
publication date: 2019-02-21T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7027293
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: $\varepsilon$-efficiency
zbMATH Keywords: variable ordering structures
zbMATH Keywords: scalarization
author: Abbas Sayadi-bander
author: Refail Kasimbeyli
author: L. Pourkarimi
MaRDI profile type: Publication
full work available at URL: j.orl.2016.12.009
OpenAlex ID: W2567031188
cites work: Q5269137
cites work: Approximate Pareto sets of minimal size for multi-objective optimization problems
cites work: Characterizations of variable domination structures via nonlinear scalarization
cites work: ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
cites work: Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
cites work: Variable Ordering Structures in Vector Optimization
cites work: Characterization of properly optimal elements with variable ordering structures
cites work: Properly optimal elements in vector optimization with variable ordering structures
cites work: Separation via polyhedral conic functions
cites work: Approximating the Pareto set of multiobjective linear programs via robust optimization
cites work: A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
cites work: On approximate efficiency in multiobjective programming
cites work: Incorporating wealth information into a multiple criteria decision making model
cites work: A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
cites work: A conic scalarization method in multi-objective optimization
cites work: Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods
cites work: A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
cites work: Q3860434
cites work: \(\epsilon\)-solutions in vector minimization problems
cites work: Characterization of approximate solutions of vector optimization problems with a variable order structure
cites work: Combined forecasts in portfolio optimization: a generalized approach
cites work: Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
DOI: 10.1016/J.ORL.2016.12.009
description: scientific article; zbMATH DE number 7027293