COMPUTABILITY OF GLOBAL SOLUTIONS TO FACTORABLE NONCONVEX PROGRAMS .1. CONVEX UNDERESTIMATING PROBLEMS
COMPUTABILITY OF GLOBAL SOLUTIONS TO FACTORABLE NONCONVEX PROGRAMS .1. CONVEX UNDERESTIMATING PROBLEMS
复制标题
DOI：
10.1007/bf01580665
复制
发表时间：
1976-01-01
影响因子：
2.7
通讯作者：
MCCORMICK, GP
中科院分区：
文献类型：
--
作者：
MCCORMICK, GP
对于可因式非线性规划问题，给出了一个求紧低估凸规划的可计算过程。这用于排除全局最小化器不存在的区域。
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.