Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations

We derive bounds on the expectation of a class of periodic functions using the total variations of higher-order derivatives of the underlying probability density function. These bounds are a strict improvement over those of Romeijnders et al. (Math Program 157:3–46, 2016b), and we use them to derive error bounds for convex approximations of simple integer recourse models. In fact, we obtain a hierarchy of error bounds that become tighter if the total variations of additional higher-order derivatives are taken into account. Moreover, each error bound decreases if these total variations become smaller. The improved bounds may be used to derive tighter error bounds for convex approximations of more general recourse models involving integer decision variables.


Introduction
Consider the two-stage recourse model with random right-hand side η * := min This model describes a two-stage decision problem under uncertainty. The uncertainty arises from the random vector ω of which the distribution is known. In the first stage, a decision x has to be made while the realization of ω is not yet available, whereas in the second stage, the realization of ω is known and recourse actions y can be taken to repair infeasibilities of the random constraints T x ≥ ω. The model is called an integer recourse model if Y = Z n 2 + . If in addition W = I m , then the model is referred to as a simple integer recourse (SIR) model. More general formulations of (1) exist, with uncertainty in the technology matrix T and cost parameters q, see e.g. the textbooks (Birge and Louveaux 1997;Shapiro et al. 2009).
Throughout this paper, we make the following assumptions, which guarantee that Q is finite everywhere.
(i) The recourse is complete: for all s ∈ R m , there exists a y ∈ Y such that W y ≥ s, so that v(s) < ∞. Recourse models are highly relevant in practice, as demonstrated by numerous applications in problems where uncertainty plays a role. Areas of application include energy, telecommunication, production planning, and environmental control; see e.g. Gassmann and Ziemba (2013) and Wallace and Ziemba (2005). Furthermore, integrality restrictions on the recourse actions arise naturally when modelling real-life situations, for example to capture on/off decisions or batch size restrictions.
However, in this paper we focus on an alternative solution methodology introduced by van der Vlerk (1995). His approach is to approximate the non-convex recourse function Q by a convex approximationQ, obtaining an approximating model for (1). The advantage is that the approximating model can be solved efficiently using known convex optimization techniques to obtain an approximate solution (x,ẑ) for (1).
In the literature, convex approximations are typically derived by simultaneously modifying the underlying recourse structure (Y, q, W ) and the distribution of the random vector ω. For example, Klein Haneveld et al. (2006) propose the so-called α-approximations for SIR models, van der Vlerk (2004) studies a class of convex approximations for the general integer case, and Romeijnders et al. (2016b) propose a convex approximation, the shifted LP-relaxation, for integer recourse problems with a totally unimodular (TU) recourse matrix W . The latter approximation is generalized to the general mixed-integer recourse case by Romeijnders et al. (2016a).
To guarantee the performance of the approximating solution (x,ẑ) in the original model (1), Romeijnders et al. (2015) show that for every approximationQ, That is, the absolute optimality gap of (x,ẑ) is at most 2 Q − Q ∞ . For this reason, bounds on Q − Q ∞ are used to guarantee the quality of the approximating solution (x,ẑ). Such error bounds are derived by Klein Haneveld et al. (2006) and by Romeijnders et al. (2015) for various types of convex approximations. They are expressed in terms of the total variations of the marginal probability density functions (pdf) of the random right-hand side vector ω. For general mixed-integer and TU integer recourse models, Romeijnders et al. (2016a, b), respectively, derive similar error bounds by making use of periodicity in the difference of the underlying value functions of the recourse function Q and its convex approximationQ. In this way, bounds on Q − Q ∞ are obtained by deriving total variation bounds on the expectation of periodic functions. Since we also exploit this relationship between expectations of periodic functions and the difference betweenQ and Q, we explain this relationship in more detail in Sect. 2. Romeijnders et al. (2016b) use worst-case analysis to prove that their error bounds are tight for certain piecewise constant pdf. For other pdf, there may be a considerable difference between the error bound and the actual error as shown by numerical experiments on a fleet allocation and routing problem and on an investment problem in stochastic activity networks (Romeijnders et al. 2017). Motivated by these observations, we improve the error bounds of Romeijnders et al. (2016b) by using information on the higher-order derivatives of the underlying pdf of the random variables in the model. To be specific, we use that the total variation of the higher-order derivatives of the underlying pdf can be used to improve the error bound. The intuition behind our approach is that by imposing restrictions on the higher-order derivatives of the underlying pdf we are able to exclude the piecewise constant pdf, which have jump discontinuities.
To obtain these error bounds we improve the existing bounds on the expectation of periodic functions by Romeijnders et al. (2016b) using higher-order total variations, i.e. total variations of the higher-order derivatives of the underlying marginal pdfs. This is the main contribution of this paper since these bounds may be used to improve error bounds of convex approximations for mixed-integer recourse models in general. We illustrate their potential by improving error bounds for the shifted LP-relaxation approximation of SIR models by Romeijnders et al. (2016b). The improved error bounds decrease with the total variations of the underlying pdf and its higher-order derivatives.
The remainder of this paper is organized as follows. Section 2 describes in more detail the relationship between error bounds for the shifted LP-relaxation of integer recourse models and bounds on the expectation of periodic functions. In Sect. 3, we improve bounds on the expectation of a class of periodically monotone functions, and in Sect. 4 we illustrate how these results can be applied in the setting of SIR models. In Sect. 5 we conclude and summarize our results.

