A strong Lagrangian relaxation for general discrete-choice network revenue management

Discrete-choice network revenue management (DC-NRM) captures both customer behavior and the resource-usage interaction of products, and is appropriate for airline and hotel revenue management, dynamic sales of bundles in advertising, and dynamic assortment optimization in retail. The state-space of the DC-NRM stochastic dynamic program explodes and approximation methods such as the choice deterministic linear program, the affine, and the piecewise-linear approximations have been proposed to approximate it in practice. The affine relaxation (and thereby, its generalization, the piecewise-linear approximation) is intractable even for the simplest choice models such as the multinomial logit (MNL) choice model with a single segment. In this paper we propose a new Lagrangian relaxation method for DC-NRM based on an extended set of multipliers. An attractive feature of our method is that the number of constraints in our formulation scales linearly with the resource capacities. While the number of constraints in our formulation is an order of magnitude smaller that the piecewise-linear approximation (polynomial vs exponential), it obtains a bound that is as tight as the piecewise-linear bound. If we assume that the consideration sets of the different customer segments are small in size—a reasonable modeling tradeoff in many practical applications—our method is an indirect way to obtain the piecewise-linear approximation on large problems effectively. Our results are not specific to a particular functional form (such as MNL), but hold for any discrete-choice model of demand. We show by numerical experiments that our Lagrangian relaxation method can provide substantial improvements over existing benchmark methods, both in terms of tighter upper bounds, as well as revenues from policies based on the relaxation.


Introduction and literature review
In industries such as hotels, advertising, and airlines, the products consume one multiple resources (for example, multi-night stays, bundles of advertising timeslots, multi-leg itineraries) and each product has a specific price, set based on the price sensitivity of the customer segment it is aimed at, the market conditions, and the product characteristics. The resources are perishable; for instance, for an airline, empty at the moment of departure get no revenue, so the inventory "perishes" at departure. The firm's revenue management function is to decide, at every point in time during the sale period, what products to open for sale-the tradeoff being selling too much at too low a price early and running out of capacity, or, rejecting too many low-valuation customers and ending up with unsold inventory. Network revenue management (NRM) is control based on the demands for the entire network. Chapter 3 of Talluri and van Ryzin [23] contains the necessary background on NRM.
NRM incorporating more realistic models of customer behavior, as customers choosing from a set of offered products, was initiated in Talluri and van Ryzin [22] for the single-resource problem. Discrete-choice models are parsimonious as they model the probability of purchase as a function of product characteristics, such as price and restrictions, reducing the number of parameters to estimate. The subsequent optimization problem can be formulated as a stochastic dynamic program that we call discrete-choice NRM (DC-NRM) dynamic program.
The DC-NRM dynamic program is computationally intractable and hence many approximation methods have been proposed, starting with Gallego et al. [7] and Liu and van Ryzin [15] who formulate the choice deterministic linear program (CDLP). Zhang and Adelman [26] propose an affine approximation to the value function, while Meissner and Strauss [16] propose a piecewise-linear approximation. Kunnumkal and Topaloglu [14] use Lagrangian relaxation ideas to come up with a separable approximation. All of the above mentioned approximation methods obtain upper bounds on the value function, with the piecewiselinear approximation obtaining the tightest upper bound.
Unfortunately, most of these approximation methods themselves are intractable, even for simple choice models. Liu and van Ryzin [15] show that CDLP is tractable for the multinomial logit (MNL) model provided the subset of products of interest to the different customer segments (consideration sets) are disjoint. However, CDLP is NP-complete when the segment consideration sets overlap even under the MNL model with two customer segments (Bront et al. [5], Rusmevichientong et al. [18]). Kunnumkal and Talluri [11] show that the affine approximation of Zhang and Adelman [26] is NP-hard for the MNL model with even a single segment, which implies a similar hardness result for the piecewiselinear approximation as well. These negative results show us the limits of tractability even for the simplest choice model such as the MNL model.
One approach to obtain a tractable model is to approximate the underlying discrete choice model with a simplified model that limits the number of choices. For example, Chen and de Mello [6] consider a buy-up/buy-down model which is tractable and can be solved efficiently. In this paper, we take a different approach to tractability; we work with the underlying discrete-choice model but come up with a tractable approximation to the value function of the DC-NRM dynamic program. In particular, we propose a new Lagrangian relaxation method for DC-NRM based on an extended set of multipliers. The number of constraints in our formulation scales linearly with the resource capacities, making it a tractable alternative for large networks. On the other hand, we show that our extended Lagrangian relaxation obtains a bound that is as tight as the piecewise-linear bound. The biggest practical impact of our work is in showing that the complexity of the Lagrangian relaxation method (in terms of the number of constraints in the linear programming formulation of the problem) scales linearly with the resource capacities, while that of the piecewise-linear approximation is exponential-yet they arrive at the same value function approximation. If we assume that the consideration sets of the different customer segments are small in size-a reasonable modeling tradeoff in many practical applications as we argue next-our method is able to solve relatively large problems, which would have been impossible if one were to try solving the piecewise-linear approximation directly.
Since we work with general discrete-choice models, all the negative complexity results for the MNL model carry over for the Lagrangian relaxation as well as we show that our Lagrangian relaxation is equivalent to the piecewise-linear relaxation. The great advantage however is that the number of constraints in the Lagrangian relaxation depends directly on the size of the consideration sets of the different segments. These fortunately are quite small in practice: in the airline setting for instance, a segment's consideration set consists of choices (on one airline) for travel between an origin and destination, and typically there are only a few alternatives on a given date (Talluri [20]). For hotels, as the product consists of a multi-night stay and most customers arrive with a fixed duration of stay in mind, the consideration set consists of the types of rooms and products, usually not a very large number.
Research in the marketing area also gives evidence supporting that customers have relatively small consideration sets: Hauser and Wernerfelt [9] report average consideration set sizes of 3 brands for deodorants, 4 brands for shampoos, 2.2 brands for air fresheners, 4 brands for laundry detergents and 4 brands for coffees. (Note that the study is for brands rather than choices of sizes or colors.) Another line of marketing research finds great value in deliberately limiting customer choices to a small number (Iyengar and Lepper [10]). Assuming small consideration set sizes, Talluri [21] and Meissner et al. [17] study tractable approximations to CDLP for DC-NRM. While our segment-based relaxation has the same underlying motivation, the development is quite different as we work with the Lagrangian relaxation of the DC-NRM dynamic program.
Our final contribution in this paper is showing by numerical experiments that our Lagrangian relaxation method can provide substantial improvements over existing methods.
Our work builds on previous research on Lagrangian relaxations for NRM. Topaloglu [24] was the first paper to propose a time-based Lagrangian relaxation approach for the perfect segmentation case (also called the independent-class assumption). The Lagrangian relaxation of Topaloglu [24] associates Lagrange multipliers with each product in each time period, and Kunnumkal and Talluri [13] show that it obtains an upper bound that coincides with the piecewise-linear bound. In contrast, for DC-NRM, we give an example which illustrates that the approach proposed by Topaloglu [24] can be weaker than the piecewise-linear approximation. This motivates our approach that associates Lagrange multipliers with every offer set, and obtains a bound that is as tight as the piecewise-linear bound. We note that the Lagrangian relaxation we propose is different from that in Topaloglu [24] and consequently has different structural properties. Moreover, an appealing feature of our method is that it extends very naturally to the case where there are multiple customer segments each interested in a small subset of the products. We build on our Lagrangian relaxation idea and propose a segment-based approximation that is a tractable alternative when the considerations sets of the different segments are small in size.
In parallel to a working version of this paper, Vossen and Zhang [25] study the properties of approximate linear programming methods for NRM and show that the affine and piecewise-linear formulations can be significantly reduced in size. Their reduced formulation of the piecewise-linear program for DC-NRM can be shown to be equivalent to our Lagrangian relaxation method (Sect. 5.4 in Vossen and Zhang [25]). We note however that our starting point is a Lagrangian relaxation of the DC-NRM dynamic program and our proof technique is quite different. Moreover, we show that it is not possible to recover the piecewise-linear approximation upper bound for DC-NRM by using product-specific multipliers as in the perfect segmentation case. Consequently, the expanded form, using offer-set specific multipliers is the best we can hope for. Finally, even though the number o of our Lagrangian relaxation (and the reduced piecewise-linear approximation) is linear in the number of resources, it is still exponential in the number of products. We propose a new segment-based Lagrangian relaxation that remains tractable provided the consideration sets of the different customer segments are small in size.
To summarize, we make the following research contributions in this paper: 1. We propose a new Lagrangian relaxation method for DC-NRM based on an extended set of Lagrange multipliers. 2. The number of constraints in our Lagrangian relaxation (in the linear programming formulation of the problem) scales linearly with the resource capacities making it a tractable alternative for large networks. Another appealing feature of our approach is that it decomposes the network problem into a number of single resource problems, which can be potentially solved in a distributed fashion. 3. We show that our Lagrangian relaxation obtains an upper bound on the value function as tight as the piecewise-linear bound. The number of constraints in the Lagrangian relaxation scales linearly with the resource capacities, while the piecewise-linear approximation is exponential, hence leading to a substantial reduction in running time in practice. This result also implies that the Lagrangian relaxation bound is stronger than the affine approximation bound (hence also CDLP) that was not known previously. It should be noted that our results are not specific to a particular functional form (such as MNL), but hold at a full level of generality, for any discrete-choice model of demand.
4. We show how our ideas lead to a tractable method for DC-NRM (for any discretechoice model) when the consideration sets of the different segments are small in size. 5. Our numerical experiments indicate that our Lagrangian relaxation can obtain significantly tighter upper bounds than the benchmark methods including the CDLP and the affine approximation. We also extract policies from our formulation and show by numerical experiments that it can lead to notable improvements in revenue over existing methods.
The remainder of the paper is organized as follows: In Sect. 2 we describe the DC-NRM model, the notation, and the stochastic dynamic programming formulation of the problem. Section 3 reviews the value function approximation methods in the literature including CDLP, the affine and the piecewise-linear approximation methods. In Sect. 4 we describe the Lagrangian relaxation approach and show that it obtains a bound that is as tight as the piecewise-linear bound; we defer the formal proof to Sect. 5. Section 6 describes the segment-based Lagrangian relaxation that is tractable under the assumption of small consideration sets. In Sect. 7 we perform numerical experiments to compare the performance of the Lagrangian relaxation approach with benchmark solution methods.

