摘要
为求解运筹学中某些特殊的线性整数规划和0-1规划问题,应用相对差分法发展了一种图上作业法,建立了这些规划问题的数学模型.该作业法通过目标函数与决策变量的约束条件间的相对差分,比较容易地求解了运输问题、分派问题、最短路程问题和货郎担问题,证明了方法的有效性.
A graphical operating method using relative difference is presented for solving a kind of special linear integer and 0-1 programming problems in operational research. The mathematical model of the programming problem is set up, and a graphical operating approach is developed by using the relative difference of the objective and constraints with respect to the decision variables. Four typical operating problems, i.e. transportation problem, assignment problem, shortest path problem and traveling salesman problem, are solved in demonstration of the presented method. It is found that the graphical operating method based on relative difference concept can be easily adopted for successfully determining optimum operational decisions.
出处
《大连理工大学学报》
EI
CAS
CSCD
北大核心
2004年第5期775-780,共6页
Journal of Dalian University of Technology
基金
国家自然科学基金资助项目(10002005)
大连理工大学"211工程"建设资助项目.
关键词
运筹学
差分
求解
货郎担问题
线性规划
离散
运输问题
解法
作业
路程问题
operational research
linear integer programming
linear 0-1 programming
relative difference
graphical operating method
