Mathematical Problems in Engineering

Volume 2015, Article ID 286083, 17 pages

http://dx.doi.org/10.1155/2015/286083

## The Natural Gas Cash-Out Problem: A Bilevel Optimal Control Approach

^{1}Departamento de Ingeniería Industrial y de Sistemas, Tecnológico de Monterrey (ITESM), Campus Monterrey, Avenida Eugenio Garza Sada 2501 Sur, 64849 Monterrey, NL, Mexico^{2}Department of Social Modeling, Central Economics and Mathematics Institute (CEMI), Russian Academy of Sciences (RAS), Nakhimovsky Prospekt 47, Moscow 117418, Russia^{3}Department of Electronics and Computing, Sumy State University, Rimsky-Korsakov Street 2, Sumy 40007, Ukraine^{4}Institut für Numerische Mathematik und Optimierung, Fakultät für Mathematik und Informatik, TU Bergakademie Freiberg, Prüferstrasse 9, 09596 Freiberg, Germany

Received 26 March 2015; Revised 10 June 2015; Accepted 18 June 2015

Academic Editor: Ching-Ter Chang

Copyright © 2015 Vyacheslav V. Kalashnikov et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The aim of this paper is threefold: first, it formulates the natural gas cash-out problem as a bilevel optimal control problem (BOCP); second, it provides interesting theoretical results about Pontryagin-type optimality conditions for a general BOCP where the upper level boasts a Mayer-type cost function and pure state constraints, while the lower level is a finite-dimensional mixed-integer programming problem with exactly one binary variable; and third, it applies these theoretical results in order to find possible local minimizers of the natural gas cash-out problem.

#### 1. Introduction

Bilevel programs are hierarchical optimization problems in the sense that their constraints are defined in part by a second parametric optimization problem. Hierarchical structures can be found in diverse scientific disciplines including environmental studies, classification theory, databases, network design, transportation, game theory, economics, and new applications, such as the gas cash-out problem. In its turn, this stimulates the development of both new theoretical results and efficient algorithms to solve bilevel programming problems.

A particular case of the bilevel programming problem is presented by the following optimal control problem arising in the natural gas industry. This problem has been formulated as a mixed-integer model [1–3] arising from the minimization of cash-out penalty costs of a natural gas shipping company. In this study, we formulate the gas cash-out problem as a* bilevel optimal control problem* (BOCP) where the upper level is equipped with a Mayer-type cost function and pure state constraints, whereas the lower level is formulated as a finite-dimensional mixed-integer programming problem (MIP) with only one binary variable.

One of the main goals of this paper is to provide a maximum principle for this problem and to present a detailed discussion. The rest of the paper is organized as follows. Section 2 specifies the model and describes the system’s behavior. Section 3 is the core of our whole approach: it contains the general formulation of the cash-out model, lists the assumptions we accept, reformulates the model as a single-level problem, provides Pontryagin-type optimality conditions, and illustrates the theory by means of a small example. Section 4 presents the results of application of the optimality conditions to the cash-out problem. Finally, Section 5 presents conclusions and possible items of the future research.

#### 2. The Natural Gas Cash-Out Problem

Let us consider a system consisting of a single natural gas shipping company (NGSC) engaged in business with a Pipeline Operating Company (POC). The NGSC intends to transport the natural gas it buys from the wells to several consumption points (pool zones). The operative process is defined within a certain time frame , for example, a month. In every , the NGSC buys gas at the wells, injects it into the pipeline at its string point, and extracts the amount of gas to sell it at the pool zones down the pipeline. The NGSC is required to book capacity in every pool zone before the operative period starts, so that the nominal extraction amounts are known by the POC beforehand, so that the pipeline’s operations could be planned. However, the NGSC is allowed, within certain limits, to extract a different amount of fuel more than planned/booked originally, thus creating certain* imbalances*. An imbalance is formally defined as the difference between the booked capacity and the extracted amount. The gas extracted at every pool zone is then sold during each period of time, , to the Local Distribution Companies (LDCs) to fulfill prearranged contracts, with any unsold amounts marketed at different prices to external LDCs with no binding contracts to the NGSC.

To prevent the NGSC from generating large unjustified imbalances, the POC will limit the levels of imbalances, positive or negative, on each period of time in every pool zone, as well as the possible change, or “swing” of those imbalances from to . At the end of the operative period, , the POC will analyse the existing imbalances in its pipeline and redistribute them among the pool zones moving gas from zones with positive imbalances to zones with negative (and only negative!) imbalances, until only nonnegative or nonpositive imbalances exist at all pool zones (the same sign of the imbalances as the result of balancing procedure is also required). At this point, a cash-out will be arranged between the parties, with the pipeline charging high costs for the taken extra gas and paying low prices for the bought gas so that arbitrage on part of the NGSC be discouraged.

The natural gas cash-out problem has been modeled as an* optimistic bilevel optimization problem* in finite-dimensional spaces (*cf.* [1–3]). In these formulations the upper level corresponds to the decision of a single NGSC regarding its capacity booking, extraction levels, and imbalances whereas the lower level deals with the decision of the POC to come up with a balancing scheme that would please both parties. This optimization modeling is intended to be a tool for NGSCs to better manage the created imbalances in their continuous-time business. Therefore, we will interchangeably refer to the NGSC’s (POC’s) problem as the upper level (lower level) problem. Previous studies were focused on numerical solutions; however, in this work we formulate the problem as a BOCP where the aim of the paper is to provide optimality conditions for such formulation.

##### 2.1. Problem Statement

Following the studies of Dempe et al. [1] and Kalashnikov and Ríos-Mercado [3], the decision making process for the NGSC is to determine how to carry out its daily imbalances such that the penalty that will be imposed by the POC is minimized. The following notation is used to describe the model.

*Indices and Sets* are zone pool indices; . is time index; .

*Parameters* are lower and upper bounds on imbalances at time in zone . are lower and upper bounds for the sum of imbalances at time . are lower and upper bounds on balance swings at time in zone . is percentage of fuel retained for moving one unit of gas from zone to zone ; , . is transportation change for moving one unit of gas from zone to zone ; , . is backward haul credit for moving one unit of gas from zone to zone ; , . is imbalance penalization parameter, . is initial imbalance at in zone ; .

*Controls and States (Upper Level)* is imbalance swing at time in zone ; . is imbalance at time in zone ; .

*Decision Variables (Lower Level)* is total cash-out cost for the NGSC. is final imbalance at zone ; . is forward haul volume moved from zone to zone ; , . is backward haul volume moved from zone to zone ; , . is auxiliary variable for linearization.

*Auxiliary Variables* is binary variable equal to 1 if final imbalances are nonnegative (nonpositive). In the special case when all the imbalances are zeros, we accept .Let us postulate a quite natural assumption that and the are measurable functions which satisfy , , , , and for any . Furthermore, we introduceThe NGSC’s problem is given byThe objective function of the NGSC (2a) is to minimize the total cash-out cost, given the control system (2b) and some initial conditions (2f). Constraints (2c)–(2e) reflect the bounds on the imbalances and imbalance swings. Note that constraints (2d)-(2e) involve only state variables. Moreover, the objective function variable depends on the POC’s response to this upper level model; this is not a leader’s decision variable* per se*. In the latter problem the NGSC’s objective function is minimized with respect to , , , and ; thus this formulation is adopting the* optimistic approach* where the upper level decision maker is able to influence the POC so that the latter select his/her reaction in the leader’s favor. Finally, is the solution set of the POC’s problem for fixed . Hence, considering the vector of the imbalances in all zones at the final time moment as given, the POC’s problem can be formulated as follows: where is a large enough scalar value, whose lower bound can be easily calculated, making use of duality theory, due to the compactness of the feasible set in states (*see*, e.g., [2]). Constraint (3e) arises from the business rule saying that when being rearranged by the POC, the imbalances cannot change their signs. Constraints (3b)–(3e) imply that the pipeline can haul forward or backward an amount of gas from one zone to another that does not exceed (i) the positive imbalance in the source zone and (ii) the absolute value of the negative imbalance one has in the target pool zone. Constraint (3f) explains the relationship between the last moment imbalances , the final imbalances , and the forward/backward haul variables , . Constraints (3g)-(3h) define the cash-out variable and show how the objective function variable is related to via linear inequalities (the latter linear inequalities help reduce the nonlinear original lower level objective function to a linear one). Restriction (3i) reflects the requirement that all the final imbalances must be of the same sign, and it is exactly where the binary variable appears.

In [2], the mixed-integer nonlinear program (3a)–(3k) was reduced to an “almost” linear formulation. Indeed, only the presence of the binary variable prevents the modified problem from being a linear program. Hence, for a given vector , we have the equivalent mixed-integer programming problem:where is a large enough scalar value, and from (4a), (4g)–(4i) we have and . Note that (4a)–(4j) is a linear programming problem involving a single binary variable. Moreover, (4a)–(4j) is a linear program for each value of , and it was shown in [1] (for ) that this problem is solvable for at least one of the two possible values of or . Then duality theory guarantees that there exists a finite penalty value of such that constraints (4g) and (4h) are active at any optimal solution of the program in question. From now on, without loss of generality, we will use in order to denote the solution set of (4a)–(4j) for a fixed parameter . Based upon that, we replace the last constraint (2g) with the inclusion , where

Due to the fact that the lower level problem is purely linear, it seems to be convenient to represent it in a matrix form. Therefore, we introduce some extra notation for vectors and matrices. Namely, by we denote the identity matrix of dimension ; denotes the zero matrix of dimension ; and the zero-vector of dimension is denoted by . Let be the th unity vector of dimension and the all-ones vector of dimension . We introduce the natural number and use in order to define (for any ) a matrix in whose main diagonal is given by , while all its other entries are zero. For two vectors , the product will be understood as the componentwise product; that is, , .

Next, we define the lower level variable component vector and some auxiliary vectors:

Let us introduce the matrices and as follows:and use the latter ones to compose the overall system’s matrices. In order to do that, we define , , , , , , and as follows:Hence, we can rewrite (4a)–(4j) as

#### 3. General Setting and Optimality Conditions

This section deals with the theoretical results providing optimality conditions for the bilevel program in general, with an aim to apply them to our gas cash-out problem in Section 4.

##### 3.1. Preliminaries and Further Notation

Throughout this paper, we denote by , , , , and the set of real numbers, the space of all real vectors with components, the space of all real matrices with rows and columns, the nonnegative orthant of , and the extended real line, respectively. For any matrix , let denote its transpose. Next, for an arbitrary subset , we use , , and in order to denote the interior, the relative interior, and the convex hull of , respectively. For , we define the* Fréchet normal cone * to at by means of Here, is an arbitrary norm in . Furthermore, the* basic normal cone* (sometimes referred to as* Mordukhovich* normal cone) to at is given bywhere the upper limit has to be interpreted in the sense of Painlevé-Kuratowski (*cf.* [4]). If is a convex set, then and both coincide with the normal cone of convex analysis, which we denote by . Let us denote by and the open and closed unit balls in , and, for any , we define and , respectively. Given a differentiable function , its Jacobian at is represented by . Next, we denote by and the space of scalar continuous functions defined over the interval and the dual space of , respectively. The set of elements in taking nonnegative values at nonnegative functions in is denoted by . Given a nonnegative measure , its norm coincides with the total variation of defined as and the support of the measure ; written is the smallest closed set such that for any relatively open subset one has . The Euclidean norm of a vector is denoted by , the space of all Lebesgue-integrable functions such that is described by , and by we represent the Sobolev space that contains all absolutely continuous -valued functions on , whose weak derivatives belong to . By we denote the Banach space of all vector-functions with essentially bounded components defined over . Furthermore, by we express the product -algebra generated by the Lebesgue set and the Borel subsets of .

For a lower semicontinuous functional , we introduce its domain as . Suppose that is fixed. Then we define the* Fréchet subdifferential * of at asFurthermore, we make use of the* singular subdifferential * of at , which is defined as stated below:Note that holds if and only if is locally Lipschitz continuous at (*cf.* [5]). In the latter case , the Clarke subdifferential of at is a nonempty, compact, and convex set (*cf.* [6]) and consequently we have . Suppose that is a convex functional and is chosen arbitrarily. Then and both coincide with the classical subdifferential of at , the latter being denoted by . For further information on these concepts of variational analysis, we refer the interested reader to [7].

Let be an arbitrary set-valued mapping. The domain and graph of are denoted, respectively, by and . We say that is a* polyhedral* mapping provided that its graph is the union of a finite collection of polyhedra. The mapping is called* locally Lipschitz continuous* at whenever there exist scalars such that for all the following condition is satisfied:If the above inclusion holds only when is fixed, then is called* locally upper Lipschitz continuous* at . We call * upper* (*lower*)* semicontinuous* at provided that for any open set satisfying () we find such that () holds true for all . Now choose an arbitrary point . We say that is* inner semicontinuous* at if for any sequence converging to we find a sequence converging to and such that is true for all greater than . Obviously, if is locally Lipschitz continuous at , then it is inner semicontinuous at any point with . The* normal coderivative * of at is defined as stated below for any :

