Generalized fractional programming: Algorithms and numerical experimentation (Q1058468): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:29, 30 January 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
