AbstractConstrained multi‐item inventory models have long presented signifcant computational problems. This article presents a general algorithm to obtain simultaneous solutions for order quantities and safety stocks for each line item in an inventory, while satisfying constraints on average inventory investment and reordering workload. Computational experience is presented that demonstrates the algorithm's efficiency in handling large‐scale applications. Decision rules for several customer service objectives are developed, with a discussion of the characteristics of the inventory systems in which each objective would be most appropriate. The decision rules are approximations, based on the assumptions commonly used in pract