For linear-fractional programming with objective and positive denominator, setThen and the objective becomes . An equality becomes , and an inequality becomes . Nonnegativity of becomes nonnegativity of .
For the substitution is reversible, with , and preserves the objective exactly. The usual closed linear program allows . If the original feasible set is nonempty, a feasible transformed point is a recession direction: for any original feasible , the points are feasible for , and their ratios tend to . Thus the closed transformed program preserves the infimum, but a zero-scale optimizer need not produce a finite original optimizer.[ref]
For example, minimize on . The transformed constraints are , , and the objective is . Its minimum occurs at , whereas the original infimum zero is approached only as . If the original polyhedron is nonempty and bounded, a nonzero recession direction is impossible, excluding this zero-scale case.
Articles by others on the same topic
There are currently no matching articles.