Generalized fractional programming: Algorithms and numerical experimentation
type: Item
instance of: scholarly article
title: Generalized fractional programming: Algorithms and numerical experimentation
zbMATH Open document ID: 0564.90081
DOI: 10.1016/0377-2217(85)90287-5
author: Jacques A. Ferland
author: Jean-Yves Potvin
published in: European Journal of Operational Research
publication date: 1985-01-01T00:00:00Z
review text: Several algorithms to solve the generalized fractional program are summarized and compared numerically in the linear case. These algorithms are iterative procedures requiring the solution of a linear programming problem at each itertion in the linear case. The most efficient algorithm is obtained by marrying the Newton approach within the Dinkelbach approach for fractional programming.
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3900538
zbMATH Keywords: generalized fractional program
zbMATH Keywords: Newton approach
zbMATH Keywords: Dinkelbach approach
MaRDI profile type: Publication
full work available at URL: 0377-2217(85)90287-5
OpenAlex ID: W1979134182
cites work: An algorithm for generalized fractional programs
cites work: Duality in generalized linear fractional programming
cites work: On Nonlinear Fractional Programming
cites work: Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
cites work: Parametric approaches to fractional programs
cites work: Duality in generalized fractional programming via Farkas' lemma
cites work: Q4404428
cites work: Max-min resource allocation
description: scientific article; zbMATH DE number 3900538