Problem formulation
A product is a specification of a price and the set of resources that it consumes. For example, for an airline a product is an itinerary-fare class combination, where an itinerary is a combination of flight legs making up a passenger's journey; for a hotel, a product is a multi-night stay for a particular room type at a certain price point. Our model is discrete-time with intervals, indexed by t. The booking horizon begins at time t = 1 and ends at t = ; all the resources perish instantaneously at time + 1 . We make the standard assumption that the time intervals are fine enough so that the probability of more than one customer arriving in any single time period is negligible. We index resources by i, products by j, and time periods by t. We refer to the set of all resources as  and the set of all products as  . We let f j denote the revenue associated with product j and  j ⊂  the subset of resources it uses. Similarly, we let  i ⊂  denote the subset of products that use resource i.
We use superscripts on vectors to index the vectors and subscripts to indicate their components. For example, we write the resource capacity vector associated with time period t as r t and use r t i to represent the capacity on resource i in time period t. Therefore, r 1 = r 1 i represents the initial capacities on the resources and r t = r t i denotes the remaining capacities on the resources at the beginning of time period t. The remaining capacity r t i takes values in the set  i = 0, … , r 1 i and  = ∏ i  i represents the state space.

Demand model
In each time period the firm offers a subset S of its products for sale, called the offer set. A customer arrives with probability and given an offer set S, an arriving customer purchases a product j in the set S or decides not to purchase. The no-purchase option is indexed by 0 and is always present for the customer. We let P j (S) denote the probability that the firm sells product j given that a customer arrives and the offer set is S. Clearly, P j (S) = 0 if j ∉ S . The probability of no sale given a customer arrival is P 0 (S) = 1 − ∑ j∈S P j (S) . We assume that the choice probabilities are given by an oracle, as the model represents a general discrete-choice model; they could conceivably be calculated by a simple formula as in the case of the multinomial logit (MNL) model (Ben-Akiva and Lerman [3]).

DC-NRM dynamic program
The dynamic program (DP) to determine optimal controls is as follows: Let V t (r t ) denote the maximum expected revenue to go, given remaining capacity r t at the beginning of period t. Then V t (r t ) must satisfy the Bellman equation where e i is a vector with a 1 in the ith position and 0 elsewhere and represents the set of products that can be offered given the capacity vector r . We use 1 [⋅] as the indicator function, 1 if true and 0 if false. The boundary conditions are V +1 (r) = V t (0) = 0 for all r and for all t, where 0 is a vector of all zeroes. V DP = V 1 (r 1 ) denotes the optimal expected total revenue over the booking horizon, given the initial capacity vector r 1 .
For brevity of notation, we assume that = 1 in the remaining part of the paper. We note that this is without loss of generality since this is equivalent to letting P j (S) = P j (S) and P 0 (S) = P 0 (S) + 1 − , and working with the choice probabilities P j (S) | ∀j, S .

