Scaling problems in linear-fractional programing

@article{Bajalinov2006ScalingPI,
  title={Scaling problems in linear-fractional programing},
  author={Erik B. Bajalinov and Anett R{\'a}cz},
  journal={28th International Conference on Information Technology Interfaces, 2006.},
  year={2006},
  pages={495-500}
}
In this paper we discuss the theoretical backgrounds and implementations issues of scaling a linear-fractional programming problem (LFP). We consider an LFP problem in the canonical form and show how to scale rows and columns of the problem, then if the scaled problem has been solved, we show how the solution obtained may be unsealed. Also we briefly overview two scaling rules for calculating scaling factors. Finally, to illustrate how these rules work we consider a numeric example 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

Scaling for Stability in Gaussian Elimination ”

S. Pissanetzky
  • Sparse Matrix Technology ”
  • 1984