An Integrated View of Algorithms for the Generalized Fractional Program
碩士 === 國立成功大學 === 數學系應用數學碩博士班 === 93 === The purpose of this paper is to compare three basic algorithms avail-able to the generalized fractional program, including the Dinkelbach-type, the interval-type, and a “dual” algorithm. We unify the convergence proofs for the three algorithms by the same ge...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/81253678039426297184 |
| Summary: | 碩士 === 國立成功大學 === 數學系應用數學碩博士班 === 93 === The purpose of this paper is to compare three basic algorithms avail-able to the generalized fractional program, including the Dinkelbach-type, the interval-type, and a “dual” algorithm. We unify the convergence proofs
for the three algorithms by the same geometrical concept which requires to estimate the ratio of slopes of different straight lines. In addition, we found that the interval type algorithm is in fact a version of bisection method. We
also establish the strong duality properties for the “dual” algorithm which was not shown in the original paper.
|
|---|