Generalized fractional programming: Algorithms and numerical experimentation (Q1058468): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(85)90287-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979134182 / rank | |||
Normal rank | |||
Revision as of 19:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized fractional programming: Algorithms and numerical experimentation |
scientific article |
Statements
Generalized fractional programming: Algorithms and numerical experimentation (English)
0 references
1985
0 references
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.
0 references
generalized fractional program
0 references
Newton approach
0 references
Dinkelbach approach
0 references
