Location of Repository

A maximum entropy approach to the newsvendor problem with partial information

By Jonas Andersson, Kurt Jörnsten, Sigrid Lise Nonås, Leif K. Sandal and Jan Ubøe


In this paper, we consider the newsvendor model under partial information, i.e., where the demand distribution D is partly unknown. We focus on the classical case where the retailer only knows the expectation and variance of D. The standard approach is then to determine the order quantity using conservative rules such as minimax regret or Scarf's rule. We compute instead the most likely demand distribution in the sense of maximum entropy. We then compare the performance of the maximum entropy approach with minimax regret and Scarf's rule on large samples of randomly drawn demand distributions. We show that the average performance of the maximum entropy approach is considerably better than either alternative, and more surprisingly, that it is in most cases a better hedge against bad results.Newsvendor model; entropy; partial information

OAI identifier:

Suggested articles



  1. (1958). A min-max solution of an inventory problem.
  2. (2006). Expected value of distribution information for the newsvendor problem,
  3. (1957). Information theory and statistical mechanics,
  4. (1998). Inventory Management and Production Planning and Scheduling.
  5. (2007). Inventory management under highly uncertain demand,
  6. (2001). Minimax analysis for inventory models,
  7. (2011). On the bene of risk pooling in inventory management,
  8. (2010). On the distribution free continuous-review inventory model with a service level constraint,
  9. (2003). Probability Theory: The Logic of Science.
  10. (2011). Regret in overbooking and fare-class allocation for single leg,
  11. (2008). Regret in the newsvendor model with partial information,
  12. (2007). Relative entropy, exponential utility, and robust dynamic pricing,
  13. (2010). Robust controls for network revenue management,
  14. (2011). Robust multi-market newsvendor models with interval demand data,
  15. (2010). Robust newsvendor competition under asymmetric information,
  16. (1993). The distribution free newsboy problem: review and extensions,
  17. (2011). The eect of advertising on the distribution-free newsboy problem,
  18. (2010). The newsvendor problem with unknown distribution,
  19. (1967). The relaxation method of the common point of convex sets and its application to the solution of problems in convex programming,
  20. (1951). The theory of statistical decisions.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.