Optimality conditions for quasi-solutions of vector optimization problems

DOI10.1007/s10957-013-0393-6zbMath1374.90338OpenAlexW2039887265MaRDI QIDQ261981

Bienvenido Jiménez, Vicente Novo Sanjurjo, César Gutiérrez

Publication date: 29 March 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0393-6

zbMATH Keywords

scalarizationapproximate solutionvector optimization problemcoradiant setfree disposal setlimiting subdifferentialminimal quasi-solutionmultiplier rules

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (9)

Some properties of generalized oriented distance function and their applications to set optimization problems ⋮ Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization ⋮ A kind of equivalence of three nonlinear scalarization functions in vector optimization ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ On approximate optimality conditions for robust multi-objective convex optimization problems ⋮ Unnamed Item ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications ⋮ Generalized \({\varepsilon }\)-quasi solutions of set optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonconvex separation theorems and some applications in vector optimization
• A Brézis-Browder principle on partially ordered spaces and related ordering theorems
• Vector optimization problems via improvement sets
• The Ekeland variational principle for Henig proper minimizers and super minimizers
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
• Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
• Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
• Vector variational principle
• Variational methods in partially ordered spaces
• Near-subconvexlikeness in vector optimization with set-valued functions
• On the variational principle
• Improvement sets and vector optimization
• Existence and optimality conditions for approximate solutions to vector optimization problems
• Lagrange multiplier rules for approximate solutions in vector optimization
• Vector optimization. Set-valued and variational analysis.
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• Ekeland's Variational Principle for Set-Valued Functions
• Vector Optimization
• A unified vector optimization problem: complete scalarizations and applications
• Vector variational principles for set-valued functions
• Two Types of Approximate Saddle Points
• Lipschitz properties of the scalarization function and applications
• A Set-Valued Ekeland's Variational Principle in Vector Optimization
• Fuzzy necessary optimality conditions for vector optimization problems
• Nonconvex minimization problems
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• On lagrange-kuhn-tucker multipliers for pareto optimization problems
• Degrees of Efficiency and Degrees of Minimality
• Metric regularity and subdifferential calculus
• Necessary Suboptimality and Optimality Conditions via Variational Principles
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems

This page was built for publication: Optimality conditions for quasi-solutions of vector optimization problems