Abstract
The goal of increasing computational efficiency is one of the fundamental challenges of both theoretical and applied research in mathematical modeling. The pursuit of this goal has lead to wide diversity of efforts to transform a specific mathematical problem into one that can be solved efficiently. Recent years have seen the emergence of highly efficient methods and software for solving Mixed Integer Programming Problems, such as those embodied in the packages CPLEX, MINTO, XPRESS-MP. The paper presents a method to develop a piece-wise linear approximation of an any desired accuracy to an arbitrary continuous function of two variables. The approximation generalizes the widely known model for approximating single variable functions, and significantly expands the set of nonlinear problems that can be efficiently solved by reducing them to Mixed Integer Programming Problems. By our development, any nonlinear programming problem, including non-convex ones, with an objective function (and/or constraints) that can be expressed as sums of component nonlinear functions of no more than two variables, can be efficiently approximated by a corresponding Mixed Integer Programming Problem.
Similar content being viewed by others
References
Nemhauser, George L. and Laurence A.Wolsey. (1988). Integer and Combinatorial Optimization. John Wiley & Sons, New York.
Parrish, Scott H., Djangir A.Babayev, George I.Bell, and Vincil C.Dean. (1996). Mathematical Modeling of Processes and Operations in Telecommunications Network Management. Presented in The 14th Triennial Conference of the International Federation of Operational Research Societies. Vancouver, B.C., Canada. CPLEX, CPLEX Optimization, Inc., 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Babayev, D.A. Piece-wise linear approximation of functions of two variables. J Heuristics 2, 313–320 (1997). https://doi.org/10.1007/BF00132502
Issue Date:
DOI: https://doi.org/10.1007/BF00132502