A dynamic convexized method for nonconvex mixed integer nonlinear programming

摘要：

　　We consider in this paper the nonconvex mixed-integer nonlinear programming problem. We present a mixed local search method to find a local minimizer of an unconstrained nonconvex mixed integer nonlinear programming problem. Then an auxiliary function which has the same global minimizers and the same global minimal value as the original problem is constructed.

关键词： Nonconvex mixed integer nonlinear programming Local search Auxiliary function

作者: Wenxing Zhu Geng Lin

作者单位: Center for Discrete Mathematics and Theoretical Computer Science,Fuzhou University, Fuzhou 350002, China

会议类型: 国际会议

会议名称: 第8届国际最优化方法及应用大会

会议地点: 上海

会议语种:英文

页码: 186-186

在线出版日期: 2010-12-10（万方平台首次上网日期，不代表论文的发表时间）