Abstract
This paper is introducing a new method for the approximation of real rational functions via mixed-integer linear programming. The formulation of the linear approximation problem is based on the minimization of a suitable minimax criterion, in combination with a branch and bound linear integer technique. The proposed algorithm can be used in many rational approximation problems, where some coefficients of the rational function are required to take only integer values. The formulation of the problem ensures always the global solution. The proposed algorithm was extensively tested on a variety of problems. An analytical example is presented to illustrate the use and effectiveness of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
