Linear-fractional programming problem
- 34 Downloads
The linear-fractional programming problem is one in which the objective to be maximized is of the form f (xv) = (cxv + α)/(dxv + β) subject to Axv ≤ bv, xv ≥ 0, where α and β are scalars, cv and dv are row vectors of given numbers, and bv is the right-hand-side vector. The problem can be converted to an equivalent linear programming problem by the translation yv = xv/(dxv + β), provded that dxv + β does not change sign in the feasible region. Fractional programming.