, Volume 68, Issue 1, pp 95-116

Fractional programming by lower subdifferentiability techniques

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


The notion of lower subdifferentiability is applied to the analysis of convex fractional programming problems. In particular, duality results and optimality conditions are presented, and the applicability of a cutting-plane algorithm using lower subgradients is discussed. These methods are useful also in generalized fractional programming, where, in the linear case, the performance of the cutting-plane algorithm is compared with that of the most efficient version of the Dinkelbach method, which is based on the solution of a parametric linear programming problem.

Communicated by O. L. Mangasarian
The authors wish to thank Mr. Jaume Timoneda for his help in the implementation of the numerical methods on the computer and the referees for valuable comments and suggestions; the present improved statement and proof of Proposition 2.1 is due to one of them. Financial support from the Dirección General de Investigación Científica y Técnica (DGICYT), under project PS89-0058, is gratefully acknowledged.