As order quantity is increased, the ordering cost per item will be cheaper due to saving of transportation and material handling costs. In this paper, two realistic assumptions such as quantity discount and budget limit are considered. Quantity discount means that all units in the order will be discounted according to the predetermined order levels. Budget limit represents that the costs for inventory investments are bounded. This paper develops a Lagrangian relaxation approach for a continuous review inventory model with a budget constraint and quantity discounts. Computational results indicate that the proposed approach provides a good solution. Sensitivity analysis is done to get some insights on budget limit and quantity discount. As budget limit or the amount of discount according to order quantity is increased, order quantity is increased, whereas reorder point is not always increased.

We develop an optimization algorithm for a periodic review inventory system under a stochastic budget constraint. While most conventional studies on the periodic review inventory system consider a simple budget limit in terms of the inventory investment being less than a fixed budget, this study adopts more realistic assumption in that purchasing costs are paid at the time an order is arrived. Therefore, probability is employed to express the budget constraint. That is, the probability of total inventory investment to be less than budget must be greater than a certain value assuming that purchasing costs are paid at the time an order is arrived. We express the budget constraint in terms of the Lagrange multiplier and suggest a numerical method to obtain optional values of the cycle time and the safety factor to the system. We also perform the sensitivity analysis in order to investigate the dependence of important quantities on the budget constraint. We find that, as the amount of budget increases, the cycle time and the average inventory level increase, whereas the Lagrange multiplier decreases. In addition, as budget increases, the safety factor increases and reaches to a certain level. In particular, we derive the condition for the maximum safety factor.

In this paper, we develop an efficient approach to solve a multiple-item budget-constraint newsboy problem with a reservation policy. A conventional approach for solving such problem utilizes an approximation for the evaluation of an inverse of a Gaussian cumulative density function when the argument of the function is small, and a heuristic method for finding an optimal Lagrangian multiplier. In contrast to the conventional approach, this paper proposes more accurate method of evaluating the function by using the normalization and an effective numerical integration method. We also propose an efficient way to find an optimal Lagrangian multiplier by proving that the equation for the budget-constraint is in fact a monotonically increasing function in the Lagrangian multiplier. Numerical examples are tested to show the performance of the proposed approach with emphases on the behaviors of the inverse of a Gaussian cumulative density function and the Lagrangian multiplier. By using sensitivity analysis of different budget constraints, we show that the reservation policy indeed provides greater expected profit than the classical model of not having the reservation policy.

This paper deals with a centralized warehouse problem with multi-item and capacity constraint. The objective of this paper is to decide the number and location of centralized warehouses and determineorder quantity (Q), reorder point (r) of each centralized warehouse to minimize holding, setup, penalty, and transportation costs. Each centralized warehouse uses continuous review in- ventory policy and its budget is limited. A SA (Simulated Annealing) approach is developed and its performance is tested by using some computational experiments.

Inventory centralization for a number of stores may reduce inventory costs by establishing and maintaining a central ordering and distribution point. In this study, a centralized warehouse problem with multi-item and capacity constraint is considered. The objective of this study is to develop a methodology to decide the number and location of centralized warehouses and determine order quantity(Q), reorder point(r) of each centralized warehouse to minimize holding, setup, penalty, and transportation costs. In this problem, each centralized warehouse uses continuous review inventory policy and its budget is limited. A SA(Simulated Annealing) approach for this problem is developed.

Most approaches for continuous review inventory problem need tables for loss function and cumulative standard normal distribution. Furthermore, it is time-consuming to calculate order quantity (Q) and reorder point (r) iteratively until required values ar