Linear programming formulation of the DC-NRM dynamic program
The value functions can, alternatively, be obtained by solving a linear program, following Schweitzer and Seidmann [19]. The linear programming formulation of the DC-NRM dynamic program has a decision variable V t (r) for each state vector r in each period t and is as follows: A strong Lagrangian relaxation for general discrete-choice… with the boundary conditions that V +1 (r) = V t (0) = 0 for all r and for all t. Both the dynamic program (1) and linear program DP are computationally intractable, but the linear program DP turns out to be useful in developing value function approximation methods.

Value function approximation methods
In this section, we describe three methods in the literature to approximate the DC-NRM dynamic program value function. We begin with the choice-based deterministic linear program and then outline the affine and the piecewise-linear approximations.

Choice-based deterministic linear program (CDLP)
The choice-based deterministic linear program CDLP), proposed in Gallego et al. [7] and Liu and van Ryzin [15] is given by In the above linear program, we interpret the decision variable S,t as the frequency with which set S is offered at time period t. The objective function captures the total expected revenue, while the first set of constraints ensure that the total expected (2) capacity consumed on each resource does not exceed its available capacity. The second set of constraints ensures that the total frequencies add up to 1 at each time period.
Liu and van Ryzin [15] show that the optimal objective function value of CDLP gives an upper bound on the optimal expected revenue. That is, Since CDLP has an exponential number of decision variables it has to be solved using column generation. Liu and van Ryzin [15] show that column generation is efficient for the MNL model with a single segment. However, the column generation procedure is intractable in general, NP-complete for MNL with just two segments (Bront et al. [5] and Rusmevichientong et al. [18]).

Affine approximation
The affine approximation, proposed by Zhang and Adelman [26], replaces the value function V t (r) with the affine function t + ∑ i V i,t r i in the linear program DP to obtain the following linear program: Zhang and Adelman [26] show that the optimal objective function value of AF gives an upper bound on the optimal expected revenue and this bound is tighter than the CDLP bound. While the number of decision variables in AF is manageable, the number of constraints is exponential both in the number of resources as well as the products. Vossen and Zhang [25] show that AF has a reduced formulation where the number of constraints is exponential only in the number of products. Still, the problem has to be solved by constraint generation and the separation problem is intractable even for the MNL choice model with a single segment (Kunnumkal and Talluri [11]).

Piecewise-linear approximation
Meissner and Strauss [16] propose the piecewise-linear approximation, which approximates the value function V t (r) with ∑ i v i,t (r i ) in DP. The resulting linear program is

3
A strong Lagrangian relaxation for general discrete-choice… Since the piecewise-linear approximation uses a more refined approximation architecture than the affine approximation, it is natural to expect that it obtains a tighter bound on the value function. Indeed, Meissner and Strauss [16] show However, as with CDLP and AF, tractability remains as much, if not more, of an issue for PL as well. Note that linear program PL has (2 � � ∏ i r 1 i ) constraints, which is exponential both in the number of products and the number of resources. Moreover, the separation problem of this linear program is NP-complete, even for MNL with a single segment; see Kunnumkal and Talluri [11].

Lagrangian relaxation using offer-set specific multipliers
In this section, we present our approximation method to obtain an upper bound on the value function of the DC-NRM dynamic program. We first describe our approach and then show that it obtains an upper bound that is as tight as that obtained by PL.
We begin by introducing some notation. For an offer set S, we let be the set of resources used by the products in S. We follow the convention that the empty set does not use any resource. We also let  i = S | i ∈  S and note that i ∈  S if and only if S ∈  i . Therefore,  i can be roughly interpreted as the collection of offer sets that use resource i. Optimality equation (1) can be equivalently written, in an expanded form, as where the decision variable h ,S,t can be interpreted as the frequency with which set S is offered at time period t. In the expanded formulation, we also have resource level decision variables h i,S,t , which can be interpreted as the frequency with which set S is offered on resource i at time period t. Constraints (5) ensure that for each set S, the frequencies are identical across the resources used by it, while constraints (6) ensure that a set is offered only if there is sufficient capacity on each resource that it uses. Constraints (7)-(9) ensure that the frequencies are nonnegative and add up to at most 1. We note that although the expanded formulation has a number of redundant decision variables and constraints, they turn out to be useful in the development of our approximation method below.
The expanded formulation still has a high dimensional state space and remains intractable. Our approximation method reduces the dimensionality by solving a number of single dimensional dynamic programs, one for each resource. We relax constraints (5) and associate Lagrange multipliers i,S,t with them. This decouples the decisions across the different resources and makes the optimization problem separable across the resources. Indeed, it can be shown by induction that the value function approximation for the relaxed problem can be obtained by solving a number of single dimensional dynamic programs; one for each resource and an auxiliary dynamic program. In particular, we solve the optimality equation for resource i with the boundary condition that i, +1 (⋅) = 0 , where the superscript emphasizes the dependence of the value function approximation on the Lagrange multipliers. Collecting the terms involving h ,S,t in the objective function of the relaxed problem, we solve the auxiliary dynamic program , h ,S,t ≥ 0 ∀S with the boundary condition that , +1 = 0 . We use as our value function approximation corresponding to the Lagrangian relaxation. Lemma 1 below shows that the Lagrangian relaxation using offer-set specific multipliers (LRo) obtains an upper bound on the optimal expected revenue and that this bound is potentially weaker than the piecewise-linear bound.

Lemma 1
Proof Appendix. □ We obtain the tightest upper bound on the optimal expected revenue by solving The following proposition gives the subgradients of i,t (r i ) and ,t (thereby also showing they are convex functions of ). It follows that V t (r) is also a convex function of and hence the above optimization problem can be efficiently solved as a convex program, for example by using subgradient search (Bertsekas [4], Chapter 7). That is, for a given set of Lagrange multipliers , we can solve the singledimensional dynamic programs (10) and (11) to obtain i,t (⋅) and ,t , respectively. We can then use Proposition 1 below to obtain a subgradient of V 1 r 1 and update the Lagrange multipliers. We introduce some notation for this purpose. Let h i,S,t (r i ) denote an optimal solution to problem (10) where the arguments emphasize the dependence of the optimal solution on the Lagrange multipliers and the remaining capacity on the resource. We define h ,S,t in a similar manner for (11). Also, let X i,t denote the random variable which represents the remaining capacity on resource i at time period t when we offer sets according to the optimal solution to problem (10). We have the following result.

