On extreme point fractional programming
On Rohn's relative sensitivity coefficient of the optimal value for a linear-fractional program
In this note we consider a linear-fractional programming problem with equality linear constraints. Following Rohn, we define a generalized relative sensitivity coefficient measuring the sensitivity of the optimal value for a linear program and a linear-fractional minimization problem with respect to the perturbations in the problem data. By using an extension of Rohn's result for the linear programming case, we obtain, via Charnes-Cooper variable change, the relative sensitivity coefficient for...
On the quadratic fractional optimization with a strictly convex quadratic constraint
In this paper, we have studied the problem of minimizing the ratio of two indefinite quadratic functions subject to a strictly convex quadratic constraint. First utilizing the relationship between fractional and parametric programming problems due to Dinkelbach, we reformulate the fractional problem as a univariate equation. To find the root of the univariate equation, the generalized Newton method is utilized that requires solving a nonconvex quadratic optimization problem at each iteration. A...
Optimality and Duality for a Class of Nondifferentiable Minimax Fractional Programming Problems
Optimisation d’une fonction linéaire sur l’ensemble des solutions efficaces d’un problème multicritère quadratique convexe
Dans ce papier, nous caractérisons l’ensemble des points efficients d’un problème de programmation multicritère quadratique convexe. Nous ramenons ainsi le problème de la minimisation d’une fonction linéaire sur l’ensemble des points efficients à la résolution d’un problème de programmation fractionnaire.
Optimization analysis involving set functions.
Outcome space range reduction method for global optimization of sum of affine ratios problem
Many algorithms for globally solving sum of affine ratios problem (SAR) are based on equivalent problem and branch-and-bound framework. Since the exhaustiveness of branching rule leads to a significant increase in the computational burden for solving the equivalent problem. In this study, a new range reduction method for outcome space of the denominator is presented for globally solving the sum of affine ratios problem (SAR). The proposed range reduction method offers a possibility to delete a large...