Algorithms for generalized fractional programming

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1991 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 52, pages 191-207 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Jean-Pierre Crouzeix; Jacques A. Ferland;

doi: 10.1007/bf01582887

Algorithms for generalized fractional programming

- Summary
- Subjects
- Metrics

Abstract

For the problem of minimizing the maximum of a finite number of ratios of functions various algorithmic approaches are reviewed, contrasted and their convergence properties and relative computational efficiency are discussed.

Related Organizations

University of Montreal
Canada
University of Clermont Auvergne
France

Keywords

minimizing the maximum of a finite number of ratios, computational efficiency, Nonlinear programming, Computational methods for problems pertaining to operations research and mathematical programming, Fractional programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	218
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average