| 摘要: | In crisp production inventory problem, let q, a, b, d, R and r be the quantity produced per cycle, the holding cost, production cost, production quantity per day, the total demand quantity and the demand quantity per day, respectively. We consider three fuzzification methods. Firstly, we fuzzify q, a, b, d, R and r to triangular fuzzy numbers. Secondly, we fuzzify d and r to triangular fuzzy number with q, a, b and R staying in crisp case. Thirdly, we fuzzify q to triangular fuzzy number with a, b, d, R and r staying in crisp case. In three cases, we find the total costs in the fuzzy sense by signed distance and get the optimal solutions. |