Total variation error bounds
In this section, we describe parts of the procedure employed by Romeijnders et al. (2016b) to derive an error bound for the so-called shifted LP-relaxation approximation Q of Q for TU integer recourse models. The idea behind this approximation is to simultaneously relax the integrality restrictions in the model and to perturb the random right-hand side vector ω.

Definition 1
The shifted LP-relaxationQ of the mixed-integer recourse function Q is defined aŝ where e m is the m-dimensional all-one vector.
The shifted LP-relaxation is a special case of the convex approximation for general two-stage mixed-integer recourse models by Romeijnders et al. (2016a). Here, we focus on the one-dimensional SIR case. Partly this is for simplicity, but we are also inspired by the fact that Romeijnders et al. (2016b) derive an error bound for the TU integer recourse case using one-dimensional results. Setting q = 1 and W = 1, the integer recourse function Q reduces to where · denotes the round-up function and s + := max{0, s }, s ∈ R. The shifted LP-relaxation then becomeŝ Since ||Q − Q|| ∞ is the quantity of interest, consider with underlying difference function ψ(t) := (t) + − t − 1/2 + , see Fig. 1. If we ignore the positive part operators and define then ϕ is a real-valued periodic function with period p = 1 and mean value ν = p −1 p 0 ϕ(t)dt = 0. The function ψ, however, is only half-periodic, that is  Romeijnders et al. (2016b) use this property to derive error bounds for the shifted LP-relaxation. Similarly, Romeijnders et al. (2016a) make use of asymptotic periodicity results for mixed-integer programs to find error error bounds for the general mixed-integer recourse case.
The error bounds are based on a worst-case approach with respect to the total variation |Δ| f of the underlying pdf f of ω, since the expectation in (2) is intractable in general. The following definition of total variation is taken directly from Romeijnders et al. (2016b).
Definition 2 Let f : R → R be a real-valued function, and let I ⊂ R be an interval. Let Π(I ) denote the set of all finite ordered sets P = {x 1 , . . . , x N +1 } with x 1 < · · · < x N +1 in I . Then, the total variation of f on I , denoted |Δ| f (I ), is defined as The worst-case approach adopted by Romeijnders et al. (2016b) is to derive a bound, for any bounded periodic function ϕ and B ∈ R with B > 0, on where F denotes the set of all continuous pdf of bounded variation. This bound is used to derive an error bound on Q − Q ∞ in (2), presented in Theorem 1 below. We will improve the bounds on the expectation of periodic and half-periodic functions, which directly leads to an improved error bound for SIR models.
Theorem 1 Consider the simple integer recourse function Q defined as and its shifted LP-relaxation approximationQ, defined aŝ where ω is a continuous random variable with pdf f of bounded variation. Then Proof See Romeijnders et al. (2016b). Romeijnders et al. (2016b) show that there exist piecewise constant pdf for which the error bound in Theorem 1 is tight. For example, for B ≥ 4, the pdff : R → R defined asf Remark 1 Observe thatf can be interpreted as a pdf with |Δ|f = +∞.
In the next sections we will assume that f is continuously differentiable and that its derivative f is of bounded variation. In this way, we exclude piecewise constant densities such asf . By using the higher-order total variations of f we are able to derive tighter bounds.

