= Linear-fractional programming
{wiki}
<Linear-fractional programming> minimizes or maximizes a ratio of affine functions over a <linear polyhedron>, with the denominator required to be positive:
$$
f(x)=\frac{c^Tx+\alpha}{d^Tx+\beta},\qquad d^Tx+\beta>0.
$$
For a threshold $t$, the sublevel condition is equivalent to the linear inequality $(c-td)^Tx\le t\beta-\alpha$. Its <sublevel sets> are therefore convex, although the ratio need not be a <convex function>. The positivity restriction makes this multiplication preserve the inequality direction.<Convex Optimization by Stephen Boyd and Lieven Vandenberghe>[§4.3.2, linear-fractional programs and their linear transformation]{ref}
The <Charnes-Cooper transformation> rescales by the denominator and introduces one extra variable to produce a <linear program>. Positive transformed scale gives an actual original feasible point; zero scale can encode a recession limit and must be interpreted separately when discussing attainment.
Back to article page