Approximate solutions of interval-valued optimization problems

zbMATH Open1483.90183arXiv2012.02683MaRDI QIDQ5019102FDOQ5019102

Authors: Nguyen Van Tuyen 

Publication date: 29 December 2021

Abstract: This paper deals with approximate solutions of an optimization problem with interval-valued objective function. Four types of approximate solution concepts of the problem are proposed by considering the partial ordering $LU$ on the set of all closed and bounded intervals. We show that these solutions exist under very weak conditions. Under suitable constraint qualifications, we derive Karush--Kuhn--Tucker necessary and sufficient optimality conditions for convex interval-valued optimization problems.

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

Recommendations

• The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
• Optimality conditions for interval valued optimization problems
• Interval-valued optimization problems based on different solution concepts
• On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
• The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function

zbMATH Keywords

approximate solutionsexistence theoremsinterval-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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex Analysis
• Robust optimization
• \(\epsilon\)-solutions in vector minimization problems
• Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
• 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
• Approximate solutions of multiobjective optimization problems
• Multiobjective programming in optimization of the interval objective function
• Vector variational principles for set-valued functions
• Title not available (Why is that?)
• Selected topics in robust convex optimization
• Robust convex optimization
• Title not available (Why is that?)
• KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
• Title not available (Why is that?)
• Systems of Inequalities Involving Convex Functions
• Ekeland's variational principle and its equivalent theorems in vector optimization
• Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
• Sufficiency and duality in non-smooth interval valued programming problems
• Title not available (Why is that?)
• The Karush-Kuhn-Tucker optimality conditions for multi-objective programming problems with fuzzy-valued objective functions
• Title not available (Why is that?)
• Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
• Title not available (Why is that?)
• On AKKT optimality conditions for cone-constrained vector optimization problems

Cited In (15)

• Title not available (Why is that?)
• A study of interval optimization problems
• On approximation of the best case optimal value in interval linear programming
• Characterization results of solutions in interval-valued optimization problems with mixed constraints
• 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
• Numerical solutions comparison for interval linear programming problems based on coverage and validity rates
• Existence of solution of constrained interval optimization problems with regularity concept
• Efficient solution of interval optimization problem
• On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
• Interval-valued optimization problems based on different solution concepts
• A note on approximate proper efficiency in linear fractional vector optimization
• Approximation of Value Efficient Solutions
• An approach to characterizing \(\epsilon\)-solution sets of convex programs
• Solving the interval-valued optimization problems based on the concept of null set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019102)