Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
DOI10.3934/JIMO.2024043MaRDI QIDQ6574084
Publication date: 18 July 2024
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
generalized convexityClarke subdifferentialrobust optimality conditionsisolated efficient solutionnon-smooth semi-infinite multi-objective fractional program
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Semi-infinite programming (90C34) Robustness in mathematical programming (90C17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Robust duality for generalized convex programming problems under data uncertainty
- An algorithm for generalized fractional programs
- From scalar to vector optimization.
- Duality in robust optimization: Primal worst equals dual best
- On the subdifferentiability of the difference of two functions and local minimization
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- Robust optimization-methodology and applications
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- On approximate efficiency for nonsmooth robust vector optimization problems
- Characterizing robust solution sets of convex programs under data uncertainty
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Optimization and nonsmooth analysis
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Parametric approach for approximate efficiency of robust multiobjective fractional programming problems
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Robust duality for generalized convex nonsmooth vector programs with uncertain data in constraints
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions for generalized convex nonsmooth uncertain multi-objective fractional programming
This page was built for publication: Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574084)
