A new data-driven robust optimization approach to multi-item newsboy problems

<p style='text-indent:20px;'>A newsboy problem is a typical stochastic inventory management problem and has extensive applications in the fields of operational research, management sciences and marketing sciences. One of the challenges underlying such problems is to handle the uncertainty of demands. In the existing results, it is often to assume that the demand distribution is given to facilitate solution of the problems. In this paper, a novel data-driven robust optimization model for solving multi-item newsboy problems is proposed by combining the absolute robust optimization with a data-driven uncertainty set, and the latter is leveraged to address the uncertainty of demands. For the single-item situation, a closed-form solution is obtained and influences of parameters on the optimal solutions are analyzed. Owing to complexity of the multi-item situation, a uniform smoothing function is leveraged to smooth the proposed model. Then, an algorithm, called a modified Frank-Wolfe feasible direction algorithm, is developed to solve a series of smooth subproblems. Numerical simulation demonstrates that the proposed model in this paper can reduce over-conservation of robust optimization methods and is more robust than other similar well-established methods in the literature. By numerical simulation and sensitivity analysis, it is concluded that: (1) The proposed method can provide more stable optimal order policy and profits than the existing ones; (2) For a product with a higher unit purchase price, the optimal order quantities are more sensitive to its change; (3) In view of profitability, the newsboy should not to be too risk-averse.</p>