Coradiant-valued maps and approximate solutions in variable ordering structures

DOI10.1007/s41980-018-0076-zzbMath1409.90173OpenAlexW2809113754WikidataQ129648396 ScholiaQ129648396MaRDI QIDQ1734112

Hadi Basirzadeh, Latif Pourkarimi, Abbas Sayadi-bander

Publication date: 22 March 2019

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-018-0076-z

zbMATH Keywords

multiobjective optimizationscalarization\(\varepsilon \)-efficiencyvariable-ordering structure

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical procedures in multiobjective optimization with variable ordering structures
• Characterization of approximate solutions of vector optimization problems with a variable order structure
• Optimal elements in vector optimization with a variable ordering structure
• On approximate efficiency in multiobjective programming
• Variable preference modeling with ideal-symmetric convex cones
• \(\epsilon\)-solutions in vector minimization problems
• An improved definition of proper efficiency for vector maximization with respect to cones
• Proper efficiency with respect to cones
• A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
• Approximating the Pareto set of multiobjective linear programs via robust optimization
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• Approximation of solutions for location problems
• Scalarizing vector optimization problems
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
• Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
• Vector complementarity problems with a variable ordering relation
• Vector optimization. Set-valued and variational analysis.
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• Proper Efficient Points for Maximizations with Respect to Cones
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
• Characterizations of variable domination structures via nonlinear scalarization