SOME PROBLEMS OF SOLVING LIPSCHITZIAN GLOBAL OPTIMIZATION PROBLEMS USING THE BRANCH AND BOUND METHOD

被引:0
|
作者
NEFEDOV, VN
机构
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Conditions for removing cubes that belong to a division of an m-dimensional parallelepiped PI are proposed for use when solving, by the branch and bound method, Lipschitzian problems of global optimization with an admissible set PI or a subset of PI determined by a system of constraints of the inequality type.
引用
收藏
页码:433 / 445
页数:13
相关论文
共 50 条