. A note on extremal combinatorics of cyclic split systems.
Similar to many mathematical fields also the topic of mathematical programming has its origin in applied problems. But, in contrast to other branches of mathematics, we don't have to dig too deeply into the past centuries to find their roots. The historical tree of mathematical programming, starting from its conceptual roots to its present shape, is remarkably short, and to quote Isaak Newton, we can say: "We are standing on the shoulders of giants". The goal of...
A production inventory problem with limited backlogging and with stockouts is described in a discrete time, stochastic optimal control framework with finite horizon. It is proved by dynamic programming methods that an optimal policy is of (s,S)-type. This means that in every period the policy is completely determined by two fixed levels of the stochastic inventory process considered.