Large‐Scale Joint Price‐Inventory Decision Problems, Under Resource Limitation and a Discrete Price Set

This article addresses a generalization of the capacitated lot‐size problem (CLSP) as well as the profit maximization capacitated lot‐size problem (PCLSP) considering joint price inventory decisions. This problem maximizes profit over a discrete set of prices subject to resource limitations. We propose a heuristic based on Lagrangian relaxation to resolve the problem, especially aiming for large scale cases. Results of experimentation exhibit the major importance of the capacity constraint. When this one is weak, our heuristic performs particularly well, moreover the numbers of possible prices does not really impact the results.