传统的求解0-1规划问题方法大多属于直接离散的解法.现提出一个包含严格转换和近似逼近三个步骤的连续化解法:(1)借助阶跃函数把0-1离散变量转化为[0,1]区间上的连续变量;(2)对目标函数采用逼近折中阶跃函数近光滑打磨函数,约束条件采用线性打磨函数逼近折中阶跃函数,把0-1规划问题由离散问题转化为连续优化模型;(3)利用高阶光滑的解法求解优化模型.该方法打破了特定求解方法仅适用于特定类型0-1规划问题惯例,使求解0-1规划问题的方法更加一般化.在具体求解时,采用正弦型光滑打磨函数来逼近折中阶跃函数,计算效果很好.%Traditional solutions of 0-1 programming problems belong mostly to direct discrete solving methods.A strict conversion for the problem and approximate continuous solution are proposed in this paper which have three steps:(1) 0-1 discrete variables were expressed as continuous variables on the interval [0,1] by means of a step function;(2) Objective function is approximated to take more near smooth polish function to approach tradeoff step function,and every constraint function is approximated to take linear polish function to approach tradeoff step function,then 0-1 programming problem is transformed to continuous optimization model from discrete problem;(3) The model is solved by using the method with high smoothness solution.This method breaks certain solving method applies only to certain types of 0-1 programming,so it can solve more general problems.During the solving process,a sinusoidal polish function is taken to obtain very good computational results.
展开▼
