Optimality and duality in constrained interval-valued optimization
From MaRDI portal
Publication:1728410
DOI10.1007/s10288-017-0369-8zbMath1407.90339OpenAlexW2781783988MaRDI QIDQ1728410
Publication date: 22 February 2019
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-017-0369-8
dualityconvexificatorsFritz John and Karush-Kuhn-Tucker optimality conditionsasymptotic pseudoconvexityasymptotic quasiconvexityinterval-valued optimization problemslocal LU-optimal solutions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items (14)
Necessary optimality conditions for interval optimization problems with functional and abstract constraints ⋮ New second-order optimality conditions for vector equilibrium problems with constraints in terms of contingent derivatives ⋮ The \(F\)-objective function method for differentiable interval-valued vector optimization problems ⋮ Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications ⋮ Sufficiency and duality for nonsmooth interval-valued optimization problems via generalized invex-infine functions ⋮ Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints ⋮ Duality for fractional interval-valued optimization problem via convexificator ⋮ Interval‐valued variational programming problem with Caputo–Fabrizio fractional derivative ⋮ Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints ⋮ Studniarski's derivatives and efficiency conditions for constrained vector equilibrium problems with applications ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions ⋮ On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints ⋮ Optimality and duality for second-order interval-valued variational problems
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-objective interval fractional programming problems: an approach for obtaining efficient solutions
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Sufficient optimality conditions and duality theory for interval optimization problem
- Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
- On sufficiency and duality for a class of interval-valued programming problems
- Scalarization and optimality conditions for vector equilibrium problems
- Nonsmooth analysis
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Necessary and sufficient conditions for efficiency via convexificators
- On interval-valued nonlinear programming problems
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Optimization and nonsmooth analysis
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Continuous generalized convex functions and their characterizations
- Convexificators and necessary conditions for efficiency
This page was built for publication: Optimality and duality in constrained interval-valued optimization