2.
̂, We note that besides showing that V 1 (r) is a convex function of , Proposition 1 also gives an explicit expression for its subgradient. This allows us to use subgradient search to find the optimal set of Lagrange multipliers. Proposition 2 below shows that by doing this, we in fact obtain the piecewise-linear bound.

Proposition 2
We defer the proof of Proposition 2 to the next section. Here we note some of its implications. Proposition 2 together with the results in Meissner and Strauss [16] implies that V LRo ≤ V CDLP and V LRo ≤ V AF . Therefore, LRo obtains an upper bound that is tighter than both CDLP and AF. It is also quite surprising that the LRo bound is as tight as PL since the complexity ( the number of constraints in the linear programming formulation) of LRo is linear in the resource capacities ( For typical DC-NRM instances, the number of constraints in LRo can be orders of magnitude smaller than that of PL. Moreover, since LRo decomposes the network problem into a number of single resource problems that can be solved in parallel, it may also be more suitable for distributed computing techniques. In closing this section, we note that while Lagrangian relaxation ideas have been applied to NRM previously, there are some important differences between our approach and previous proposals. Under the independent-class assumption, Topaloglu [24] proposes relaxing the constraints that the same acceptance decisions be made for each product across the resources that it uses. The resulting Lagrangian relaxation associates a multiplier i,j,t for each product j and each resource i ∈  i . Kunnumkal and Talluri [13] show that the Lagrangian relaxation with product-specific multipliers (LRp) turns out be equivalent to PL in the independent-class setting. We give an example in the Appendix which illustrates that the same result fails to hold for DC-NRM. That is, for DC-NRM, LRp can be weaker than PL (and by Proposition 2, weaker than LRo as well). We also note that while LRp has a smaller number of multipliers than LRo, solving the resource level problem (27) in LRp is still intractable for a general discrete-choice model. Consequently, it is not clear whether LRp provides any significant computational benefits over LRo.
The optimality equation (11) is not redundant for DC-NRM as we show in an example in the Appendix which illustrates that the optimal multipliers in LRo can be such that ∑ i∈ S i,S,t < ∑ j∈S P j (S)f j . This is in contrast to the perfect segmentation case where it is known that the optimal Lagrange multipliers can be interpreted as the pro-rated fare of a product on each resource that it uses, and consequently v ,t = 0 for all t.

Tightness of the Lagrangian bound
In this section we formally show that the upper bound obtained by LRo is as strong as the PL bound. We begin with some preliminary results in Sect. 5.1 before proceeding to the proof of Proposition 2 in Sect. 5.2.

Preliminaries
We note that optimality equation (10) can be equivalently written as ≤ r i denotes the set of products that can be offered considering the available capacity on resource i. On the other hand, letting R(S) = ∑ j∈S P j (S)f j denote the expected revenue from offering set S and ,S,t = R(S) − ∑ i∈ S i,S,t , we can write optimality equation (11) equivalently as then we can write V LRo = min ∈Λ V 1 (r 1 ) . The above minimization problem can be represented as the linear program Linear program LRo turns out to be useful when we make the connection between the LRo and PL bounds.

Proof of Proposition 2
We give a formal proof of Proposition 2. Lemma 1 implies that V PL ≤ min ∈Λ V 1 (r 1 ) = V LRo . So it only remains to show the more difficult part: Note that i,t+1 (⋅) can be interpreted as the marginal value of capacity, while Δ i,t (⋅) can be interpreted as the marginal value of time. The proof proceeds by considering the PL is less than or equal to zero. If yes, constraint (4) is satisfied at time period t for all r and S ⊂ (r) . Otherwise, we find a violated constraint and add it to the linear program.
Equation (16) can be written as Next, consider the optimization problem Π t (v) can be interpreted as a Lagrangian relaxation of Φ t (v) which is obtained by relaxing the requirement that the same offer set decision be made for all the resources. This can be shown formally by following the same steps that lead to optimality equations (10) and (11), and we omit the details. Here we only note that equations (10) and (11) are equivalent to equations (13) and (14), respectively. Furthermore, note the similarity between the terms on the right hand side of the equation defining Π t (v) and the right hand sides of optimality equations (13) and (14).
We show below that Φ t (v) = Π t (v) and use this result to show that V PL ≥ V LRo . We begin with some preliminary results. Lemma 2 shows that Π t (v) is an upper bound on Φ t (v) . This is intuitive if we interpret Π t (v) as being a relaxation of Φ t (v) . We defer the formal proof to the Appendix.
It remains to show that Φ t (v) ≥ Π t (v) . At a high level, this is because the optimal Lagrange multipliers are able to coordinate the offer set decisions across the different resources. As a result, we are able to construct an offer set that is feasible to the maximization problem on the right hand side of (17) from the optimal solution to Π t (v) . The following lemma shows that we can restrict ourselves to sets in  i = {S | i ∈  S } when solving the optimization problem for resource i.
and w ,t = max S⊂ { ,S,t } , then Lemma 3 implies that we can write Π t (v) as the linear program In the following, we analyze the structure of a particular optimal solution to LP Π t (v) that allows us to construct a feasible solution to Φ t (v) , which in turn shows that Φ t (v) ≥ Π t (v) . We introduce some notation that will be useful for this purpose. (19) for resource i, offer set S ∈  i and r ∈ {1, … , r 1 i } . Let denote the set of capacity levels for which constraint (19) is binding for resource i and offer set S. We use the arguments ( , w) emphasize the dependence of the set of binding constraints on the given solution. Observe that if B i,S ( , w) is empty, then From now on, we use a concept of optimal solutions with minimal set of binding constraints. The linear program (LP Π t (v) ) has a finite optimal solution and possibly multiple ones. Naturally, any optimal solution has a set of binding constraints out of (18)- (22). Given any optimal solution, we can look for another optimal solution whose set of binding constraints is a strict subset of those of the previous optimal solution. If there is no such optimal solution, we consider that as having a minimal set of binding constraints. Lemmas 4-6 together imply that an optimal solution with a minimal set of binding constraints coordinates the offer set decision across the different resources. Letting (̂,ŵ) be an optimal solution to LP Π t (v) with a minimal number of binding constraints.

Lemma 4 Fix a set S. Either
Proof Suppose that the statement of the lemma is false. First consider the case where B i,S (̂,ŵ) is nonempty but B l,S (̂,ŵ) is empty for i, l ∈  S . Let = min r∈{1,…,r 1 l } { l,S,t (r)} > 0 . Let (̃ ,w) be given by � =̂− e i,S,t + e l,S,t and � w =ŵ for some ∈ (0, ) , where e i,j,k is a vector with a 1 in component (i, j, k) and zeroes everywhere else. Note that (̃ ,w) is identical to (̂,ŵ) except that � i,S,t =̂i ,S,t − and � l,S,t =̂l ,S,t + . We show that (̃ ,w) is an optimal solution with a strictly fewer number of binding constraints which gives us a contradiction.
Notice that we only need to check constraint (19) for resources i and l and offer set S as all other resources and offer sets continue to have the same 's and w's as before.
We have which means that the number of binding constraints (19) for resource i and offer set S decreases by at least one. For resource l and offer set S, w l,t − [ � l,S,t − ∑ j∈ l P j (S) l,t+1 (r) + Δ l,t (r)] =ŵ l,t − [̂l ,S,t − ∑ j∈ l P j (S) l,t+1 (r) + Δ l,t (r)] − > 0 , for all r ∈ {1, … , r 1 l } , where the inequality follows from the definition of . Therefore, all constraints (19) continue to be nonbinding for resource l and offer Overall, (̃ ,w) has strictly fewer binding constraints than (̂,ŵ) , which gives a contradiction.
The above arguments imply that either B i,S (̂,ŵ) is nonempty for all i ∈  S or B i,S (̂,ŵ) is empty for all i ∈  S . Suppose the B i,S (̂,ŵ) is nonempty for all i ∈  S but ŵ ,t >̂, St . In this case, pick a resource i ∈  S and let � =̂− e i,S,t + e ,S,t and � w =ŵ , where ∈ (0, ) and =ŵ ,t −̂, S,t . It can be verified that the number of binding constraints (19) for resource i and offer set S strictly decreases from (̂,ŵ) to (̃ ,w) , while the number of binding constraints (20) remains unchanged, leading to a contradiction. This proves part (i) of the lemma.
On the other hand, if where ∈ (0, ) , and � w =ŵ . It can be verified that the number of binding constraints (19) for resource i and offer set S is exactly the same for (̂,ŵ) and (̃ ,w) , while the number of binding constraints (20) decreases by one ( � w ,t =ŵ ,t =̂, S,t > � ,S,t ). As a result, (̃ ,w) has strictly fewer binding constraints than (̂,ŵ) , which gives a contradiction. This proves part (ii) of the lemma. □

Let and
where the ̂ on the sets is to remind the reader of the dependence on (̂,ŵ) . Note that  i can be interpreted as the collection of offer sets for which constraint (19) is binding for resource i.  has a similar interpretation, but for constraint (20).
Lemma 5 Let (̂,ŵ) be an optimal solution to LP Π t (v) with a minimal number of binding constraints.
(i)  i is nonempty for all i ∈ + . (ii) If S ∈ i , then S ∈ (note that by definition the empty set does not consume any resources and so � ∉ i ).
Proof For part (i), for i ∈ + , ŵ i,t > Δ i,t (0) . Since (̂,ŵ) is optimal there exists S ∈  i and r ∈ 1, … , r 1 i such that ŵ i,t =̂i ,S,t − ∑ j∈S P j (S) i,t+1 (r) + Δ i,t (r) > Δ i,t (0) (otherwise, we can reduce ŵ i,t contradicting optimality). Therefore B i,S (̂,ŵ) is nonempty and so S ∈ i and  i is nonempty. For part (ii), S ∈ i implies that i ∈  S . So we have a set S with B i,S (̂,ŵ) nonempty. By Lemma 4, ŵ ,t =̂, S,t and so S ∈ . □ Lemma 6 shows that we can find an offer set for which constraint (19) is binding for all resources i. This turns out to be crucial for showing that Φ t (v) ≥ Π t (v).

Lemma 6 Let (̂,ŵ) be an optimal solution to LP Π t (v) with a minimal number of binding constraints. If  + is nonempty, then ∩ i∈ + i is nonempty.
Proof If | + | = 1 , then the statement holds trivially by part (i) of Lemma 5. Consider the case | + | > 1 . If ∩ i∈ + i is empty, then this implies the following: Fix a resource i ∈ + . Part (i) of Lemma 5 implies that  i is nonempty. Then for every S ∈ i there exists l ∈ + such that S ∉ l . Note that since l ∈ + , ŵ l,t > Δ l,t (0).
The other possibility is that Ŝ ∉  l . Let where we define the minimum over an empty set to be infinity (the second term could be empty). Let ∈ (0, ) and (̃ ,w) be given by � =̂− ∑ S∈ l e l,S,t + ∑ S∈ l e ,S,t and � w =ŵ − e l,t + e ,t . Therefore, we have � l,S,t =̂l ,S,t − , � ,S,t =̂, S,t + for all S ∈ l . Similarly, � w l,t =ŵ l,t − and � w ,t =ŵ ,t + . All other terms remain the same.
We check that (̃ ,w) is feasible and look at the set of binding constraints associated with this solution. We look at the constraints in LP Π t (v) one by one and compare the the number of binding constraints in (̂,ŵ) with the number in (̃ ,w).
Constraints (18): Note that we need to check constraints (18) and (19) only for resource l. For resource l, we have � w l,t =ŵ l,t − > Δ l,t (0) and so constraint (18) continues to be nonbinding.
Since w) is optimal and this gives a contradiction. □ We are now ready to show that Φ t (v) ≥ Π t (v).
Proof Let (̂,ŵ) be an optimal solution to LP Π t (v) with a minimal number of binding constraints. We consider two cases. Case 1: Suppose that  i is empty for all i. This means that for all S ∈  i , B i,S (̂,ŵ) is empty. It follows that ŵ i,t = Δ i,t (0) for all i (otherwise we can reduce ŵ i,t contradicting optimality). Part (ii) of Lemma 4 implies that ŵ ,t >̂, S,t for all S. It follows that ŵ ,t = 0 . Therefore, Π t (v) = ∑ i Δ i,t (0) . Note that r = 0 and S = � is feasible for Φ t (v) and the objective function value associated with this solution is . Case 2: Suppose that  i is nonempty for some i. We consider two subcases. Case 2.a  + is empty. We choose a resource l such that  l is nonempty and choose Ŝ ∈ l such that B l,Ŝ (̂,ŵ) is nonempty. By part (i) of Lemma 4, B i,Ŝ (̂,ŵ) is nonempty for all i ∈ ̂S and ŵ ,t =̂,̂S ,t . So, for all i ∈ ̂S , we have . Note that r i ≥ 1 for all i ∈ ̂S . On the other hand, since  + is empty. we have ŵ i,t = Δ i,t (0) for all i. In particular, ŵ i,t = Δ i,t (0) for all i ∉  S . Putting everything together, where the last equality follows since (̂,ŵ) satisfies constraint (22) and The inequality follows from (17) by noting that Ŝ and r , where r i =r i for i ∈ ̂S and r i = 0 otherwise, is feasible to Φ t (v) . To see this, observe that for all j ∈Ŝ , if 1 i∈ j = 1 , then i ∈ ̂S and so r i =r i ≥ 1 . Therefore, for all j ∈Ŝ , 1 i∈ j ≤ r i for all i and so Ŝ ⊂ (r).
need not be unique, we can pick any r ∈ B i,Ŝ (̂,ŵ) ). We have where the inequality follows from (17) by noting that Ŝ and r is feasible to Φ t (v) where r i =r i ≥ 1 for i ∈ ̂S and r i = 0 otherwise. □

