On robust duality for fractional programming with uncertainty data
From MaRDI portal
Publication:743463
Recommendations
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Optimality conditions and duality in fractional robust optimization problems
- Strong duality for robust minimax fractional programming problems
- Optimality conditions and duality for minimax fractional programming problems with data uncertainty
- Robust duality for generalized convex programming problems under data uncertainty
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Conjugate duality in convex optimization
- Constructing uncertainty sets for robust linear optimization
- Convex Analysis
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Duality in Fractional Programming: A Unified Approach
- Duality in robust optimization: Primal worst equals dual best
- Farkas-Type Results With Conjugate Functions
- Farkas-type results for fractional programming problems
- Fractional Programming. I, Duality
- Inequality systems and global optimization
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On Extension of Fenchel Duality and its Application
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- On strong and total Lagrange duality for convex optimization problems
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Robust duality in parametric convex optimization
- Robust linear optimization under general norms.
- Robust optimization
- Some Farkas-type results for fractional programming problems with DC functions
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Strong duality in robust convex programming: complete characterizations
- Strong duality in robust semi-definite linear programming under data uncertainty
- Symmetric duality for a class of nonlinear fractional programming problems
Cited in
(24)- Strong duality for robust minimax fractional programming problems
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust duality for generalized convex programming problems under data uncertainty
- Interval linear fractional programming: optimal value range of the objective function
- Weighted robust optimality of convex optimization problems with data uncertainty
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- A note on the radius of robust feasibility for uncertain convex programs
- Optimality conditions and duality in fractional robust optimization problems
- Linear fractional program under interval and ellipsoidal uncertainty
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Some characterizations of duality for DC optimization with composite functions
- Robust error bounds for uncertain convex inequality systems with applications
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- A taxonomy and review of the multi-objective fractional programming (MOFP) problems
- A unifying approach to robust convex infinite optimization duality
- Optimality conditions and duality for minimax fractional programming problems with data uncertainty
- Some dual characterizations of Farkas-type results for fractional programming problems
- Farkas-type results for constrained fractional programming with DC functions
This page was built for publication: On robust duality for fractional programming with uncertainty data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743463)
