Linear-fractional programming: Difference between revisions

Content deleted Content added
Tag: Reverted
Line 17:
Under the assumption that the feasible region is non-empty and bounded, the Charnes-Cooper transformation<ref name="CC"/>
 
:<math>\mathbf{y} = \frac{\mathbf{x}1}{\mathbf{d}^T \mathbf{x} + \beta} \cdot \mathbf{x}\;;\;\; t = \frac{1}{\mathbf{d}^T \mathbf{x} + \beta}</math>
 
translates the linear-fractional program above to the equivalent linear program: