
doi: 10.1007/bf01958598
A linear fractional program of the form max (cx+r)/(dx+s) subject toa≤Ax≤b (FIP) is considered, whereA is am ×n matrix with rank(A)=m. By replacing (FIP) by a parametric linear program, in the first part of this paper the existence of an optimal solution of (FIP) is discussed. In the second part an algorithm is presented which is based upon an algorithm ofDinkelbach and takes into account the special structure of the constraints. The results are illustrated by an example.
Nonlinear programming, Linear programming
Nonlinear programming, Linear programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
