Robust duality for fractional programming problems with constraint-wise data uncertainty

DOI10.1007/s10957-011-9896-1zbMath1242.90252OpenAlexW1998073116WikidataQ59241543 ScholiaQ59241543MaRDI QIDQ658562

Guoyin Li, Vaithilingam Jeyakumar

Publication date: 12 January 2012

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-011-9896-1

zbMATH Keywords

Robust optimizationFractional programming under uncertaintyLinear fractional programming with uncertaintyStrong duality

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Related Items (18)

Some characterizations of robust optimal solutions for uncertain fractional optimization and applications ⋮ A unifying approach to robust convex infinite optimization duality ⋮ Characterization of norm-based robust solutions in vector optimization ⋮ Efficient solution of interval optimization problem ⋮ Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data ⋮ Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications ⋮ Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment ⋮ Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions ⋮ A Newton method for capturing efficient solutions of interval optimization problems ⋮ Solving nonlinear interval optimization problem using stochastic programming technique ⋮ Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data ⋮ A quasi-Newton method with rank-two update to solve interval optimization problems ⋮ On robust duality for fractional programming with uncertainty data ⋮ Twin minimax probability machine for pattern classification ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data ⋮ Unnamed Item ⋮ Strong duality for robust minimax fractional programming problems ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Robust conjugate duality for convex optimization under uncertainty with application to data classification
• Robust linear optimization under general norms.
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Selected topics in robust convex optimization
• Duality in robust optimization: Primal worst equals dual best
• Robust optimization-methodology and applications
• Using duality to solve generalized fractional programming problems
• A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
• Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
• Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
• Strong Duality in Robust Convex Programming: Complete Characterizations
• A sixth bibliography of fractional programming
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Convex Analysis
• Fractional programming : a recent survey
• Optimality conditions and duality for a class of nonlinear fractional programming problems.

This page was built for publication: Robust duality for fractional programming problems with constraint-wise data uncertainty