目标规划的分解算法  

The Clastic Algorithm of Goal Programming

作　　者：黄政龙[1] 

机构地区：[1]中南林学院理学院,湖南株洲412006

出　　处：《中南林学院学报》2006年第3期133-136,共4页Journal of Central South Forestry University

摘　　要：提出了一种解较复杂的目标规划问题的算法.采用已开发出来的数学软件,能够方便、快速地进行计算,具有易于掌握、不易出错,适用于较复杂的模型.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.

关 键 词：目标规划 主次关系 数学模型 单纯形法 分解算法 

分 类 号：O221.6[理学—运筹学与控制论]