A method for fractional programming
From MaRDI portal
This paper deals with a concave-convex fractional program. The authors reduce it to a quasiconvex maximization problem and then apply global optimality conditions. The feasible set is an \(n\)-dimensional convex set and the functions involved are differentiable as well as positive functions. An algorithm is proposed for solving the problem approximately. Numerical examples with quadratic functions and box constraints are presented.
Recommendations
Cited in
(12)- Global optimization for a class of fractional programming problems
- Maximizing pseudoconvex transportation problem: A special type
- On fractional non-convex programming
- A note on the paper ``Fractional programming with convex quadratic forms and functions by \textit{H. P. Benson} [Eur. J. Oper. Res. 173, No. 2, 351--369 (2006; Zbl 1113.90122)]
- Fractional programming with convex quadratic forms and functions
- Convex-concave fractional minimization problem
- Solving non-linear fractional programming problem with a special structure using approximation
- Copositivity and constrained fractional quadratic problems
- Pseudoconvexity properties of average cost functions
- Useful model in fractional programming
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
- An algorithm for solving quadratic fractional program with linear homogeneous constraints
This page was built for publication: A method for fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892253)
