Multi‐tier binary solution method for multi‐product newsvendor problem with multiple constraints

This paper considers a multi‐product newsvendor problem with multiple constraints. Multiple constraints in the problem make it more challenging to solve. Previous research has attempted to solve the problem by considering two‐constraint case or/and using approximation techniques or active sets methods. The solution methods in literature for solving multi‐constraint problem are limited or cumbersome. In this paper, by analyzing structural properties of the multi‐constraint multi‐product newsvendor problem, we develop a multi‐tier binary solution method for yielding the optimal solution to the problem. The proposed method is applicable to the problem with any continuous demand distribution and more than two constraints, and its computational complexity is polynomial in the number of products. Numerical results are presented for showing the effectiveness of our method.