Improving bounds on the expectation of periodic functions
In this section, we improve the bounds on the expectation of periodic functions derived by Romeijnders et al. (2016b) for the class of point-symmetric periodic functions (see Definition 7). Next to that, we improve bounds on the expectation of half-periodic functions ψ : R → R, which are of the form where ϕ is a point-symmetric periodic function. The organization of this section is as follows. In Sect. 3.1, we consider packed densities, a concept introduced by Romeijnders et al. (2016b) which we generalize to higher-order derivatives. Next, in Sect. 3.2, we introduce point-symmetric periodic functions, the class of periodic functions for which we are able to derive results. In Sect. 3.3 we use the concept of bound propagation to derive a hierarchy of total variation bounds. In Sect. 3.4, we present bounds on the expectation of periodic and half-periodic functions.

Higher-order derivatives of packed densities
The main contribution of this paper is to generalize the results by Romeijnders et al. (2016b) to higher-order derivatives. The key insight here is that including information on the total variation and the maximum norm of higher-order derivatives of the underlying pdf leads to improved expectation bounds. We generalize several definitions by Romeijnders et al. (2016b) to allow for these elements to be included in our analysis. They consider the set F containing all one-dimensional pdf of bounded variation. In Definition 3, we introduce the sets F n , n ∈ N, which satisfy the relationship Definition 3 Let F n denote the set of one-dimensional pdf f , such that the first n derivatives of f exist, are continuous, and are of bounded variation. Denote the k-th derivative of f by f (k) and write f = f (0) .

Definition 4 For all bounded integrable functions ϕ : R → R and positive constants
where || · || ∞ denotes the maximum norm defined as Remark 2 In Definition 4, we could have suppressed the constants C 0 , . . . , C n , since an upper bound B k on |Δ| f (k) directly implies an upper bound B k 2 on || f (k) || ∞ . However, these bounds may be larger than C k so that by including these constants we may obtain tighter bounds.
The main goal of this section is to derive a bound on M n (ϕ, B, C). This is useful, because such a bound can be used to derive performance guarantees for convex approximations of mixed-integer recourse functions. We derive such bounds for periodic and half-periodic functions ϕ. The key objects of our analysis are packed densities, introduced by Romeijnders et al. (2016b), which are functions defined on [0, p] such that for either periodic of half-periodic functions ϕ with period p, For periodic functions ϕ, Romeijnders et al. (2016b) define this packed density as Intuitively, f p (x) represents the sum of the densities corresponding to ϕ(x) and ϕ(x + pk) for every k ∈ Z\{0}. For half-periodic functions ϕ, however, we require an alternative packed density, which we call the half-packed density. This packed density does not include the values of f (x + pk) for k < 0, since ϕ is only half-periodic and thus ϕ(x + pk) = 0 for k < 0. Definition 5 below contains the definitions of both the original and the new packed density.
Definition 5 For all f ∈ F 0 and p ∈ R with p > 0, define the classical packed density f p : [0, p] → R as Remark 3 Note that the half-packed density does not integrate to one in general, as opposed to the classical packed density. As a result, the half-packed density cannot be interpreted as a pdf.
Remark 4 We define the (higher-order) derivatives of the classical packed density and the half-packed density at the endpoints of the closed interval [0, p] by their one-sided derivatives, provided that they exist. Romeijnders et al. (2016b) show that the total variation of f can be used to bound the total variation of f p on [0, p]. Interestingly, similar bounds can be derived for the total variation of half-packed densitiesf p on [0, p]. Moreover, similar bounds also hold for higher-order derivatives f (k) , k = 1, . . . , n, of f . Lemma 1 Let n ∈ N be given and let f ∈ F n . Consider its corresponding classical packed density f p and half-packed densityf p , as in Definition 5. Then, for k = 0, . . . , n, Moreover, for all bounded integrable periodic functions ϕ with period p, and half-periodic functions ψ of the form Proof We refer to the proof of corresponding properties involving packed densities in Romeijnders et al. (2016b).
Observe that the properties involving the classical packed density generalize readily to higher-order derivatives. With respect to the half-packed density, notice the additional terms f (k) (0) and −| f (k) (0)| in properties (ii) and (iii), respectively. These terms result from the fact that the half-packed density only sums over the non-negative integers.
In our analysis in the next sections, we will initially not make a distinction between the classical packed density and the half-packed density. This is possible because they belong to the broader class of packed densities, which we introduce in Definition 6.
Definition 6 For a given n ∈ N and p ∈ R with p > 0, let g : [0, p] → R be an n times continuously differentiable function such that its first n derivatives are of bounded variation on the interval [0, p]. Assume γ k := g (k) ( p) − g (k) (0) is bounded for k = 0, . . . , n. Then g is referred to as a packed density with discontinuities γ = (γ 0 , . . . , γ n ).
Indeed, from Lemma 1 it follows directly that both the classical and the halfpacked density are packed densities with discontinuities γ = (0, . . . , 0) and ( f (0) (0), . . . , f (n) (0)), respectively. Considering property (iv) in Lemma 1, we are interested in the quantity for a periodic function ϕ and a packed density g of Definition 6. It equals the expectation of a periodic function if g is a classical packed density, in which case the discontinuities corresponding to g are γ = (0, . . . , 0). Furthermore, for ϕ defined as in (3), the quantity D(ϕ, g) is equal to the approximation error of the shifted-LP relaxation of a simple integer recourse model if g is a half-packed density,f p of Definition 5, with γ = ( f (0) (0), . . . , f (n) (0)).

