摘要
提出了一种解较复杂的目标规划问题的算法.采用已开发出来的数学软件,能够方便、快速地进行计算,具有易于掌握、不易出错,适用于较复杂的模型.
Goal programming is an important subject of management science. The paper puts forward an algorithm for the complicated problem of goal programming and it is calculated quickly by using applied mathematical software. This algorithm can be grasped easily and is suitable for more complicated models.
出处
《中南林学院学报》
CSCD
北大核心
2006年第3期133-136,共4页
Journal of Central South Forestry University
关键词
目标规划
主次关系
数学模型
单纯形法
分解算法
goal programming
primary-slave relation
mathematical model
simplex method
clastic algorithm
