Abstract
Mathematical programming applications often require an objective function to be approximated by one of simpler form so that an available computational approach can be used. An a priori bound is derived on the amount of error (suitably defined) which such an approximation can induce. This leads to a natural criterion for selecting the “best” approximation from any given class. We show that this criterion is equivalent for all practical purposes to the familiar Chebyshev approximation criterion. This gains access to the rich legacy on Chebyshev approximation techniques, to which we add some new methods for cases of particular interest in mathematical programming. Some results relating to post-computational bounds are also obtained.
Similar content being viewed by others
References
W.J. Baumol and R.C. Bushnell, “Error produced by linearization in mathematical programming”,Econometrica 35 (3, 4) (1967).
D.P. Bertsekas, “Nondifferentiable optimization via approximation”,Mathematical Programming Study 3 (1975) 1–25.
P.J. Davis,Interpolation and approximation (Blaisdell, Waltham, MA, 1963).
A.M. Geoffrion, “A priori error bounds for procurement commodity aggregation in logistics planning models”,Naval Research Logistics Quarterly, to appear.
P.J. Schweitzer, “Optimization with an approximate Lagrangian”,Mathematical Programming 7 (2) (1974) 191–198.
Author information
Authors and Affiliations
Additional information
This paper was partially supported by the National Science Foundation and by the Office of Naval Research, and was the basis for a plenary lecture delivered at the IX International Symposium on Mathematical Programming in Budapest, Hungary, August 1976.
Rights and permissions
About this article
Cite this article
Geoffrion, A.M. Objective function approximations in mathematical programming. Mathematical Programming 13, 23–37 (1977). https://doi.org/10.1007/BF01584321
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584321