Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- First Online:
- 2k Downloads
For nonlinear programming problems which are factorable, a computable procedure for obtaining tight underestimating convex programs is presented. This is used to exclude from consideration regions where the global minimizer cannot exist.
Unable to display preview. Download preview PDF.
- E.M.L. Beale and J.A. Tomlin, “Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables”, in: J. Laurence, ed.,Proceedings of the fifth international conference on operational research (Tavistock Publications, London, 1970) pp. 447–454.Google Scholar
- G.P. McCormick, “Converting general nonlinear programming problems to separable nonlinear programming problems”, Technical Paper Serial T-267, Program in Logistics, The George Washington University, Washington, D.C. (1972).Google Scholar
- G.P. McCormick, “Attempts to calculate global solutions of problems that may have local minima”, in: F.A. Lootsma, ed.,Numerical methods for nonlinear optimization (Academic Press, New York, 1972) pp. 209–221.Google Scholar