Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

1. 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 

2. J.E. Falk and R.M. Soland, “An algorithm for separable nonconvex programming probblems”,Management Science 15(9) (1969) 550–569.

   Article  MATH  Google Scholar 

3. 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 

4. 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 

5. R.M. Soland, “An algorithm for separable nonconvex programming problems II: nonconvex constraints”,Management Science 17(11) (1971) 759–773.

   Article  MathSciNet  MATH  Google Scholar 

Download references