Abstract: We extend Robust Optimization to fractional programming, where both the objective and the constraints contain uncertain parameters. Earlier work did not consider uncertainty in both the objective and the constraints, or did not use Robust Optimization. Our contribution is threefold. First, we provide conditions to guarantee that either a globally optimal solution, or a sequence converging to the globally optimal solution, can be found by solving one or more convex optimization problems. Second, we identify two cases for which an exact solution can be obtained by solving a single optimization problem: (1) when uncertainty in the numerator is independent from the uncertainty in the denominator, and (2) when the denominator does not contain an optimization variable. Third, we show that the general problem can be solved with an (iterative) root finding method. The results are demonstrated on a return-on-investment maximization problem, data envelopment analysis, and mean-variance optimization. We find that the robust optimal solution is only slightly more robust than the nominal solution. As a side-result, we use Robust Optimization to show that two existing methods for solving fractional programs are dual to each other.
The aim of this paper is to combine fractional programming with robust optimization to provide a comprehensive overview of the solution methods, and to investigate the improvement of robust optimization on numerical examples. The author provides conditions that guarantee that a globally optimal solution or a sequence that converges to the globally optimal solution can be found by solving one or more convex problems. The author identifies two cases for which an exact solution can be obtained by solving a single optimization problem and shows that the general problem can be solved with an iterative root-finding method. The results are demonstrated on a return on investment maximization problem, data envelopment analysis and mean-variance optimization.
Recommendations
- scientific article; zbMATH DE number 3508267
- scientific article; zbMATH DE number 757682
- scientific article; zbMATH DE number 192888
- Fractional Programming
- Fractional programming revisited
- scientific article; zbMATH DE number 592645
- Strong duality for robust minimax fractional programming problems
- Generalized fractional programming
- scientific article; zbMATH DE number 1377931
- scientific article; zbMATH DE number 1095224
Cites work
- A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
- A new algorithm for generalized fractional programs
- A note on an algorithm for generalized fractional programs
- Algorithms for generalized fractional programming
- An algorithm for generalized fractional programs
- Automatic robust convex programming
- Bibliography in fractional programming
- Consistent and robust ranking in imprecise data envelopment analysis under perturbations of random subsets of data
- Deriving robust counterparts of nonlinear uncertain inequalities
- Duality in inexact fractional programming with set-inclusive constraints
- Duality in robust optimization: Primal worst equals dual best
- Fractional programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Generic algorithm for generalized fractional programming
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- scientific article; zbMATH DE number 7009350 (Why is no real title available?)
- Measuring the efficiency of decision making units
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
- On general minimax theorems
- On Nonlinear Fractional Programming
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Programming with linear fractional functionals
- Robust optimization
- Strong duality for robust minimax fractional programming problems
- Technical note: Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets
- The Price of Robustness
- Theory and applications of robust optimization
Cited in
(12)- An effective algorithm for globally solving sum of linear ratios problems
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Twin minimax probability machine for pattern classification
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
- Linear fractional program under interval and ellipsoidal uncertainty
- Distributionally robust goal-reaching optimization in the presence of background risk
- Distributionally Robust Reward-Risk Ratio Optimization with Moment Constraints
- Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust controlled vector variational inequalities for multi-dimensional fractional control optimization problems
- Robust duality for fractional programming problems with constraint-wise data uncertainty
This page was built for publication: Robust fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493047)
