Approximate solutions of interval-valued optimization problems

zbMath1483.90183arXiv2012.02683MaRDI QIDQ5019102

Nguyen Van Tuyen

Publication date: 29 December 2021

Full work available at URL: https://arxiv.org/abs/2012.02683

zbMATH Keywords

existence theoremsapproximate solutionsinterval-valued optimizationKKT optimality conditions

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (4)

An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ A note on approximate proper efficiency in linear fractional vector optimization ⋮ On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities ⋮ On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate solutions of multiobjective optimization problems
• KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
• Ekeland's variational principle and its equivalent theorems in vector optimization
• Selected topics in robust convex optimization
• \(\epsilon\)-solutions in vector minimization problems
• Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
• Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
• The Karush-Kuhn-Tucker optimality conditions for multi-objective programming problems with fuzzy-valued objective functions
• Sufficiency and duality in non-smooth interval valued programming problems
• The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
• The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
• Multiobjective programming in optimization of the interval objective function
• Robust Convex Optimization
• Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
• Vector Variational Principles for Set-Valued Functions
• Systems of Inequalities Involving Convex Functions
• On AKKT optimality conditions for cone-constrained vector optimization problems
• Convex Analysis

This page was built for publication: Approximate solutions of interval-valued optimization problems