Lemma 2 and Proposition 3 together imply that
We are now ready to show that V PL ≥ V LRo . Note that we can write PL as for all t with the same boundary condition, it follows that V PL ≥ V . Using the fact that Φ t (v) = Π t (v) together with the linear programming formulation

3
A strong Lagrangian relaxation for general discrete-choice… With the change of variables i,t (r i ) = v i,t (r i ) + ∑ s=t w i,s and ,t = ∑ s=t w ,s , we can write the above linear program as which is exactly LRo. Therefore, V PL ≥ V LRo . □

Segment-based Lagrangian relaxation
Although the number of constraints in LRo scales linearly with the resource capacities, it is still exponential in the number of products. In this section, we present a tractable approximation that applies to settings where the total demand is comprised of multiple customer segments with small consideration sets. We first describe the demand model and then present the tractable variant of LRo, which we refer to as segment-based Lagrangian relaxation (sLRo).

Demand model with multiple customer segments
We consider the case where the total demand is comprised of demand from multiple customer segments. Modeling demand in this manner can be a way to capture heterogenous customer preferences. Moreover, each customer segment is interested only in a small subset of the products (its consideration set). Small consideration sets are a reasonable modeling tradeoff in many situations that also finds support in the empirical and behavioral literature. We let  denote the set of customer segments. Customer segment g ∈  has a consideration set  g ⊂  of products that it considers for purchase. A segment g customer is indifferent to a product outside its consideration set, in the sense that the customer's choice probabilities are not affected by products offered outside its consideration set. We assume that the consideration sets of the different customer segments are known to the firm by a previous process of estimation and analysis. We also assume that the consideration sets of the different segments are small enough for its power set to be enumerable.
In each period, we have exactly one customer arrival and an arriving customer belongs to segment g with probability g . Since the total arrival rate is 1, we have ∑ g g = 1 . We let P g j (S) denote the probability that a segment g arrival purchases product j when S is the offer set. Since a segment g customer is indifferent to products outside its consideration set, we have P g j (S) = P g j (S ∩  g ) = P g j (S g ) , where S g = S ∩  g .

