Optimality conditions for interval-valued univex programming
From MaRDI portal
Publication:2067765
DOI10.1186/s13660-019-2002-1zbMath1499.90265OpenAlexW2936910721MaRDI QIDQ2067765
Lifeng Li, Jianke Zhang, Chang Zhou
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2002-1
Convex programming (90C25) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (4)
Saddle-point optimality criteria involving (p, b, d)-invexity and (p, b, d)-pseudoinvexity in interval-valued optimisation problems ⋮ On semidifferentiable interval-valued programming problems ⋮ A new model of economic order quantity associated with a generalized conformable differential-difference operator ⋮ Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- On interval-valued invex mappings and optimality conditions for interval-valued optimization problems
- Higher order duality in multiobjective fractional programming with square root term under generalized higher order \((F, \alpha, \beta, \rho, \sigma, d)\)-V-type I univex functions
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Univex interval-valued mapping with differentiability and its application in nonlinear programming
- Generalized derivative and \(\pi \)-derivative for set-valued functions
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- On dual invex Ky Fan inequalities
- Wolfe duality for interval-valued optimization
- Generalized Hukuhara differentiability of interval-valued functions and interval differential equations
- On \(G\)-invex multiobjective programming. II: Duality
- On \(G\)-invex multiobjective programming. I: Optimality
- On sufficiency of the Kuhn-Tucker conditions
- Nondifferentiable minimax fractional programming under generalized univexity
- A note on Zadeh's extensions
- On fuzzy generalized convex mappings and optimality conditions for fuzzy weakly univex mappings
- Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
- Optimality conditions for generalized differentiable interval-valued functions
- Invex equilibrium problems
- Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- Optimality and duality with generalized convexity
- Efficient solution of interval optimization problem
- An approach for solving a fuzzy multiobjective programming problem
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- On interval-valued optimization problems with generalized invex functions
- The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function
- Mixed type duality for nondifferentiable multiobjective fractional programming under generalized \((d,\rho, \eta, \theta)\)-type 1 univex function
- Convex fuzzy mapping with differentiability and its application in fuzzy optimization
- On interval-valued nonlinear programming problems
- Sufficiency and duality in multiobjective programming under generalized type I functions
- Necessary and sufficient conditions in constrained optimization
- Invex functions and constrained local minima
- Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
- An Algorithm for Solving Interval Linear Programming Problems
- Some notes on weak subdifferential
- Generalized invexity and duality in multiobjective programming problems
This page was built for publication: Optimality conditions for interval-valued univex programming