Point-symmetric periodic functions
We restrict our attention to point-symmetric periodic functions, a concept we introduce in Definition 7, since the underlying periodic function that arises when studying the shifted LP-relaxation for TU integer recourse models is point-symmetric periodic with period p = 1. However, our results apply to all point-symmetric periodic functions ϕ with period p > 0.
Definition 7 A periodic function ϕ : R → R with period p satisfying for all x ∈ [0, p] is said to be point-symmetric periodic, or a PSP( p) function.
For a packed density g of Definition 6 and a PSP( p) function ϕ, we are able to derive an upper bound on D(ϕ, g). The first step we take in obtaining such a bound is to prove in Lemma 2 that there exists a function g p that is symmetric in the same sense as ϕ and carries all relevant information of g for computing D(ϕ, g). Moreover, the total variation of g p on [0, p] does not exceed that of g on [0, p]. Next, in Lemma 3, we obtain bounds on higher-order derivatives of g p by combining the symmetry of g p with the mean-value theorem. In Sect. 3.3, we translate these bounds into a single bound on g p , a process we refer to as bound propagation.
Lemma 2 Let n ∈ N and p ∈ R with p > 0 be given. Let ϕ : R → R be a PSP( p) function. For a packed density g of Definition 6, define g p : [0, p] → R as Then, and for all integers k satisfying 0 ≤ k ≤ n, Proof For property (i), note that it follows from a substitution that where the latter equality holds since ϕ is a PSP( p) function. Using (iv) in Lemma 1 we have and thus the first equality in (i) holds. To prove the second equality in (i), note that where the second term on the right-hand side can be rewritten as To prove (ii) we make use of standard properties of the total variation of functions. Define l : R → R as l(x) := g( p − x). We have where the second equality holds since |Δ|(α f )(I ) = |α||Δ| f (I ), for every closed interval I ⊂ R, scalar α and f of bounded variation, and where the inequality follows from |Δ|( f + g)(I ) ≤ |Δ| f (I ) + |Δ|g(I ) for f and g of bounded variation.
We now state and prove a number of properties of g p that we will use to prove the results in Sects. 3.3 and 3.4. We make a distinction between odd and even-order derivatives of g p , because they share different properties.
To prove property (iv) we make use of the mean-value theorem and property (ii). Together they imply that there exists a c k ∈ (0, p) such that The existence of x k ∈ (0, p/2] as in property (iv) then follows from the symmetry of odd-order derivatives, see (8).
Consider the partition P = {0, t * , p − t * , p}. Following the notation introduced in Definition 2, we have for this partition, where the equality is due to equation (8) and property (ii). We thus find a contradiction with Lemma 2, property (ii). Property (v) follows in a similar fashion, since by combining (iv) with (8) it is possible to arrive at a contradiction with property (ii) in Lemma 2 if (v) does not hold.