Finally, we recall some helpful calculation rules concerning the Minkowski sum of sets. Due to its simplicity the corresponding proof is omitted here.

Lemma 1. *Let be arbitrary sets. Then the following statements hold:*(i)*;*(ii)*.*

*3.2. General Setting*

*In order to derive optimality conditions for the natural gas cash-out problem (2a)–(2g) where the lower level problem (3a)–(3k) is replaced with (4a)–(4j), we are going to develop a general formulation. The idea is to derive general optimality conditions, and by applying those theoretical results one can easily provide optimality conditions to the original problem of interest.*

*Let us rewrite problem (2a)–(2g) as an optimistic BOCP such thatwhere*

*The problem’s data comprise an interval for a fixed final time moment , given initial conditions , functions , , , and a multivalued mapping that is measurable on . The feasible set of control functions is . The state trajectory is an absolutely continuous function that satisfies the differential equation and the initial conditions for some control function . Finally, denotes the solution set mapping of the lower level problem, while is a fixed vector and is a set-valued mapping that will be specified below.*

*In other words, problem (16) is an optimistic BOCP with final-state-dependent finite-dimensional lower level. Moreover, the upper level problem boasts a Mayer-type cost function and state constraints. This formulation is notably interesting due to the parametric optimization problem at the lower level, whose parameter is nothing else but the final state of the upper level state variable. Hence, the natural gas cash-out problem specified by (2a)–(2g) fits into the formulation of problem (16).*

*Taking into account the POC’s problem (4a)–(4j) one can define the set as follows:where , , , , , and are given matrices. When comparing the original problem (2a)–(2g) and the general formulation in (16), it is not difficult to see that we have , , , , and .*

*Let us consider the space . Then the process is said to be feasible for (16) if it satisfies the dynamical system, the initial condition, and the pure state constraints, while is a global optimal solution for the corresponding lower level problem. Now we introduce the definition of a local minimizer.*

*Definition 2. *Take a feasible process . Then is a local minimizer of problem (16) if there exists such thatholds provided that , and is feasible for (16).

*Clearly, the optimality conditions for local minimizers automatically hold for strong and hence for global minimizers. By following the approach in Vinter [8], the above definition respects our desire to focus on the state variables of (16) while ignoring somehow the control function’s behavior. Additionally, fixing the binary variable proposes a strategy about how to deal with (16). We compute possible minimizers for the problems that arise when setting and and then compare the resulting points. Note that assuming to be free in the definition of local optimal solutions is another idea we are not going to examine here.*

*For an arbitrary local minimum point of (16), we accept the following assumptions:() (i)For a fixed , the function is continuously differentiable with respect to all their arguments.(ii)The function is -measurable for each .(iii)There exist a -measurable function and a constant such that is integrable and For , a.e. .(iv)The set is measurable.(v)The component functions of are continuously differentiable with respect to all their arguments. Furthermore, for any the set is positive linearly independent; therein, for any and we define() (i)If holds true for some , then there exist constants such that the set is convex for any and any .(ii)If holds true for some , then there exist constants and a control such that for almost every and the following conditions hold:*

*The assumptions stated in () are typical hypotheses in optimal control. Recall that, in assumption (-(v)), represents the set of active inequalities at . On the other hand, the assumptions in () are essential to ensure a nondegenerated maximum principle. The reader is referred to [9, 10] for a detailed discussion of these constraint qualifications.*

*It is not difficult to check that assumption () holds for the natural gas cash-out problem (2a)–(2g) at any feasible point. Finally, this general formulation allows us to deal with a smaller problem whose theoretical properties will be useful for further discussion on the gas cash-out problem. Our approach consists in reformulating problem (16) as a locally equivalent single-level problem. On the other hand, the presence of one binary variable at the lower level problem brings some additional difficulties. As mentioned earlier, we deal with that problem by considering the different cases and .*

*3.3. Single-Level Reformulation*

*In this subsection, we replace problem (16) by an equivalent single-level optimal control problem. One typical approach in bilevel programming in finite-dimensional spaces consists in substituting the follower’s problem by its Karush-Kuhn-Tucker conditions. They are necessary and sufficient for optimality as long as the program’s functions are continuously differentiable and convex with respect to for a fixed parameter, and some constraint qualification (such as Slater’s condition or Mangasarian-Fromovitz constraint qualification (MFCQ)) is satisfied. Hence, if the lower level problem is differentiable, convex, and a regularity condition holds, the resulting problem would be equivalent to the original one in the sense of global optimal solutions. However, from [11] it is well-known that the surrogate problem may have local optimal solutions that do not correspond to local optimal solutions of the original bilevel programming problem. Similar difficulties may appear when using this approach to tackle problem (16).*

