Scaling problems in linear-fractional programing

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