Global optimization of fractional programs

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1991 English Publisher:Springer Science and Business Media LLCJournal:Journal of Global Optimization, volume 1, pages 173-182 (issn: 0925-5001, eissn: 1573-2916,

Copyright policy )

Authors: Panos M. Pardalos; Andrew T. Phillips;

doi: 10.1007/bf00119990

Global optimization of fractional programs

- Summary
- Subjects
- Metrics

Abstract

Dinkelbach's classical parametric algorithm in fractional programming is modified. A sequence of lower and upper bounds of the optimal value of the ratio is constructed and shown to be superlinearly convergent to the optimal value. Additional results are obtained for linear and quadratic fractional programs.

Related Organizations

Pennsylvania State University
United States
United States Naval Academy
United States

Keywords

Dinkelbach's parametric algorithm, Computational methods for problems pertaining to operations research and mathematical programming, superlinear convergence, 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).	42
	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 10%
	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 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average