摘要
如果重心法选址结果位于不可行区域内,则这个选址结果的实用价值就会大打折扣。针对由连续折线段构成的凸多边形和由圆形构成的不可行区域,本文建立了混合整数非线性规划模型,并通过Lingo软件计算求解。实例显示,该模型能够有效找到不可行区域外的选址点。
If the gravity site selection result is located in an infeasible area,the practical value of this site selection re sult will be greatly reduced.Aiming at the convex polygon consisting of continuous polyline segments and the infeasi ble area consisting of circles,a mixed integer non-linear programming model was established in this paper,which was calculated and solved by Lingo software.An example shows that the model can effectively find site locations out side the infeasible area.
作者
陈宝星
CHEN Baoxing(School of Management Guangzhou University,Guangzhou Guangdong 510006)
出处
《河南科技》
2020年第5期32-34,共3页
Henan Science and Technology
基金
教育部人文社科规划基金项目(17YJAZH021)。
关键词
不可行区域
重心法
凸多边形
infeasible area
barycenter method
convex polygon