*In line with the above arguments, this study uses the lower level optimal value function, which allows us to derive a problem completely equivalent to (16). The resulting modified problem usually lacks differentiability and regularity [12]. Because of that, the optimal value approach has been discussed in many publications concerning bilevel programming both in the finite- and in infinite-dimensional case; compare, for instance, [13, 14]. The latter papers develop efficient realizations of the (lower level) optimal value method in optimistic bilevel programming by making use of formulas for the limiting/basic and singular subdifferential derived by Mordukhovich for the marginal/value functions ( see Mordukhovich’s book [7]).*

*In application to our case of the BOCP with the lower level represented by a conventional problem of parametric programming, the advanced techniques proposed in [13, 14] could be employed in order to find constructive (explicit) conditions to guarantee the required local Lipschitz continuity of the (lower level) objective function’s optimal value, that is, of the functions and , , by means of vanishing their singular subdifferentials. Moreover, necessary optimality conditions for our bilevel optimal control program could be developed through the basic subdifferential of the optimal value functions. However, these prospective targets will be postponed for our future research, since, in this paper, we make use of the concept of partial calmness introduced in [15].*

*Namely, we define the lower level optimal value function by means of for any and deducefrom the definition of . Hence, we can use the latter function to replace (16) by the following equivalent single-level optimal control problem:*

*There are three issues that need to be especially addressed when using this approach. First, it is well-known that, in general, the value function may not be differentiable. Secondly, common constraint qualifications such as MFCQ, the linear independence constraint qualification, or at least their nonsmooth counterparts are too strong to hold at the boundary conditions of (25). Finally, the binary variable could cause some problems in applying a proper constraint qualification. Hence, we have to expect that a nonsmooth maximum principle via (25) is likely to be degenerated (in certain sense).*

*In order to cope with the above-mentioned obstacles, we follow the ideas of Ye and Zhu [15] where the authors use a partial penalization to reach a proper constraint qualification. This partial penalization is often called partial calmness condition, which is frequently used for the optimal value reformulation of an optimistic bilevel programming problem (i.e., problem (25) in our case). This constraint qualification turns out to be closely related to the calmness of a nonlinear optimization problem at a certain point (cf. [6] for the definition). Calmness for multifunctions (for perturbations of the lower level solution set) might be considered as well. Therefore, one could introduce a multifunction such that we getfor any point and any . Observe that is empty for any while is valid. Results from Henrion and Surowiec [16] suggest that the calmness of at for an arbitrary feasible point of (16) (referred to as value function constraint qualification or VFCQ for short) is more restrictive than the partial calmness condition given in Definition 3. In [17], the authors generalize the aforementioned results from [16] to bilevel programs where the upper level is an optimal control problem. Note that Henrion and Surowiec criticize (cf. [16]) the fact that optimality conditions derived from partial calmness (or VFCQ) only contain first order information. However, this is justified enough since any subdifferential of the optimal value function is a tool of first-order analysis. They recommend representing the lower level problem by means of a generalized equation and consider the calmness of some corresponding perturbation mapping in order to obtain optimality conditions containing second-order information of the lower level as well. Observe that the lower level problem in this paper is purely linear; that is, it makes use of no second-order information and hence it makes little sense to exploit this idea here. That is why we deal with a modification of the original concept of partial calmness, and it will turn out later that our problem of interest (16) possesses this partial calmness property at any of its local optimal solutions. We want to mention here that in [18] the author already made use of partial calmness to derive necessary optimality conditions for general optimal control problems but omitted a detailed discussion on when this condition holds in optimal control (apart from the situation where minimax problems are considered).*

*In order to define the partial calmness condition for (16), we need to consider a partially perturbed version of problem (25) given below for some real number :*

*Note that the feasible set of (27) is empty for any . For the purpose of a space-saving notation we introduce the Banach space .*

*Definition 3. *Problem (25) is called partially calm at one of its local minimizers if there exist scalars and such that for any feasible point of (27) satisfying the condition the following inequality holds:

