本文選題：階躍函數(shù)　切入點(diǎn)：-規(guī)劃問題　出處：《運(yùn)籌學(xué)學(xué)報(bào)》2017年03期 　論文類型：期刊論文

【摘要】：傳統(tǒng)的求解0-1規(guī)劃問題方法大多屬于直接離散的解法.現(xiàn)提出一個包含嚴(yán)格轉(zhuǎn)換和近似逼近三個步驟的連續(xù)化解法:(1)借助階躍函數(shù)把0-1離散變量轉(zhuǎn)化為[0,1]區(qū)間上的連續(xù)變量;(2)對目標(biāo)函數(shù)采用逼近折中階躍函數(shù)近光滑打磨函數(shù),約束條件采用線性打磨函數(shù)逼近折中階躍函數(shù),把0-1規(guī)劃問題由離散問題轉(zhuǎn)化為連續(xù)優(yōu)化模型;(3)利用高階光滑的解法求解優(yōu)化模型.該方法打破了特定求解方法僅適用于特定類型0-1規(guī)劃問題慣例,使求解0-1規(guī)劃問題的方法更加一般化.在具體求解時,采用正弦型光滑打磨函數(shù)來逼近折中階躍函數(shù),計(jì)算效果很好.
[Abstract]:Most of the traditional methods for solving 0-1 programming problems are direct discrete solutions. This paper presents a continuous solution method, which consists of three steps of strict transformation and approximate approximation, to transform 0-1 discrete variables into [01] interval by means of step function. The objective function is approximated to the eclectic step function by using the near smooth polishing function. The linear grinding function is used to approximate the eclectic step function. The 0-1 programming problem is transformed from a discrete problem to a continuous optimization model. By using a high order smooth solution, the method breaks the convention that a specific solution method is only suitable for a given type of 0-1 programming problem. The method of solving 0-1 programming problem is generalized and the sinusoidal smooth grinding function is used to approximate the eclectic step function.
【作者單位】： 北京工業(yè)大學(xué)機(jī)械工程與電子技術(shù)學(xué)院;內(nèi)蒙古大學(xué)數(shù)學(xué)科學(xué)學(xué)院;內(nèi)蒙古師范大學(xué)數(shù)學(xué)科學(xué)學(xué)院;
【基金】：國家自然科學(xué)基金(No.11672103) 內(nèi)蒙古自治區(qū)自然科學(xué)基金(No.2014MS0119) 內(nèi)蒙古自治區(qū)高等學(xué)�？茖W(xué)研究項(xiàng)目(No.NJSY16030) 內(nèi)蒙古師范大學(xué)科研基金(Nos.2016ZRYB001,2016ZRYB002)
【分類號】：O221.4
，

本文編號：1569678