On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
From MaRDI portal
Publication:2067760
DOI10.1186/s13660-019-1997-7zbMath1499.49093OpenAlexW2928849700WikidataQ128386739 ScholiaQ128386739MaRDI QIDQ2067760
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-1997-7
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Related Items (2)
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data ⋮ Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\epsilon\)-solutions for robust fractional optimization problems
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with \((C,\alpha ,\rho ,d)\)-convexity
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- On robust duality for fractional programming with uncertainty data
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Conjugate duality in convex optimization
- Necessary and sufficient conditions for minimax fractional programming
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Some dual characterizations of Farkas-type results for fractional programming problems
- Symmetric duality for a class of nonlinear fractional programming problems
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Optimality conditions and duality for minimax fractional programming problems with data uncertainty
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Strong duality for robust minimax fractional programming problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Necessary optimality conditions for DC infinite programs with inequality constraints
- Necessary conditions for ε-optimality
- Duality in Fractional Programming: A Unified Approach
- On Nonlinear Fractional Programming
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