Tractable Lagrangian relaxation
We modify the Lagrangian relaxation approach for the case with multiple customer segments in the following manner: We introduce segment-based decision variables h g i,S g ,t , which denote the frequency with which set S g ⊂  g is offered to segment g on resource i at time period t. As in LRo, we relax the condition that the frequencies be identical across the resources by associating Lagrange multipliers g i,S g ,t with them and solve the optimality equation for resource i, with the boundary condition that i, +1 (⋅) = 0 , where  i = {g|∃j ∈  g with j ∈  i } can be interpreted as the set of customer segments that use resource i. We modify optimality equation (11) in a similar manner for the case with multiple segments: A strong Lagrangian relaxation for general discrete-choice… with the boundary condition that , +1 = 0.
We refer to the above described modification as the segment-based Lagrangian relaxation (sLRo). Many of the results from Sect. 4 carry over to sLRo. In particular, V t (r) = ∑ i i,t (r i ) + ,t gives us an upper bound on the value function. We find the tightest upper bound by solving V t (r) is a convex function of and an expression for its subgradient can be derived in a manner analogous to Proposition 1; we omit the details. Therefore, we can solve minimization problem (23) using subgradient search. However, sLRo can be weaker than LRo and we can have V LRo < V sLRo . Still, an advantage of sLRo is its computational tractability. Note that solving LRo requires (2 | | ) Lagrange multipliers which quickly becomes intractable. On the other hand, sLRo requires ( ∑ g 2 � g � ) Lagrange multipliers, a much more manageable number provided the consideration set for each segment is small in size. Moreover, when the consideration sets of the segments overlap, it is possible to further tighten sLRo by adding the product-cut equalities (PC-equalities) described in Meissner et al. [17] and Talluri [21]; we omit the details.

Computational experiments
In this section, we compare the upper bound and revenue performance of sLRo with benchmark solution methods. We consider two choice models in our numerical experiments. The first one is the MNL choice model and the second is the exponomial choice model. We begin by describing the two choice models and then describe the different benchmark solution methods and the experimental setup.

MNL choice model with multiple customer segments
The total demand is comprised of multiple customer segments and within each segment choice is according to the MNL model. The MNL model associates a preference weight g j with product j that is in the consideration set of segment g. Similarly it associates a preference weight g 0 with a segment g arrival not purchasing anything. The probability that a segment g arrival purchases product j when S is the offer set is (Ben-Akiva and Lerman [3]) while the probability it purchases none of the offered products is In our computational experiments, we have  g ∩  g � = � so that the consideration sets of the segments are disjoint.

Exponomial choice model with multiple customer segments
We again have that the total demand is comprised of multiple customer segments. Each segment has a preference weight (ideal utility) associated with purchasing a product that is in its consideration set and a preference weight associated with not purchasing anything. However, each segment's choice is governed by the exponomial choice model (Alptekinoğlu and Semple [2]). That is, if the preference weights are ordered so that where n g is the number of products in the consideration set of segment g that are part of the offer set, then the probability that a segment g arrival purchases product j when S is the offer set is (Alptekinoğlu and Semple [2]) In our computational experiments, we have  g ∩  g � = � so that the consideration sets of the segments are disjoint.

