A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
From MaRDI portal
Publication:1727958
DOI10.1016/j.orl.2016.12.009zbMath1409.90174OpenAlexW2567031188MaRDI QIDQ1727958
Latif Pourkarimi, Abbas Sayadi-bander, Refail Kasimbeyli
Publication date: 21 February 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.12.009
Related Items (8)
Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces ⋮ Continuity of a scalarization in vector optimization with variable ordering structures and application to convergence of minimal solutions ⋮ Quasi-Newton methods for multiobjective optimization problems ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ Extension of Zoutendijk method for solving constrained multiobjective optimization problems ⋮ 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
Cites Work
- Characterization of approximate solutions of vector optimization problems with a variable order structure
- Properly optimal elements in vector optimization with variable ordering structures
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
- On approximate efficiency in multiobjective programming
- \(\epsilon\)-solutions in vector minimization problems
- Incorporating wealth information into a multiple criteria decision making model
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Combined forecasts in portfolio optimization: a generalized approach
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- A conic scalarization method in multi-objective optimization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Characterization of properly optimal elements with variable ordering structures
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods
- Variable Ordering Structures in Vector Optimization
- Separation via polyhedral conic functions
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Characterizations of variable domination structures via nonlinear scalarization
- Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
- Unnamed Item
- Unnamed Item
This page was built for publication: A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
