Revision as of 09:54, 30 November 2020 edit Sinahk (talk \| contribs) 2 edits →Transformation to a linear program Tag: Reverted ← Previous edit		Revision as of 09:55, 30 November 2020 edit undo Sinahk (talk \| contribs) 2 edits →Transformation to a linear program Tag: Manual revert Next edit →
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{x1}{\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:

Linear-fractional programming: Difference between revisions