*Adapting a result from [9] it becomes clear that partial calmness can be characterized equivalently via partial penalization provided the optimal value function is locally Lipschitz continuous in a certain neighborhood of the reference point.*

*Proposition 4. Let be a local minimizer of (25) such that is locally Lipschitz continuous at . Then (25) is partially calm at if and only if there exists a scalar such that is a local minimizer of*

*In order to apply the above result, we have to find a criterion which ensures the postulated Lipschitz-property of . Hence, we start a deeper analysis of the lower level problem by decomposing the lower level problem with respect to . Let us introduce two additional set-valued mappings and functions , , such that, for all , we get *

*The following lemma summarizes our results on the continuity of , , and .*

*Lemma 5. For any , the following statements hold true: (i).(ii)The mapping is polyhedral, closed, and locally upper Lipschitz continuous, as well as upper semicontinuous at any . Furthermore, it is locally Lipschitz continuous and lower semicontinuous at any .*

*Proof. *(i) This relationship follows directly from the definitions of , , and .

(ii) From (i) we deduceSince and are polyhedra by the definition, is a polyhedral set; that is, is a polyhedral mapping. Hence, it is locally upper Lipschitz continuous at any point (*cf.* [19]). It follows from the definition of upper Lipschitz continuity that any mapping boasting this property is upper semicontinuous. The closedness of follows from its being polyhedral. Now fix . Hence, and are locally Lipschitz continuous at ; that is, we can find scalars such that for all one yieldsfor . Now we apply Lemma 1 twice. First, we note that for all for . Next, by defining and we derive for all the following inclusion:from statement (i) and Lemma 1. The above formula implies the local Lipschitz continuity of at . Finally, it follows from the definition of local Lipschitz continuity that is lower semicontinuous at as well. Thus, the proof is complete.

*Lemma 6. (i) For , the function is convex, piecewise affine, and locally Lipschitz continuous on its domain.(ii) The optimal value function can be represented by the formula for any point .(iii) The function is piecewise affine and lower semicontinuous on . If holds true, that is locally Lipschitz continuous at .(iv) For , the function is subdifferentiable in the classical sense (i.e., its subdifferential is nonempty) at any point , and the following formula holds:(v) For , the following criterion can be used to check whether . Suppose that and satisfy . If the setonly contains , then holds true.(vi) The function is Clarke subdifferentiable everywhere on its domain (i.e., its Clarke subdifferential is nonempty at the point ). Introducing the set of active indices of the optimal value function , the following formulas are correct: (a)If , then(b)If , then*

*Proof. *(i) This statement is well-known from linear parametric optimization (*cf.* [20]).

(ii) We deduce this representation directly from statement (i) of Lemma 5:(iii) We already know from statement (i) that and are piecewise affine and lower semicontinuous functions, being also locally Lipschitz continuous on the interior of their domains. Due to the fact that is the pointwise minimum of these two functions (*cf.* statement (ii) of this lemma), it is piecewise affine as well.

Now, from assertion (ii) of Lemma 5 we know that is upper semicontinuous, which yields that is a lower semicontinuous function (*cf.* [20]). On the other hand, at any point the functions and are locally Lipschitz continuous, so the same holds true for .

(iv) One may apply the results from [21] for fully convex parametric optimization problems to the given linear optimization problems using the duality of linear programming. Note that the classical subdifferential* is not bounded* at the boundary points of the domain of the optimal value function.

(v) For any fixed , the parametric optimization problemis completely linear and hence its solution set mapping is inner semicontinuous, while the singular subdifferential of its objective function reduces to (*cf.* [22]). Note that is a solution of (40). We apply Theorem 7 [5] to deriveIn order to evaluate the above coderivative, we have to compute the basic normal coneObserve that is a polyhedron; that is, it is closed and convex. Hence, this cone coincides with the corresponding (classical) normal cone defined assince at least Abadie Constraint Qualification holds at any feasible point of a purely linear optimization problem. It follows from (41) and the definition of the normal coderivative that the inclusionis true; that is, the criterion from statement (v) implies . Consequently, is Lipschitz continuous in a neighborhood of , which is only possible if .

(vi) These formulas follow from the calculation rules of the Clarke subdifferential stated in [6].

*Note that the criterion from statement (v) of the above lemma always holds if, for a fixed , the linear problem (40) is solvable, while possesses an interior point. In order to make this clear, recall that, in the latter case, the Slater condition holds true for problem (40) and the set of singular Lagrange multipliers*