Duality theory for optimization problems with interval-valued objective functions
From MaRDI portal
Publication:965064
DOI10.1007/s10957-009-9613-5zbMath1198.90365OpenAlexW2146795783MaRDI QIDQ965064
Publication date: 21 April 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9613-5
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)
Related Items (32)
On interval-valued invex mappings and optimality conditions for interval-valued optimization problems ⋮ A mathematical programming approach to sample coefficient of variation with interval-valued observations ⋮ A note on the paper ``Duality theory for optimization problems with interval-valued objective functions ⋮ Reply to a note on the paper ``Duality theory for optimization problems with interval-valued objective functions ⋮ Optimality conditions and duality results for non-differentiable interval optimization problems ⋮ Sufficient optimality conditions and duality theory for interval optimization problem ⋮ The KKT optimality conditions for optimization problem with interval-valued objective function on Hadamard manifolds ⋮ Generalized Hukuhara Gâteaux and Fréchet derivatives of interval-valued functions and their application in optimization with interval-valued functions ⋮ Univex interval-valued mapping with differentiability and its application in nonlinear programming ⋮ Max-min distance nonnegative matrix factorization ⋮ Efficient solution of interval optimization problem ⋮ A variable and a fixed ordering of intervals and their application in optimization with interval-valued functions ⋮ Duality for fractional interval-valued optimization problem via convexificator ⋮ On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems ⋮ Optimality conditions for a class ofE-differentiable vector optimization problems with interval-valued objective functions underE-invexity ⋮ Duality theory in interval-valued linear programming problems ⋮ On interval-valued optimization problems with generalized invex functions ⋮ Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems ⋮ Solving the interval-valued optimization problems based on the concept of null set ⋮ The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function ⋮ On interval-valued pseudolinear functions and interval-valued pseudolinear optimization problems ⋮ Nonsmooth interval-valued optimization and saddle-point optimality criteria ⋮ Checking weak and strong optimality of the solution to interval convex quadratic program ⋮ A Newton method for capturing efficient solutions of interval optimization problems ⋮ Posynomial parametric geometric programming with interval valued coefficient ⋮ Unnamed Item ⋮ Applying the concept of null set to solve the fuzzy optimization problems ⋮ A saddle point characterization of efficient solutions for interval optimization problems ⋮ Solving nonlinear interval optimization problem using stochastic programming technique ⋮ Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function ⋮ On semidifferentiable interval-valued programming problems ⋮ Generalized-Hukuhara penalty method for optimization problem with interval-valued functions and its application in interval-valued portfolio optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- The symmetrical free vibrations of a thin elastic plate with initial condition as a generalized function
- Inexact linear programming with generalized resource sets
- A differential calculus for multifunctions
- Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods
- Technical Note—Exact Solutions of Inexact Linear Programs
- Composition and union of general algorithms of optimization
- Technical Note—Constraint Qualifications for Inexact Linear Programs
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Duality theory for optimization problems with interval-valued objective functions
