一类灰线性规划问题的求解

A Solution to a Class of Grey Linear Programming problems

研究了系数为灰数的线性规划问题，将灰线性规划问题的求解方法与集包含方法和参数规划方法相结合，给出了一类灰线性规划的新的求解方法。讨论了在决策过程中，在信任函数定义之下，决策者在一定信任度下，如何选取最优解问题，给出了最优值关于参量ａ∈［０，１］的分析性质。

The problem of grey linear programming is discussed.In connection with the method ofsolving GLP,the set-included constraint method and the parametric programming,a newmethod for solving a class of GLP is given,Based on the definition of the confidence func-tion,the problem of how a decision maker should choose the optimal solution is discussed.The analyticity of the optimal value for a∈[0,1]”is given.