Optimality conditions and duality for interval-valued optimization problems using convexifactors
From MaRDI portal
Publication:276276
DOI10.1007/s12215-015-0215-9zbMath1338.90318OpenAlexW1812679367MaRDI QIDQ276276
Jonaki Banerjee, Anurag Jayswal, Ioan M. Stancu-Minasian
Publication date: 3 May 2016
Published in: Rendiconti del Circolo Matemàtico di Palermo. Serie II (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12215-015-0215-9
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Generalized Hukuhara Gâteaux and Fréchet derivatives of interval-valued functions and their application in optimization with interval-valued functions, Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem, Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications, On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities, Duality for fractional interval-valued optimization problem via convexificator, Optimality conditions for a class ofE-differentiable vector optimization problems with interval-valued objective functions underE-invexity, Interval‐valued variational programming problem with Caputo–Fabrizio fractional derivative, Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints, Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems, Optimality and duality in constrained interval-valued optimization, Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints, Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints, Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems, On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-objective interval fractional programming problems: an approach for obtaining efficient solutions
- Sufficient optimality conditions and duality theory for interval optimization problem
- Duality for multiobjective fractional programming problem using convexifactors
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- On sufficiency and duality for a class of interval-valued programming problems
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
- Optimality conditions for efficiency on nonsmooth multiobjective programming problems
- Convexificators and strong Kuhn-Tucker conditions
- Convexifactors, generalized convexity, and optimality conditions
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Necessary and sufficient conditions for efficiency via convexificators
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- On interval-valued optimization problems with generalized invex functions
- On interval-valued nonlinear programming problems
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Necessary and sufficient optimality conditions for fractional multi-objective problems
- Optimality Condition and Mixed Duality for Interval-Valued Optimization
- Optimization and nonsmooth analysis
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- Convexifactors, generalized convexity and vector optimization
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Convexificators and necessary conditions for efficiency
