Dinkelbach's algorithm [2] solving the parametric equivalent of a fractional program is investigated. It is shown that the algorithm converges superlinearly and often (locally) quadratically.

Artificial intelligence, which may at some point automate your job and can already defeat professionals in six-player poker, is now able to solve Rubik's Cube faster than any human.

Determining the optimal solution (OS) set of interval linear fractional programming (ILFP) models is generally an NP-hard problem. Few methods have been proposed in this field which have only been ...