Choice Deterministic Linear Program (CDLP)
This is the solution method described in Sect. 3.1. If customer choice is according to the MNL model and the consideration sets are disjoint, then CDLP has an equivalent, compact sales based formulation that is described in Gallego et al. [8]. Therefor, we solve CDLP as a compact linear program. On the other hand, if customer choice is according to the exponomial model, to our knowledge there is no compact formulation of CDLP. Since CDLP has a large number of variables, we use column generation to solve CDLP. To our knowledge, there is no efficient method to solve the column generation sub-problem under the exponomial choice model and so we enumerate over the offer sets to solve the column generation sub-problem. The disjoint nature of the consideration sets makes the CDLP column generation sub-problem separable by the customer segments and this makes the enumeration procedure manageable. We stop the column generation procedure when we are within 1% of optimality. We obtain a bound on the optimality gap by using the optimal dual variables from the restricted master problem (see for example, Proposition 3 in Adelman [1]). Affine Approximation (AF) This is the solution method described in Sect. 3.2. We use the reduced formulation described in Vossen and Zhang [25] to solve AF. While the number of variables in the reduced formulation is manageable, it still has a large number of constraints. We solve AF by generating constraints on the fly and stop when we are within 1% of optimality (Adelman [1]). For the MNL choice model, the separation problem of AF can be solved as a mixed-integer linear program (Zhang and Adelman [26]). However, we are not aware of a similar formulation for the exponomial choice model. Solving the separation problem by brute force involves enumerating over all possible offer sets and resource levels and becomes intractable.
Segment-based Lagrangian Relaxation (sLRo) This is the solution method described in Sect. 6. In our computational experiments, we use subgradient search to solve problem (23). We use a step size of 250∕ √ k at iteration k of the subgradient algorithm and run the algorithm for 200 iterations. Although, our step size selection does not guarantee convergence (Bertsekas [4], Chapter 7), it provided good solutions and stable performance in our test problems.

Hub-and-spoke network
We have a network with a single hub serving N spokes. There is one flight from each spoke to the hub and one flight from the hub to each spoke, so that there are 2N flights in total. Figure 1 shows the structure of the network with N = 6 . Note that the flight legs correspond to the resources in our DC-NRM formulation.
The total number of fare-products is 2N (N + 1) . There are 4N fare-products connecting hub-to-spoke and spoke-to-hub origin-destination pairs. Of these, half are high fare-products whose revenues are drawn from the Poisson distribution with a mean of 30, while the remaining are low fare-products whose revenues are drawn from the Poisson distribution with a mean of 10. There are 2N(N − 1) fare products connecting spoke-to-spoke origin-destination pairs. Half of them are high fare-products whose revenues are drawn from the Poisson distribution with a mean of 300, while the remaining are low fare-products whose revenues are drawn from the Poisson distribution with a mean of 100.
Each origin-destination pair is associated with a customer segment and a segment is only interested in the fare-products connecting its origin-destination pair. For the MNL choice model, the preference weights of the high fare-products are drawn from the Poisson distribution with a mean of 200, while that of the low fare-products are drawn from the Poisson distribution with a mean of 80. The no-purchase preference weights are drawn from the Poisson distribution with a mean of 10. We remark that we set the problem parameters in the same manner as Meissner and Strauss [16]. For the exponomial choice model, the preference weight (ideal utility) of each product is drawn uniformly from the interval [−4, 18] , while the preference weight for the no-purchase option is set to 1. We follow Alptekinoğlu and Semple [2] in setting the parameters of the exponomial choice model.
We measure the tightness of the leg capacities using the nominal load factor. Letting be the offer set that maximizes expected revenues from segment g when there is ample capacity on all the flight legs, the nominal load factor is We have = 400 time periods in all of our test problems. We label our test problems by the pair (N, ) where N ∈ {10, 12, 14} and ∈ {1.0, 1.2} , which gives us a total of six test problems for each choice model. We first describe the results for the test problems where choice is according to the MNL model. Table 1 gives the upper bounds obtained by the different solution methods along with their run times. The first column in the table describes the problem characteristics by using (N, ) . The second to fourth columns, respectively, give the upper bounds obtained by CDLP, AF and sLRo. The next two columns, respectively, give the percentage gap between the upper bounds obtained by CDLP and AF with respect to sLRo. The last three columns give the CPU seconds required by CDLP, AF and sLRo, respectively. All of our computational experiments are carried out on a Core i7 desktop with 3.4-Ghz CPU and 16-GB RAM. We use CPLEX 12.2 to solve the CDLP and AF linear programs. We implement the subgradient search algorithm to solve sLRo in C++. We see that sLRo obtains significantly tighter upper bounds than CDLP and AF. The average gap between the upper bounds obtained by CDLP and sLRo is around 4%, while that between AF and sLRo is around 3%. In terms of computation time, CDLP has a compact linear programming representation for the MNL model and so it solves in a fraction of a second. The running times of AF and sLRo are in minutes. However sLRo solves much faster than AF and the differences in run times are more noticeable as the size of the network, as measured by the number of spokes, increases.
We next compare the revenue performance of the three solution methods. We evaluate revenues through simulation and use common random numbers in our simulations. All three solution methods obtain value function approximations of the where ̂ is an optimal solution to problem (23). For each solution method, we use the corresponding value function approximation Ṽ t (r) , and if r t is the vector of remaining resource capacities at time period t, we use the policy of offering the set that attains the maximum in the optimization problem We refresh the respective value function approximations periodically by reoptimizing the solution methods at five equally spaced intervals over the booking horizon. Table 2 reports the expected revenues obtained by the three solution methods. The columns have a similar interpretation as in Table 1, except that they give revenues. In the last two columns, we use ✓ to indicate that sLRo generates higher revenues than the corresponding benchmark method at the 95% level and ⊙ if the revenue differences are not statistically significant at the 95% level. sLRo on average generates revenues that are about 2% higher than CDLP and about 1% higher than AF. Now we describe the results for the test problems where choice is according to the exponomial model. Table 3 gives the upper bounds obtained by CDLP and sLRo along with their run times. As mentioned, solving the AF separation problem becomes intractable for the exponomial choice model and so we do not have AF as a benchmark solution method in the table. We see that sLRo continues to obtain significantly tighter upper bounds than CDLP and the sLRo bound is on average about 5% tighter than the CDLP bound. sLRo is agnostic to the form of the choice model and its solution time does not change very much compared to the MNL case. However, for the exponomial choice model, CDLP has to be solved using column generation and consequently the solution times are larger compared to the MNL case. Still, CDLP solves in under a minute even for the exponomial choice model. Table 4 gives the expected revenues obtained by CDLP and sLRo. The results are similar to the MNL case and we see that sLRo obtains significantly higher revenues than CDLP, with an average revenue improvement of around 6%.

