On robust duality for fractional programming with uncertainty data
From MaRDI portal
Publication:743463
DOI10.1007/S11117-013-0227-7zbMATH Open1297.49061OpenAlexW2082221223MaRDI QIDQ743463FDOQ743463
Publication date: 24 September 2014
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-013-0227-7
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
Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Convex Analysis
- Conjugate duality in convex optimization
- Title not available (Why is that?)
- Robust optimization
- Duality in robust optimization: Primal worst equals dual best
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Strong duality in robust convex programming: complete characterizations
- Constructing uncertainty sets for robust linear optimization
- Fractional Programming. I, Duality
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Robust linear optimization under general norms.
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Inequality systems and global optimization
- On strong and total Lagrange duality for convex optimization problems
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Robust duality in parametric convex optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- On Extension of Fenchel Duality and its Application
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Duality in Fractional Programming: A Unified Approach
- Some Farkas-type results for fractional programming problems with DC functions
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Symmetric duality for a class of nonlinear fractional programming problems
- Farkas-type results for fractional programming problems
- Farkas-Type Results With Conjugate Functions
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Strong duality in robust semi-definite linear programming under data uncertainty
Cited In (24)
- Interval linear fractional programming: optimal value range of the objective function
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- Robust error bounds for uncertain convex inequality systems with applications
- Optimality conditions and duality in fractional robust optimization problems
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
- Optimality conditions and duality for minimax fractional programming problems with data uncertainty
- Linear fractional program under interval and ellipsoidal uncertainty
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- A taxonomy and review of the multi-objective fractional programming (MOFP) problems
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Some dual characterizations of Farkas-type results for fractional programming problems
- Robust duality for generalized convex programming problems under data uncertainty
- Some characterizations of duality for DC optimization with composite functions
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Farkas-type results for constrained fractional programming with DC functions
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- A unifying approach to robust convex infinite optimization duality
- Strong duality for robust minimax fractional programming problems
- Weighted robust optimality of convex optimization problems with data uncertainty
- A note on the radius of robust feasibility for uncertain convex programs
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)
