On robust duality for fractional programming with uncertainty data
From MaRDI portal
Publication:743463
DOI10.1007/s11117-013-0227-7zbMath1297.49061OpenAlexW2082221223MaRDI QIDQ743463
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
Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Duality theory (optimization) (49N15)
Related Items (18)
Interval linear fractional programming: optimal value range of the objective function ⋮ Some characterizations of robust optimal solutions for uncertain fractional optimization and applications ⋮ Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ A note on the radius of robust feasibility for uncertain convex programs ⋮ A unifying approach to robust convex infinite optimization duality ⋮ Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty ⋮ Weighted robust optimality of convex optimization problems with data uncertainty ⋮ Robust error bounds for uncertain convex inequality systems with applications ⋮ Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ A taxonomy and review of the multi-objective fractional programming (MOFP) problems ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
Cites Work
- Unnamed Item
- Unnamed Item
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Robust duality in parametric convex optimization
- Duality and Farkas-type results for DC fractional programming with DC constraints
- 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 linear optimization under general norms.
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Duality in robust optimization: Primal worst equals dual best
- Some Farkas-type results for fractional programming problems with DC functions
- Conjugate duality in convex optimization
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Symmetric duality for a class of nonlinear fractional programming problems
- Inequality systems and global optimization
- Farkas-type results for fractional programming problems
- On strong and total Lagrange duality for convex optimization problems
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- On Extension of Fenchel Duality and its Application
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Fractional Programming. I, Duality
- Duality in Fractional Programming: A Unified Approach
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Strong duality in robust semi-definite linear programming under data uncertainty
- Farkas-Type Results With Conjugate Functions
- Convex Analysis
This page was built for publication: On robust duality for fractional programming with uncertainty data