Bound propagation
In this section, we use the bounds on g (k) p , k = 0, . . . , n, in Lemma 3 to derive a single tighter bound on g p as defined in (7) for a given packed density g with known discontinuities (γ 0 , . . . , γ n ). We use information on the total variation of g and its higher-order derivatives to bound g p . Clearly, we obtain tighter bounds if we include information on more higher-order derivatives of g.
For illustration, suppose that information is available on g and g (1) . Given a bound on |Δ|g, property (iii) in Lemma 3 directly yields a uniform bound on |g p (x)| for x ∈ [0, p], denoted w 0 . An additional bound on |Δ|g (1) yields a bound on |g using property (v) in Lemma 3. The latter bound can be used to improve the bound on |g p (x)| itself, using the concept of bound propagation, which we will now demonstrate.
Let q(x) be such that g (1) p (x) ≤ q(x) for x ∈ [0, p/2]. Using that g p ( p/2) = 0 according to property (i) in Lemma 3, and that we obtain an upper bound on |g p (x)|. Similarly we can extrapolate around x = 0 and use the fact that g p (0) = γ 0 2 to obtain This means that we can transform an upper bound q(x) on |g (1) p (x)| for all x ∈ [0, p/2] into an upper bound on |g p (x)| for every x ∈ [0, p/2]. We formalize this transformation by defining an operator T that maps the upper bound q on |g (1) p | into an upper bound T q on |g p |. This operator is defined as, and includes the uniform upper bound w 0 on |g p | as defined in Lemma 3 (iii). From the analysis above it follows that |g p (x)| ≤ (T q)(x) for x ∈ [0, p/2]. Note that (T q)(x) provides a tighter bound than the bound based on |Δ|g alone, which is given by w 0 . We generalize this idea to higher-order derivatives by introducing appropriate operators in Definition 8. The idea is that a bound q on |g n p | may be propogated in dynamic programming fashion to obtain a bound T · · · T q on |g p |. In our case, however, we have to define two operators T 1 and T 2 since the process of bound propagation is different for odd and even higher-order derivatives. In Definition 9, we use these operators to define functions q n 0 , n ∈ N, which represent a bound on g p (x) based on information on the first n derivatives of g. Intuitively, including more derivatives should lead to sharper bounds. This intuition is confirmed in Corollary 1.
Definition 8 For a given p > 0, a function q : [0, p/2] → R, and parameters w > 0 and γ ∈ R, define the operators T 1 w,γ and T 2 w,γ by Definition 9 Let n ∈ N and p > 0 be given. Let w k > 0 and γ k ∈ R, k = 0, . . . , n, be given constants. Define q n n : [0, p/2] → R as q n n (x) := w n . For k < n, define q n k : [0, p/2] → R using backward recursion as q n k := Before we are ready to prove that q n 0 yields a bound on |g p |, we need some elementary properties of the operators introduced in Definition 8. In Lemma 4, we prove that T j , j = 1, 2, are non-negative and monotone operators.
Proof Property (i) follows directly from the non-negativity of q. Property (ii) is a direct consequence ofq ≥ q.
Proposition 1 Let n ∈ N and p > 0 be given. Let g : [0, p] → R be a packed density with discontinuities (γ 0 , . . . , γ n ). Define g p : [0, p] → R as g p (x) := 1 2 (g(x) − g( p − x)). For k = 0, . . . , n, define w k := by the triangle inequality. Using the induction hypothesis and the fact that q n m+1 is a non-negative function, we obtain Then, (11) follows by inserting g (m) p (0) = γ m 2 by Lemma 3 (ii), and rearranging terms. The inequality in (12) can be proved in a similar manner as (11) by applying the triangle inequality to g (m) p (x) . We conclude that the induction step holds for even m.
For odd m, we have to show that and The inequality in (13) follows directly from property (v) in Lemma 3. To prove (14) we make use of in Lemma 3 (iv), which states that there exists x m ∈ (0, p/2] such that g (m) p (x m ) = − γ m−1 p . By the triangle inequality, Together with the induction hypothesis, this yields To arrive at (14), we make the following observation where the inequality holds since x m ∈ (0, p/2] and q n m+1 is non-negative. This completes the induction step for odd m, and the proof of (9).
We now present a corollary of Lemma 4, which states the intuitive result that the bounds on g p become sharper if more higher-order derivatives are included.
Corollary 1 Let n ∈ N and p > 0 be given. Let γ k and w k > 0, k = 0, . . . , n, be given constants. Define q l 0 , l = 0, . . . , n, as in Definition 9. Then, Proof Fix an l ∈ {1, . . . , n}. We will use backward induction to prove that q l−1 k ≥ q l k for k = 0, . . . , l − 1. The claim then follows by setting k = 0. It follows directly from the definition of q n k that q l−1 l−1 ≥ q l l−1 . For the induction step, suppose that q l−1 k ≥ q l k for some k, 0 < k ≤ l − 1. It follows from the monotonicity of T j , j = 1, 2, that q l−1 k−1 ≥ q l k−1 , completing the proof.

