摘要
研究了模糊环境下的可追加订购的报童问题,针对需求量及追加最大订购数量均为梯形模糊变量情况,建立了以收益为目标函数的模糊机会约束规划模型,并将其转化为清晰等价模型来求解出最优订购量及追加定购量,并举出了数值例子。
In this paper, we study the reordering newsboy problem. We find fuzzy chance-constrain programming under the demand and maximize recording quantity are both trapezoidal fuzzy vector. Converting chance constraints to their respective crisp equivalents solve the problem to get the optimal ordering and optimal reordering. Finally we give the example.
出处
《广西工学院学报》
CAS
2006年第2期80-82,86,共4页
Journal of Guangxi University of Technology
