On the White's algorithm for fractional programming

Abstract

In this note we extend for fractional case a method due to White for solving a problem of maximizing over a finite set a function with some special "convexity" properties. Three algorithms applied to a transformation of the initial problem into a maximizing an auxilliary non-fractional function over a bi-product set are given.