Conclusions
In this paper we develop a new Lagrangian relaxation approach for DC-NRM with strong theoretical properties and numerical performance. We show that the Lagrangian relaxation equals the piecewise-linear approximation with the number of constraints scaling linearly with the resource capacities, compared to the exponential number when solving the piecewise-linear approximation directly. We build on these ideas and proposed a segment-based relaxation that is tractable when the consideration sets of the different customer segments are small. Our numerical experiments show that the proposed approach can provide significant benefits, both in terms of tighter upper bounds and higher expected revenues. Finally, we note that our results apply at the highest level of generality, for any discrete-choice model of customer demand behavior. An interesting future research direction is to see if more tractable methods can be obtained by specializing to specific choice models such as MNL or nested logit.

Proof of Proposition 1
We show the results by induction over the time periods. We begin with the first part of the proposition. It is easy to show the result for the last time period. So we assume that the result holds for time period t + 1 and show that it holds for time period t. We have where the first inequality holds since {h i,S,t (r i )|∀S ∈  i } is a feasible solution to problem (10) when the Lagrange multipliers are ̂ . The second inequality holds by the induction assumption, and uses the facts that ∑ On the other hand, the last equality follows by noting that This concludes the proof of the first part of the proposition. The proof of the second part proceeds in a similar fashion. We assume that the result holds for time period t + 1 and show that it holds for time period t. We have where the first inequality holds because {h ,S,t |∀S} is feasible for problem (14) when the Lagrange multipliers are ̂ and the second inequality follows from the induction assumption. □

Proof of Lemma 2
Proof The proof is similar to that of Lemma 1. Let r * , S * be an optimal solution to Φ t (v) . Since S * ⊂ (r * ) ⊂  i (r * i ) , we have Therefore, for any ∈ Λ , we have

Proof of Lemma 3
Proof Note that if S ⊂ Q i (0) , then j ∉  i for all j ∈ S and we have S ∉  i . Therefore, Putting everything together where the last equality follows from Δ i,t (⋅) being a decreasing function. We note that Δ i,t (r i ) ≤ Δ i,t (r i − 1) is equivalent to v i,t (r i ) − v i,t (r i − 1) ≥ v i,t+1 (r i ) − v i,t+1 (r i − 1) , and the latter inequality follows Kunnumkal and Talluri [12] (Lemma 1). Therefore . Note that we do not make an assumption that v i,t (0) = 0 for any t, and consequently cannot immediately assume Δ i,t (0) = 0 ≥ Δ i,t (r i ) . □

Lagrangian relaxation using product-specific multipliers
We first describe the Lagrangian relaxation approach using product-specific multipliers (LRp) and then give an example which illustrates it can be weaker than PL for DC-NRM. Under the independent-class assumption, Topaloglu [24] proposes relaxing the constraints that the same acceptance decisions be made for each product across the resources that it uses by associating Lagrange multipliers with them. The relaxation associates a multiplier i,j,t for each product j and i ∈  j , and can be interpreted as the portion of the revenue of product j that is allocated to resource i. The Lagrangian relaxation approach of Topaloglu [24] can be easily extended to DC-NRM. We solve the optimality equation for resource i, where  i (r i ) = j | 1 [j∈i] ≤ r i . It is possible to show that ∑ i i,t (r i ) is an upper bound on V t (r) (Kunnumkal and Topaloglu [14]). So, we can find the tightest upper bound on the optimal expected revenue by solving where the constraint ∑ i∈ j i,j,t = f j ensures that the Lagrange multipliers correspond to a valid fare allocation. In contrast to the independent demands setting (where V PL = V LRp ), as the following example illustrates, we can have V PL < V LRp for DC-NRM.
Example 1 Consider a network revenue management problem with two products, two resources and a single time period in the booking horizon. The first product uses only the first resource, while the second product uses only the second resource, and we have a single unit of capacity on each resource. Note that in the airline context, this example corresponds to a parallel flights network. The revenues associated with the products are f 1 = 10 and f 2 = 1 . The choice probabilities are given in Table 5. In the Lagrangian relaxation, since we have Lagrange multipliers only for j ∈  i , we  have only two multipliers 1,1,1 and 2,2,1 . Moreover, the constraint ∑ i∈ j i,j,t = f j implies that 1,1,1 = f 1 and 2,2,1 = f 2 . Noting that there is only a single time period in the booking horizon and that  i (1) =  for i = 1, 2, and so that V LRp = 65∕11.

Optimal LRo multipliers
We give an example below which illustrates that ∑ i∈ j i,j,t = f j for all j fails to hold for LRo multipliers.
Example 2 Consider a network revenue management problem with two products, two resources and a single time period in the booking horizon. The first product  uses only the first resource, while the second product uses only the second resource, and we have a single unit of capacity on each resource. Note that in the airline context, this example corresponds to a parallel flights network. The revenues associated with the products are f 1 = 99 and f 2 = 101 . The choice probabilities are given in Table 6. Letting S 1 = {1}, S 2 = {2} and S 3 = {1, 2} , we have ∑ j∈S 1 P j (S 1 )f j = 50 , ∑ j∈S 2 P j (S 2 )f j = 51 and ∑ j∈S 3 P j (S 3 )f j = 100 ,  S 1 = {1},  S 2 = {2} and  S 3 = {1, 2} . If we impose the constraint ∑ i∈ S i,S,t = ∑ j∈S P j (S)f j on the Lagrange multipliers, then we have 1,S 1 ,1 = 50, 2,S 2 ,1 = 51 and 1,S 3 ,1 + 2,S 3 ,1 = 100 . We have 1,1 (1) = max{50, 1,S 3 ,1 } and 2,1 (1) = max{51, 2,S 3 ,1 } . It can be verified that where the last equality follows from Proposition 2. Therefore, the optimal LRo multipliers in the above example satisfy ∑ i∈ S i,S,t < ∑ j∈S P j (S)f j .