Error bounds
We are now ready to state the main results of this section. In Theorem 2, we formulate an improved bound on the expectation of PSP( p) functions and Theorem 3 states the bound on the expectation of half-periodic functions where the underlying periodic function is PSP( p).
Theorem 2 Let n ∈ N and p > 0 be given. Let ϕ : R → R be a PSP( p) function and let B = (B 0 , . . . , B n ) and C = (C 0 , . . . , C n ) be positive constants. Then, for M n defined as where q n 0 is defined as in Definition 9, with γ k = 0, k = 0, . . . , n, and Proof For a given PSP( p) function ϕ and pdf f ∈ F n , we know from Lemma 1 that where f p denotes the classical packed density corresponding to f . The function f p is a packed density with discontinuities γ = (0, . . . , 0). Lemma 2 informs us that This implies By Lemma 1, property (iii), we know that B k is an upper bound on |Δ| f k p ([0, p]), k = 0, . . . , n. Combining Proposition 1 with the monotonicity of the operators T j , j = 1, 2, yields that q n 0 is an upper bound on |g p |, completing the proof. Remark 5 Note that the bound presented in Theorem 2 is independent of C. This is because the discontinuities of the classical packed density are zero.
Theorem 3 Let n ∈ N and p > 0 be given. Let ψ : R → R be a half-periodic function defined as where q n 0 is defined as in Definition 9, with γ k = C k , k = 0, . . . , n, and Proof For a given half-periodic function ψ with underlying PSP( p) function ϕ and pdf f ∈ F n , we know from Lemma 1 that wheref p denotes the half-packed density corresponding to f . The functionf p is a packed density with discontinuities γ = ( f (0) (0), . . . , f (n) (0)). Lemma 2 informs us that This implies By Lemma 1, property (iii), we know that Combining Proposition 1 with the monotonicity of the operators T j , j = 1, 2, yields that q n 0 is an upper bound on |g p |, and the result follows.

Applications and examples
In this section, we apply the results in Sect. 3 to specific functions. As in Sect. 3, we make a distinction between periodic and half-periodic functions. First, we apply Theorem 2 to a particular PSP( p) function. Second, we derive an improved error bound for the shifted LP-relaxation approximation of one-dimensional SIR models. Since the underlying difference function is half-periodic, we can use Theorem 3 to derive such a bound. This error bound can be generalized to higher-dimensional SIR models. Finally, we conduct numerical experiments to compare the performance of the error bound by Romeijnders et al. (2016b) and the improved bound derived in this section.

Point symmetric periodic functions
Here, we derive a bound on the expectation of the underlying periodic function ϕ for the shifted LP-relaxation for SIR models, defined as ϕ(x) := x − x − 1 2 . Note that ϕ is a PSP(1) function and that |ϕ(x)| = x for x ∈ [0, 1 2 ]. In the notation of Theorem 2, take n = 1, which is to say that we make use of the total variation of the underlying pdf and its first derivative. Furthermore, q 1 1 (x) = B 1 2 and Applying Theorem 2 yields Using this, we find that for any f ∈ F 1 Since this bound holds for all f ∈ F 1 , it follows that if ω has pdf f ∈ F 1 , then This result is an improvement of the bound by Romeijnders et al. (2016b), who showed that Note that the improvement is large if |Δ| f is small relative to |Δ| f . We now apply this result to a range of specific pdf's.
Example 1 Let f denote the pdf of a normally distributed random variable ω with variance σ 2 . Then, Observe that the ratio increases linearly in σ . This implies that the improvement over the original total variation bound is unbounded and increases with σ .
We have Figure 2 shows the true value of sup z∈R {E ω [ϕ(ω − z)]}, the upper bound 1 2 h(|Δ| f ) derived by Romeijnders et al. (2016b), and the upper bound k(|Δ| f, |Δ| f ) based on M 1 . Moreover, we include the upper bound based on M 2 . The latter bound is tractable, but an analytical expression is cumbersome and does not yield further insights and is therefore omitted. Note that the bounds based on M 1 and M 2 provide a tighter bound compared to 1 2 h(|Δ| f ) for large values of σ . ♦ Note that our results only apply to continuously differentiable pdf, nevertheless, for continuous pdf f that are not continuously differentiable we can still apply our Example 2 Suppose that ω follows a triangular distribution with support [a, b] and mode m, a < m < b. See Fig. 3 for illustration.
Denote the pdf of ω by f . Write d := b − a and note that f (m) = 2 d , so that, furthermore, .

