抄録
We consider the initial procurement problem for a reparable inventory system. For this problem, we develop an application which minimizes an inventory cost. The inventory cost consists of the backorder penalty, which is computed by the product of the backorder-cost by the steady state expected number of backorders of the random item with the most backorders, and the cost of spares purchases. Our application is based on the fact that the inventory cost function has L^#-convexity, which is an inportant concept of discrete convexity in the theory of optimization.
