A program for the optimum approximation of real rational functions via linear programming

Abstract

This paper presents a Turbo-Basic program that implements an algorithm for the optimum approximation of real rational functions via linear-programming. The formulation of the linear problem is based on the minimization of a minimax criterion, while its solution is derived through the dual problem. This algorithm is much faster and requires less storage than other approximation techniques. The program is implemented on an IBM-PC AT and tested by several examples. Analytical examples are presented to illustrate how the program is used and the effectiveness of the algorithm.