This leads to
Note that |Δ| f is independent of the mode m, however, changing m does affect |Δ| f + . In fact, for given a and b, |Δ| f + is minimized by m = 1 2 (a + b). Hence, as the mode is closer to the midpoint of the support of ω, |Δ| f + is smaller and we obtain tighter bounds. ♦

Error bound shifted-LP relaxation
In this section, we consider the underlying difference function ψ, defined in (4), for the shifted LP-relaxation for SIR models. Recall that bounds on the expectation of ψ can be used directly to derive error bounds for the shifted LP-relaxation for SIR models. We apply Theorem 3 with n = 1 to derive a such a bound. We have ϕ(x) = x − x − 1 2 . Like in Sect. 4.1, |ϕ(x)| = x for all x ∈ [0, 1 2 ]. Note that q 1 1 (x) = C 0 + B 1 2 =: D and that Hence, by Theorem 3, where D = 2C 0 + B 1 . Note that for any pdf f , where equality holds if f is unimodal. For this reason, we take C 0 = B 0 2 , so that the resulting bound holds for all pdf f ∈ F 1 . For unimodal pdf's the resulting bound is the tightest bound we can provide, whereas tighter bounds can be derived for nonunimodal pdf. Simple computations yield where S(x, y) := 1 − x (2x + 3y) 3 (x + y) 2 ∈ (1/3, 1), for positive x and y. We thus have that for any f ∈ F 1 , The original bound by Romeijnders et al. (2016b) is given by |Δ| f 16 , so S(|Δ| f, |Δ| f ) represents the improvement over their results. Note that S(|Δ| f, |Δ| f ) → 1 3 as |Δ| f |Δ| f → 0, which is to say that the improvement factor converges to three. We return to this fact in the following example, where we apply our results to a normally distributed random variable.
Example 3 We numerically evaluate ||Q − Q|| ∞ in the one-dimensional SIR case, whereQ denotes the shifted-LP relaxation by Romeijnders et al. (2016b) as in Definition 1 and where ω follows a normal distribution with arbitrary mean and variance σ 2 , for σ ∈ [0.2, 4]. We compare the actual error to the error bound based on Romeijnders et al. (2016b) and the improved error bounds based on M 1 and M 2 . We omit the analytical expression for the bound based on M 2 , which is tractable but cumbersome. Denote the pdf of ω by f . To compute the (improved) error bounds, we make use of the expressions for |Δ| f and |Δ| f found in Example 1. It follows from these expressions that as σ → ∞, which implies that the improvement factor over the original total variation bound converges to three for large values of σ . Figure 4 shows the results of this numerical experiment. Note that the improvement over the original error bound increases with σ . ♦

Conclusion
We consider existing convex approximations for two-stage mixed-integer recourse models. We construct a hierarchy of bounds on the expectation of periodic and half- periodic functions using total variations of higher-order derivatives of the underlying probability density function. We use these results to derive improved error bounds for the shifted LP-relaxation of simple integer recourse models. Moreover, the results presented here may be used to improve error bounds of convex approximations for general mixed-integer recourse model approximations.
There are multiple directions for future research. One extension is to generalize our results to a to a higher-dimensional setting. A first step in this direction may be to consider totally unimodular integer recourse models. Another avenue is to apply the results to a particular application of integer recourse models. Finally, our results may be extended to a larger class of periodic functions, which may be useful for other types of convex approximations.