On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity
DOI10.3934/jimo.2017081zbMath1415.90119OpenAlexW2759333240MaRDI QIDQ1717000
Publication date: 5 February 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2017081
dualityoptimality conditioninterval-valued functionClarke sub-differentiabilityG-\((F, \rho)\) convexity
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Uncertainty degree and modeling of interval type-2 fuzzy sets: definition, method and application
- On sufficiency and duality for a class of interval-valued programming problems
- Nonsmooth interval-valued optimization and saddle-point optimality criteria
- Wolfe duality for interval-valued optimization
- More on subgradient duality
- On sufficiency of the Kuhn-Tucker conditions
- Inexact linear programming with generalized resource sets
- Calculating the exact bounds of optimal values in LP with interval coefficients
- Multiobjective programming in optimization of interval objective functions -- a generalized approach
- PROMISE/scenarios: an interactive method for multiobjective stochastic linear programming under partial uncertainty.
- On comparing interval numbers
- Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
- Optimality and duality for the multiobjective fractional programming with the generalized \((F,\rho)\) convexity.
- Optimality conditions and duality in nondifferentiable interval-valued programming
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- A nonlinear interval number programming method for uncertain optimization problems
- On interval-valued nonlinear programming problems
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- Optimality conditions and duality results for non-differentiable interval optimization problems
- Multiobjective programming in optimization of the interval objective function
- Optimization and nonsmooth analysis
- Invex functions and constrained local minima
- Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
This page was built for publication: On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity