A.1 (Worst‐Case Bound for Deterministic Newsvendor Approximation) As noted in Section 5.3.2, the papers by Zheng (1992) and Axsäter (1996) suggest bounds on the error that results from approximating a stochastic inventory model (the model of Section 5.1, for which an
policy is optimal) by a deterministic one. Suppose we do the same thing for the newsvendor model, setting S equal to the optimal solution to the deterministic problem, i.e.,
. Assume the demand is distributed
.
Prove that
where
is the expected newsvendor cost if S is the order‐up‐to level and
.
Is it possible to identify a fixed worst‐case bound
that holds for any values of the parameters
, and
? Explain your answer.
A.2 (Optimizing Compost Inventory)
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.