On the approximation of real rational functions via mixed-integer linear programming

This paper is introducing a new method for the approximation of real ration al functions via mixed-integer linear programming. The formulation of the l inear approximation problem is based on the minimization of a suitable mini max criterion, in combination with a branch and bound linear integer techni que. The proposed algorithm can be used in many rational approximation prob lems, where some coefficients of the rational function are required to take only integer values. The formulation of the problem ensures always the glo bal solution. The proposed algorithm was extensively tested on a variety of problems. An analytical example is presented to illustrate the use and eff ectiveness of the algorithm. (C) 2000 Elsevier Science Inc. All rights rese rved.