Approximate solutions of interval-valued optimization problems
From MaRDI portal
Publication:5019102
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 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.
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
Cites work
- scientific article; zbMATH DE number 5982713 (Why is no real title available?)
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 6520257 (Why is no real title available?)
- scientific article; zbMATH DE number 1241506 (Why is no real title available?)
- scientific article; zbMATH DE number 503301 (Why is no real title available?)
- scientific article; zbMATH DE number 6731400 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Approximate solutions of multiobjective optimization problems
- Convex Analysis
- Ekeland's variational principle and its equivalent theorems in vector optimization
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Multiobjective programming in optimization of the interval objective function
- On AKKT optimality conditions for cone-constrained vector optimization problems
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
- Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
- Robust convex optimization
- Robust optimization
- Selected topics in robust convex optimization
- Sufficiency and duality in non-smooth interval valued programming problems
- Systems of Inequalities Involving Convex Functions
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- The Karush-Kuhn-Tucker optimality conditions for multi-objective programming problems with fuzzy-valued objective functions
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- Vector variational principles for set-valued functions
- \(\epsilon\)-solutions in vector minimization problems
Cited in
(15)- scientific article; zbMATH DE number 4083400 (Why is no real title available?)
- 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
- Efficient solution of interval optimization problem
- Existence of solution of constrained interval optimization problems with regularity concept
- 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)
