Content deleted Content added
Mp19990920 (talk | contribs) No edit summary |
→Transformation to a linear program: indenting equations |
||
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{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:
:<math>
\begin{align}
\text{maximize} \quad & \mathbf{c}^T \mathbf{y} + \alpha t \\
| |||