Optimality conditions and duality for interval-valued optimization problems using convexifactors
From MaRDI portal
Recommendations
- On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity
- Optimality and duality in constrained interval-valued optimization
- Duality for multiobjective fractional programming problem using convexifactors
- Optimality conditions and duality in nondifferentiable interval-valued programming
- On interval-valued optimization problems with generalized invex functions
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 823381 (Why is no real title available?)
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- A generalized derivative for calm and stable functions
- Convexifactors, generalized convexity and vector optimization
- Convexifactors, generalized convexity, and optimality conditions
- Convexificators and necessary conditions for efficiency
- Convexificators and strong Kuhn-Tucker conditions
- Duality for multiobjective fractional programming problem using convexifactors
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
- Hunting for a smaller convex subdifferential
- Multi-objective interval fractional programming problems: an approach for obtaining efficient solutions
- Necessary and sufficient conditions for efficiency via convexificators
- Necessary and sufficient optimality conditions for fractional multi-objective problems
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- On interval-valued nonlinear programming problems
- On interval-valued optimization problems with generalized invex functions
- On sufficiency and duality for a class of interval-valued programming problems
- Optimality condition and mixed duality for interval-valued optimization
- Optimality conditions for efficiency on nonsmooth multiobjective programming problems
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimization and nonsmooth analysis
- Sufficient optimality conditions and duality theory for interval optimization problem
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Cited in
(23)- Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
- Optimality Conditions and Wolfe Duality Results for LU-Efficiency in Differentiable Vector Optimization Problems with Multiple Interval-Valued Objective Function and Vanishing Constraints
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- Optimality conditions for a class ofE-differentiable vector optimization problems with interval-valued objective functions underE-invexity
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
- Optimality Conditions and Saddle Point Criteria for Fractional Interval-valued Optimization Problem via Convexificator
- Duality for fractional interval-valued optimization problem via convexificator
- Interval‐valued variational programming problem with Caputo–Fabrizio fractional derivative
- On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
- 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
- On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity
- Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
- Reply to a note on the paper ``Duality theory for optimization problems with interval-valued objective functions
- Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems
- Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems
- Optimality and duality in constrained interval-valued optimization
- Convex optimization of interval valued functions on mixed domains
- Wolfe duality for interval-valued optimization
- On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities
- On interval-valued bilevel optimization problems using upper convexificators
- Optimality, duality and saddle point criteria for a robust fractional interval-valued optimization problem with uncertain inequality constraints via convexificators
This page was built for publication: Optimality conditions and duality for interval-valued optimization problems using convexifactors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276276)
