摘要
以残差(实际值与拟合值之差)绝对值之和最小为准则确定灰色模型GM(1,N)的参数向量a,使计算化为目标规划问题,从而用线性规划中的单纯形法求解。
The parameter vector ? in grey model GM (1, N) is determined bymeans of the rule making a sum of residue's absolute values (differencesof actual and fitting values) to be least. This computation is transformedto the goal programming problem, and then a solution is found by simplexmethod in linear programming.
关键词
灰色模型
多目标规划
单纯形算法
gray models
multiple objective programming
simplex algorithms
