On solving dynamic oligopolistic market equilibrium problems in presence of excesses
|
|
- Trevor Gardner
- 7 years ago
- Views:
Transcription
1 Communications in Applied and Industrial Mathematics, ISSN , e-415 DOI: /journal.caim.415 On solving dynamic oligopolistic market equilibrium problems in presence of excesses Annamaria Barbagallo 1 and Paolo Mauro 2 1 Department of Mathematics and Applications R. Caccioppoli, University of Naples Federico II, via Cintia Naples, Italy annamaria.barbagallo@unina.it 2 Department of Mathematics and Computer Science University of Catania viale Andrea Doria n Catania, Italy mauro@dmi.unict.it Communicated by Nicola Bellomo Abstract This paper deals with the dynamic oligopolistic market equilibrium problem in presence of excesses. In particular, besides presenting the problem in which only the production excess is considered, the demand excess is also discussed. In both cases, the variational formulation of the equilibrium conditions is given. Taking into account the continuity property of equilibrium solutions, it is possible to introduce a discretization procedure in order to present a computational method for the dynamic oligopolistic market equilibrium problems in presence of excesses. Moreover, a convergence result is proved. Finally, the performance of our algorithm is shown on some examples. Keywords: Dynamic oligopolistic market equilibrium problem, production excess, demand excess, evolutionary variational inequality, discretization procedure. AMS Subject Classification: 49J40, 58E35, 65K10, 91A10 1. Introduction. The main purpose of this paper is to provide a computational method for solving oligopolistic market equilibrium problems in presence of excesses. In the literature, these problems are modelled as evolutionary variational inequalities as well as it happens for the most important time-dependent equilibrium problems [1 8]. Moreover, many problems arising from the theory of population dynamics and other physics phenomena are studied not only by means of partial differential equations (for further details see Received Accepted Published Licensed under the Creative Commons Attribution Noncommercial No Derivatives
2 A. Barbagallo et al e.g. [9 16]), but also by means of evolutionary variational inequalities (see for instance [17,18]). It is worth to perform a little history of the problem in question. The oligopoly problem, namely the problem regarding the equilibrium between a finite number of firms producing homogenous commodities in a noncooperative manner, has its origin in Cournot who first studied this problem in [19]. Cournot investigated competition between only two producers while Nash, one century later, generalized the problem to n agents, each acting in his own self-interest, which has come to be called a noncooperative game (see [20,21]). The time-dependent formulation of the oligopolistic market equilibrium problem has been presented, for the first time, in [22]. Since the time-dependent formulation of equilibrium problems allows one to explore the dynamics of adjustment processes in which a delay on time response is operating, as M.J. Beckmann and J.P. Wallace pointed out in [23], it is fundamental to study of the dynamic behaviour of the model. Moreover, an other important aspect is that the delay on time response always happens because the processes have not an infinite speed. Usually, such adjustment processes can be represented by means of a memory term which depends on previous equilibrium solutions according to the Volterra operator (see, for instance [24]). In the study of evolutionary variational inequalities the search of the Lagrange variables is of topical importance and, to this regard, we mention the paper [25] where the authors applied the infinite-dimensional duality results developed in [26] to overcome the difficulty of the voidness of the interior of the ordering cone which defines the constraints and so proved the existence of Lagrange variables which permit to describe the behaviour of the market. Moreover, in [25] some sensitivity results have been obtained each of them showing that small changes of the solution happen in correspondence with small changes of the profit function. In [27], an oligopolistic market equilibrium model with an explicit long-term memory has been considered. In [1] and in [2] the variational formulation of the oligopolistic market equilibrium problems in presence of production excesses and both production and demand excesses are introduced. The equilibrium conditions in terms of the well known dynamic Cournot-Nash principle are analyzed, and then the equilibrium conditions will be expressed also by using the Lagrange multipliers and the infinite-dimensional duality theory. The equivalence between the two conditions is proved because they are both expressed by an appropriate evolutionary variational inequality. Moreover, thanks to the variational formulation, some existence and regularity results for the equilibrium solutions are shown. In this paper we propose an algorithm for the computation of equilibria, by means of discretization methods. The continuity of the solution to 2
3 DOI: /journal.caim.415 dynamic oligopolistic market equilibrium problems in presence of excesses, proved in [1] and in [2], allows us to consider a partition of the time interval and hence to reduce the infinite-dimensional problem to some finitedimensional problems that can be solved by means of a known method. Since in literature some numerical schemes for the calculation of solutions to dynamic equilibrium problems are available (see for instance [22,28 32]), our results seem to have a particular relevance. More specifically, we propose a discretization procedure which reduces the infinite-dimensional problem to the calculus of solutions to finite-dimensional variational inequality. In particular, taking into account of the continuity, we discretize the time interval [0, T ] and then we can compute, by means of the extragradient method in Marcotte s version, the solution of the finite-dimensional oligopolistic market equilibrium problems obtained using the discretization. At last, we construct an approximation solution with linear interpolation. In order to obtain numerical results, we make use of a MatLab computation. Moreover, we present some numerical examples which show the efficiency of the algorithm. In fact, we compute the equilibrium solutions by using also the direct method (see [33 35]) and we obtain the same numerical results. At last, we compare the numerical equilibrium solutions for the problem in presence only of production excesses and the one in presence of both production and demand excesses. The paper is organized as follows: in Section 2 we recall the dynamic oligopolistic market equilibrium problem in presence of production excesses and then both production and demand excesses, then in Section 3 we describe an algorithm and we prove a convergence result, and finally in Section 4 we report the computational results. 2. Dynamic oligopolistic market equilibrium problem. Let us consider, in a period time [0, T ], T > 0, m firms P i, i = 1,..., m, that produce one only commodity and n demand markets Q j, j = 1,..., n, that are generally spatially separated. Let p i, i = 1,..., m, be the nonnegative commodity output produced by firm P i at the time t [0, T ]. Let q j, j = 1,..., n, be the nonnegative demand for the commodity at demand market Q j at the time t [0, T ]. Let x ij, i = 1,..., m, j = 1,..., n, be the nonnegative commodity shipment between the supply market P i and the demand market Q j at the time t [0, T ]. In the following, we set x i = (x i1,..., x in ), i = 1,..., m, t [0, T ]. Let us group the production output into a vector-function p : [0, T ] R m +, the demand output into a vector-function q : [0, T ] R n +, the com- 3
4 A. Barbagallo et al modity shipments into a matrix-function x : [0, T ] R mn +. We assume that the nonnegative commodity shipment belongs to L 2 ([0, T ], R mn + ). Furthermore, let us associate with each firm P i a production cost f i, i = 1,..., m, and assume that the production cost of a firm P i may depend upon the entire production pattern, namely, f i = f i (t, x). Similarly, let us associate with each demand market Q j, a demand price for unity of the commodity d j, j = 1,..., n, and assume that the demand price of a demand market Q j may depend, in general, upon the entire consumption pattern, namely, d j = d j (t, x). Moreover, let g i, i = 1,..., m, denote the storage cost of the commodity produced by the firm P i and assume that this cost may depend upon the entire production pattern, namely, g i = g i (t, x). Finally, let c ij, i = 1,..., m, j = 1,..., n, denote the transaction cost, which includes the transportation cost associated with trading the commodity between firm P i and demand market Q j. Here we permit the transaction cost to depend upon the entire shipment pattern, namely, c ij = c ij (t, x). Hence, we have the following mappings, f, g : [0, T ] L 2 ([0, T ], R mn + ) L 2 ([0, T ], R m + ), d : [0, T ] L 2 ([0, T ], R mn + ) L 2 ([0, T ], R n +), c : [0, T ] L 2 ([0, T ], R mn + ) L 2 ([0, T ], R mn + ). The profit of the firm P i, i = 1,..., m, at the time t [0, T ] is, (1) v i (t, x) = d j (t, x)x ij f i (t, x) g i (t, x) c ij (t, x)x ij, namely, it is equal to the price that the demand markets are disposed to pay minus the production costs, the storage costs and the transportation costs. The aim of the model for this problem in which the m firms supply the commodity in a noncooperative fashion, is to maximize its own profit function considered the optimal distribution pattern for the other firms. We want to determine a commodity distribution matrix-function for which the m firms and the n demand markets will be in a state of equilibrium as defined later. Suppose also that the following assumptions on the profit function v 4
5 DOI: /journal.caim.415 ( ) vi (given by (1)) and on D v = x ij i = 1,..., m j = 1,..., n hold: i. v(t, x) is continuously differentiable a.e. in [0, T ], ii. D v is a Carathèodory function such that (2) h L 2 ([0, T ]) : D v(t, x) mn h x mn a.e. in [0, T ], iii. v i (t, x) is pseudoconcave with respect to the variables x i, i = 1,..., m, namely the following holds a.e. in [0, T ] : v (3) (t, x 1,..., x i,..., x m ), x i y i 0 x i v i (t, x 1,..., x i,..., x m ) v i (t, x 1,..., y i,..., x m ). In oligopolistic markets the pseudoconcavity assumption (3) is satisfied mainly because explicit conditions on the data (i.e. production cost, demand price, storage cost, transaction cost) are not given Dynamic oligopolistic market equilibrium problem in presence of production excesses. At first, we want to consider the case in which some of the amounts of the commodity available are sold out whereas for a part of the producers can occur an excess of production (see [1]). Let ɛ i, i = 1,..., m, be the nonnegative production excess for the commodity of the firm P i at the time t [0, T ]. Let us group the production excess into a vector-function ɛ : [0, T ] R m +. The following feasibility condition holds, a.e. in [0, T ] : (4) p i = x ij + ɛ i, i = 1,..., m, namely the quantity produced by each firm P i at the time t [0, T ] must be equal to the sum of the commodity shipments from that firm to each demand markets plus the production excess at the same time t [0, T ]. We suppose that ɛ L 2 ([0, T ], R m + ). As a consequence, we have p L 2 ([0, T ], R m + ). In virtue of (4) since the production excess ɛ i at the time t [0, T ] is nonnegative, we have (5) x ij p i, i = 1,..., m, a.e. in [0, T ]. 5
6 A. Barbagallo et al (6) Taking into account (5), the feasible set for the distribution pattern is: { K = x L 2 ([0, T ], R mn ) : x ij 0, i = 1,..., m, j = 1,..., n, a.e. in [0, T ], } x ij p i, i = 1,..., m, a.e. in [0, T ]. Now, we give the dynamic oligopolistic market equilibrium conditions in presence of production excesses by using Lagrange variables associated to the constraints. Definition 2.1. x K is a dynamic oligopolistic market problem equilibrium in presence of excesses if and only if for each i = 1,..., m, j = 1,..., n and a.e. in [0, T ] there exists λ ij L2 (0, T ), µ i L2 (0, T ), such that (7) v i(t, x ) x ij + µ i = λ ij, (8) ( v i(t, x ) ) + µ i x x ij = 0, ij (9) λ ijx ij = 0, λ ij 0, (10) µ i x ij p i = 0, µ i 0. The terms λ ij and µ i are the Lagrange multipliers associated to the constraints x ij 0 and to x ij p i, respectively. Making use of the infinite-dimensional duality theory (see [26,36 38]), it is possible to prove the following equivalence (see Theorem 2.2 in [1]). Theorem 2.1. x K is a dynamic oligopolistic market equilibrium in presence of production excesses if and only if it satisfies the evolutionary variational inequality (11) T 0 m i=1 v i(t, x ) x ij (x ij x ij)dt 0 x K, 6
7 DOI: /journal.caim.415 where K is given by (6). Moreover, the equivalence between the evolutionary variational inequality (11) and the dynamic Cournot-Nash principle, which we recall in the following, has been proved (see Theorem 3.1 in [22]). Definition 2.2. x K is a dynamic oligopolistic market equilibrium in presence of production excesses if and only if for each i = 1,..., m and a.e. in [0, T ] we have (12) v i (t, x ) v i (t, x i, ˆx i ), a.e. in [0, T ], where x i = (x i1,..., x in ), a.e. x i+1,..., x m). in [0, T ] and ˆx i = (x 1,..., x i 1, Hence, we seek to determine a nonnegative commodity distribution matrix function x for which the m firms and the n demand markets will be in a state of equilibrium, such that the m firms try to maximize their own profit at the time t [0, T ] Dynamic oligopolistic market equilibrium problem in presence of production and demand excesses. Now we recall the dynamic oligopolistic market equilibrium problem in presence of both production and demand excesses introduced in [2], namely we allow that for a part of the producers can occur an excess of production whereas for a part of the demand markets the supply can not satisfy the demand. In order to clarify the presence of both excesses we consider some concrete economic situations. During an economic crisis period the presence of production excesses can be due to a decrease in market demands and, on the other hand, the presence of demand excesses may occur when the supply can not satisfy the demand especially for fundamental goods. Moreover, since the market model presented in this paper evolves in time, the presence of both excesses can be consequence of the fact that the physical transportation of commodity between a firm and a demand market is evidently limited, therefore there exist some time instants in which, though some firms produce more commodity than they can send to all the demand markets, some of the demand markets require more commodity. In addition to what we have considered previously, let us denote by δ j, j = 1,..., n, the nonnegative demand excess for the commodity of the demand market Q j at the time t [0, T ]. Let us group the demand excess into a vector-function δ : [0, T ] R n + and let us suppose that the 7
8 A. Barbagallo et al following feasibility conditions hold, a.e. in [0, T ] : (13) p i = x ij + ɛ i, i = 1,..., m, (14) q j = m x ij + δ j, j = 1,..., n. i=1 Hence, the quantity produced by each firm P i, at the time t [0, T ], must be equal to the commodity shipments from that firm to all the demand markets plus the production excess at the same time t [0, T ] and the quantity demanded by each demand market Q j at the time t [0, T ] must be equal to the commodity shipments from that firm to all the demand markets plus the demand excess at the same time t [0, T ]. Taking into account (13) and (14), since the production excess ɛ i at the time t [0, T ] and the demand excess δ j at the same time t [0, T ] are nonnegative, we have (15) x ij p i, i = 1,..., m, a.e. in [0, T ], (16) m x ij q j, j = 1,..., n, a.e. in [0, T ]. i=1 Moreover, we assume that the nonnegative commodity shipment between the producer firm P i and the demand market Q j has to satisfy time-dependent constraints, namely, there exist two nonnegative functions x, x L 2 ([0, T ], R mn + ) such that (17) x ij x ij x ij, i = 1,..., m, j = 1,..., n, a.e. in [0, T ] that define the limits in transportation. Let us assume that ɛ L 2 ([0, T ], R m + ), and δ L 2 ([0, T ], R n +). As a consequence, we have p L 2 ([0, T ], R m + ), and q L 2 ([0, T ], R n +). According to (15), (16) and (17), the feasible set for the distribution pattern is: 8
9 DOI: /journal.caim.415 { (18) K = x L 2 ([0, T ], R mn ) : x ij x ij x ij, i = 1,..., m, j = 1,..., n, a.e. in [0, T ], x ij p i, i = 1,..., m, a.e. in [0, T ], } m x ij q j, j = 1,..., n, a.e. in [0, T ]. i=1 Let us present the dynamic oligopolistic market equilibrium condition in presence of production and demand excesses. Definition 2.3. x K is a dynamic oligopolistic market problem equilibrium in presence of excesses if and only if for each i = 1,..., m, j = 1,..., n and a.e. in [0, T ] there exists λ ij L2 (0, T ), ρ ij L2 (0, T ), µ i L 2 (0, T ), ν j L2 (0, T ) such that (19) v i(t, x ) x ij + ρ ij + µ i + ν j = λ ij, (20) λ ij(x ij x ij) = 0, λ ij 0, (21) ρ ij(x ij x ij ) = 0, ρ ij 0, (22) µ i x ij p i = 0, µ i 0, ( m ) (23) νj x ij q j = 0, νj 0. i=1 The terms λ ij, ρ ij, µ i, ν j are the Lagrange multipliers associated to the constraints x ij x ij, x ij x ij, x ij p i and to m x ij q j, respectively. i=1 9
10 A. Barbagallo et al Also in this case, the previous equilibrium conditions is equivalent to an evolutionary variational inequality (see Theorem 2.2 in [2]). Theorem 2.2. x K is a dynamic oligopolistic market equilibrium in presence of both production and demand excesses if and only if it satisfies the evolutionary variational inequality (24) T 0 m i=1 where K is given by (18). v i(t, x ) x ij (x ij x ij)dt 0 x K, Finally, we have that the state of equilibrium of the dynamic oligopolistic market in presence of both production and demand excesses is the same Cournot-Nash principle as the one considered in the previous model. For existence and regularity results, consult [1,2,39,40]. 3. Solution method. Let us introduce a method to solve dynamic oligopolistic market equilibrium problems in presence of excesses expressed by evolutionary variational inequalities. We suppose that the assumptions which ensure the continuity of dynamic oligopolistic market equilibrium solution are satisfy. As a consequence, (11) and (24) hold for each t [0, T ], namely (25) D v(t, x ), x x 0, x K, t [0, T ] where K = { x R mn : x ij 0, i = 1,..., m, j = 1,..., n, x ij p i, for the problem with only production excesses and { K = i = 1,..., m x R mn : x ij x ij x ij, } i = 1,..., m, j = 1,..., n, x ij p i, i = 1,..., m m x ij q j, i=1 j = 1,..., n }, 10
11 DOI: /journal.caim.415 for the problem with both production and demand excesses. In the following, applying a discretization procedure and making use of the extragradient method in Marcotte s version, we compute the solutions of the evolutionary variational inequality which expresses the dynamic oligopolistic market equilibrium conditions in presence of excesses. Let us consider a partition of [0, T ], such that: 0 = t 0 < t 1 <... < t r <... < t N = T. For each point t r, r = 0, 1,..., N, of the partition, we consider the finite-dimensional variational inequality (26) D v(t r, x (t r )), x(t r ) x (t r ) 0, x(t r ) K(t r ). We compute now the solution to the finite-dimensional variational inequality (26) making use of a modified version of the extragradient method introduced by Marcotte in [41]. The algorithm starting from any x 0 (t r ) K(t r ) and a fixed number α 0 > 0, iteratively updates x k+1 (t r ) from x k (t r ) according to the following projection formulas (27) x k+1 (t r ) = P K(tr)(x k (t r ) α k ( D ( x k (t r )))), (28) x k (t r ) = P K(tr)(x k (t r ) α k ( D (x k (t r )))) for k N, where α k is chosen as following { α k 1 (29) α k = min 2, x k (t r ) x k (t r ) mn }. 2 ( D (x k (t r ))) ( D ( x k (t r ))) mn If D v is a monotone and Lipschitz continuous mapping, then, the convergence of the scheme is proved. This method was improved by Tinti in [42]. After the iterative procedure, we get the dynamic equilibrium solution through a linear interpolation of the computed static equilibrium solutions Convergence analysis. In this section, we investigate on the convergence of algorithms presented in the previous section. We prove that under suitable assumptions, the sequence, generated by the algorithm, converges in L 1 -sense to the dynamic oligopolistic market equilibrium solution in presence of excesses. Let us assume that all hypotheses which ensure the continuity of solution to (25) and the convergence of the Marcotte s extragradient method to compute solutions to finite-dimensional variational inequalities hold. Let 11
12 A. Barbagallo et al us introduce a sequence {π s } s N of (not necessarily equidivided) partitions of the time interval [0, T ] such that π s = (t 0 s, t 1 s,..., t Ns s ), where 0 = t 0 s < t 1 s <... < t Ns s = T. We consider a sequence of equidivided partitions, in the sense that k s := max{ t r s t r 1 s : r = 1, 2,..., N s }, approaches zero for s +. By the interpolation theory, we know that if we construct the approximate solution to (25) by means of Hermite s polynomial, using known values of the solution x, the sequence converges uniformly to the exact solution. We do not use Hermite s polynomial, but we consider an approximation by means of piecewise constant functions and we can prove that the convergence is in L 1 -sense. Let us consider the approximate solutions to (25) given by the following formula: N s (30) x s = x (t r s)χ [t r 1 s,t r[, s r=1 where x (t r n) is the solution to the finite-dimensional variational inequality which is obtained to (25) for t = t r s, which can be compute by means of the Marcotte s extragradient method. Let us estimate the following integral T 0 N s x r=1 T = x (t r s)χ [t r 1 s,t r[ dt s mn 0 N s r=1 N s t s r r=1 t s r 1 x χ [t r 1 s Ns,t r s[ r=1 x x (t r s) mn dt. x (t r s)χ [t r 1 s,t r s[ mn dt Being x uniformly continuous, it results that for every ε > 0 there exists δ > 0 such that if t [t r 1 s, t r s] satisfies the condition t t r s < δ it results 0 x x (t r s) mn < ε T, for r = 1, 2,..., N s, s N. Choosing s large enough in such way that k s < δ, we reach T N s N s (31) x x (t r ε s)χ [t r 1 s,t r[ dt < s mn T (ts r t s r 1) = ε. r=1 Taking into account (31), we conclude that the sequence (30) converges in L 1 -sense to the dynamic oligopolistic market equilibrium solution in presence of excesses. r=1 12
13 DOI: /journal.caim Numerical results. Let us consider some numerical examples of the dynamical oligopolistic market equilibrium problem in presence of excesses consisting of three firms and four demand markets, as in Figure 1. At first, we suppose that there are only production excesses. P 1 P 2 P 3 Q 3 Q 4 Q 1 Q 2 Figure 1. Network structure of the numerical dynamic spatial oligopoly problem. Let p C([0, 1], R 3 ) be the production function such that, in [0, 1], p = ( 4t 3t 4t ) T, As a consequence, the feasible set is { K = x L 2 ([0, 1], R 3 4 ) : x ij 0, i = 1, 2, 3, j = 1, 2, 3, 4, a.e. in [0, 1], 4 } x ij p i, i = 1, 2, 3, a.e. in [0, 1]. Let v C 1 (L 2 ([0, 1], R 3 4 ), R 3 ) be the profit function defined by v 1 (t, x) = 4x x x x x 11 x 12 6x 13 x 14 +3tx tx 12 + tx 13 + tx 14, v 2 (t, x) = 5x x x x x 21 x 22 2x 23 x 24 +2tx tx tx tx 24, v 3 (t, x) = 10x x x x x 11 x 32 2x 33 x 34 2x 12 x 31 + tx tx tx tx 34. Then, the operator D v C(L 2 ([0, 1], R 3 4 ), R 3 4 ) is given by 8x 11 4x t 8x 12 4x t 12x 13 6x 14 + t 12x 14 6x 13 + t D v = 10x 21 2x t 4x 22 2x t 4x 23 2x t 4x 24 2x t. 20x 31 2x 12 + t 8x 32 2x t 8x 33 2x t 10x 34 2x t Moreover, it is possible to verify that D v is a strongly monotone operator (for the proof, you can see similar calculations in [1] and [2]). The dynamic oligopolistic market equilibrium distribution in presence of excesses is the solution to the evolutionary variational inequality: (32) i=1 v i(t, x ) x ij (x ij x ij)dt 0, x K. 13
14 A. Barbagallo et al Taking into account the direct method (see [33 35]), we consider the following system 8x x 12 3t = 0, 4x x 12 4t = 0, 12x x 14 t = 0, 6x x 14 t = 0, 10x (33) x 22 2t = 0, 2x x 22 2t = 0, 4x x 24 3t = 0, 2x x 24 2t = 0, 20x x 12 t = 0, 8x x 11 2t = 0, 8x x 34 10t = 0, 2x x 34 3t = 0 We get the following solution, in [0, 1], 1 6 t 5 12 t 1 18 t 1 18 t x 1 = 9 t 4 9 t 2 3 t 1 6 t, t 5 24 t t 1 19 t that belongs to the constraint set K, then it is the equilibrium solution. Moreover, the production excesses, in [0, 1], are given by ( 119 ɛ = 36 t t 2843 ) T 1140 t. Now, we solve the numerical problem using the generalized Marcotte s version of the extragradient method. This method is convergent for the properties of D v. Then, we can compute an approximate curve of equilibria, by selecting t r { k 20 : k {0, 1,..., 20}}. With the help of a Mat- Lab computation and choosing the initial point x 0 (t r ) = 2 3 t r 1 3 t r 1 2 t r t r 1 2 t r 1 10 t r 1 2 t r 1 8 t r t r 1 3 t r 2 5 t r 1 8 t r in order to start the iterative method, we obtain the equilibrium solutions for every time instant. Setting R(x k (t r )) = x k (t r ) x k 1 (t r ) the difference between two approximations of the equilibrium solution in the time instant t r and making use of the stopping criterion R(x k (t r )) , for r = 0, 1,..., 20, we obtain the approximate curve of equilibria shown in Figure 2. Now, we analyze the dynamic oligopolistic market equilibrium problem in presence of both production and demand excesses. 14
15 DOI: /journal.caim.415 Numerical solution x* 11 x* 12 x* 13 x* 14 x* 21 x* 22 x* 23 x* 24 x* 31 x* 32 x* 33 x* Time Figure 2. Curves of equilibria of problem with only production excesses. Let x, x C([0, 1], R 3 4 ) be the capacity constraints such that, in [0, 1], t 1 50 t t 2t 4t 6t t x = t t, x = 4t 3t 5t t t 1 2 t 0 t t t 3t Let p be the same production function considered in the previous example and let q C([0, 1], R 4 ) be the demand function such that, in [0, 1], Hence, the feasible set is { K = x L 2 ([0, 1], R 3 4 ) : q = ( 6t 4t 4t 8t ) T. x ij x ij x ij, i = 1, 2, 3, j = 1, 2, 3, 4, a.e. in [0, 1], 4 x ij p i, i = 1, 2, 3, a.e. in [0, 1], } 3 x ij q j, j = 1, 2, 3, 4, a.e. in [0, 1]. i=1 Let us consider the same profit function v. In order to compute the solution to (32) we make use of the direct method (see [33 35]). We consider again the system (33) and we get the same solution. But we observe that x 15
16 A. Barbagallo et al does not belong to the constraint set K because x 33 > t. Let us consider now the set { K = x L 2 ([0, 1], R 3 4 ) : x ij x ij x ij, i = 1, 2, 3, j = 1, 2, 3, 4, (i, j) (3, 3), a.e. in [0, 1], x 33 = t, a.e. in [0, 1], 4 x ij p i, i = 1,..., 3, a.e. in [0, 1], } 3 x ij q j, j = 1,..., 4, a.e. in [0, 1] i=1 and the system 8x x 12 3t = 0, 4x x 12 4t = 0, 12x x 14 t = 0, 6x x 14 t = 0, 10x (34) x 22 2t = 0, 2x x 22 2t = 0, 4x x 24 3t = 0, 2x x 24 2t = 0, 20x x 12 t = 0, 8x x 11 2t = 0, x 33 = t, 2x x 34 3t = 0 We can observe that 1 6 t 5 12 t 1 18 t 1 18 t x 1 = 9 t 4 9 t 2 3 t 1 6 t, t 5 24 t t 1 10 t is a solution, in [0, 1], since 8x x 34 10t < 0. Now, we are able to compute the production and the demand excesses of each firm in [0, 1] : ( 119 ɛ = 36 t t 161 ) T ( t, δ = 360 t t t 691 ) T 90 t, With the same method and initial data of previous example it is possible to compute the numerical solution, so we get the approximate curve of equilibria shown in Figure 3. Comparing the numerical results, we can remark that the equilibrium solutions are different and dependent on the presence of the excesses. The difference of the equilibrium solutions between the two examples is pointed 16
17 DOI: /journal.caim.415 Numerical solution x* 11 x* 12 x* 13 x* 14 x* 21 x* 22 x* 23 x* 24 x* 31 x* 32 x* 33 x* Time Figure 3. Curves of equilibria of problem with both production and demand excesses. out by the presence of capacity constraints. If we did not consider the capacity constraints, the equilibrium solutions computed through the direct method, would be the same and belonging to the same set K. The presence of the capacity constraints, like we see, forces the solution to belong to the face K. In this examples we observe that the numerical method fits very well the approximate solution with the exact solution computed through the direct metod. This verifies even the good convergence of the numerical method. REFERENCES 1. A. Barbagallo and P. Mauro, Evolutionary variational formulation for oligopolistic market equilibrium problems with production excesses, J. Optim. Theory Appl., vol. 155, pp. 1 27, A. Barbagallo and P. Mauro, Time-dependent variational inequality for an oligopolistic market equilibrium problem with production and demand excesses, Abstr. Appl. Anal., no , F. Raciti and L. Scrimali, Time-dependent variational inequalities and applications to equilibrium problems, J. Global Optim., vol. 28, pp , F. Raciti, Equilibrium conditions and vector variational inequalities: a complex relation, J. Global Optim., vol. 40, pp , M. B. Donato, M. Milasi, and C. Vitanza, A new contribution to a dynamic competitive equilibrium problem, Appl. Math. Letters, vol. 23, pp ,
18 A. Barbagallo et al 6. M. B. Donato, M. Milasi, and C. Vitanza, Quasivariational inequalities for a dynamic competitive economic equilibrium problem, J. Inequal. Appl., G. Anello, M. Donato, and M. Milasi, A quasi-variational approach to a competitive economic equilibrium problem without strong monotonicity assumption, J. Global Optim., vol. 48, pp , P. Daniele, Dynamic Networks and Evolutionary Variational Inequalities. Edward Elgar Publishing, G. Fragnelli, An age-dependent population equation with diffusion and delayed birth process, International Journal of Mathematics and Mathematical Sciences, vol. 20, pp , G. Fragnelli, P. Martinez, and J. Vancostenoble, Qualitative properties of a population dynamics system describing pregnancy, Math. Model Methods Appl. Sci., vol. 15, pp , M. Ragusa, Commutators of fractional integral operators on vanishingmorrey spaces, J. Global Optim., vol. 40, no. 1-3, pp , M. Ragusa, Homogeneous herz spaces and regularity results, Nonlinear Anal., vol. 71, pp. e1909 e1914, M. A. Ragusa, Embeddings for morrey-lorentz spaces, J. Optim. Theory Appl., vol. 154, no. 2, pp , M. Ragusa, Necessary and sufficient condition for a vmo function, Appl. Math. Comput., vol. 218, no. 24, pp , M. Ragusa, Parabolic herzspaces and their applications, Appl. Math. Letters, vol. 25, no. 10, pp , M. Ragusa and A. Tachikawa, Regularity of minimizers of some variational integrals with discontinuity, Z. Anal. Anwend., vol. 27, no. 4, pp , A. Nagurney, Migration equilibrium and variational inequalities, Economic Letters, vol. 31, pp , A. Nagurney, J. Pan, and L. Zhao, Human migration networks, Eur. J. Oper. Res., vol. 59, pp , A. Cournot, Researches into the mathematical principles of the theory of wealth, English translation MacMillan, J. Nash, Equilibrium points in n-person games, Proceedings of the National Academy of Sciences of the United States of America, vol. 36, pp , J. Nash, Non-cooperative games, The Annals of Mathematics, vol. 54, pp , A. Barbagallo and M.-G. Cojocaru, Dynamic equilibrium formulation of oligopolistic market problem, Math. Comput. Model., vol. 49, pp
19 DOI: /journal.caim , M. Beckmann and J. Wallace, Continuous lags and the stability of market equilibrium, Economica, New Series, vol. 36, pp , A. Barbagallo and A. Maugeri, Memory term for dynamic oligopolistic market equilibrium problem, Aplimat: J. Appl. Math., vol. 3, pp , A. Barbagallo and A. Maugeri, Duality theory for the dynamic oligopolistic market equilibrium problem, Optim., vol. 60, pp , A. Maugeri and F. Raciti, Remarks on infinite dimensional duality, J. Global Optim., vol. 46, pp , A. Barbagallo and R. D. Vincenzo, Lipschitz continuity and duality for dynamic oligopolistic market equilibrium problem with memory term, J. Math. Anal. Appl., vol. 382, pp , A. Barbagallo, Degenerate time-dependent variational inequalities with applications to traffic equilibrium problems, Comput. Methods Appl. Math., vol. 6, pp , A. Barbagallo, Regularity results for time-dependent variational and quasi-variational inequalities and computational procedures, Math. Models Methods Appl., vol. 17, pp , A. Barbagallo, Regularity results for evolutionary nonlinear variational and quasi-variational inequalities with applications to dynamic equilibrium problems, J. Global Optim., vol. 40, pp , A. Barbagallo, Existence and regularity of solutions to nonlinear degenerate evolutionary variational inequalities with applications to dynamic equilibrium problems, Appl. Math. Comput., vol. 208, pp. 1 13, A. Barbagallo, On the regularity of retarded equilibria in timedependent traffic equilibrium problems, Nonlinear Anal., vol. 71, pp , A. Maugeri, Convex programming, variational inequalities and applications to the traffic equilibrium problem, Appl. Math. Optim., vol. 16, pp , P. Daniele and A. Maugeri, The economic model for demand-supply problems, P. Daniele, F. Giannessi and A. Maugeri, (eds): Equilibrium Problems and Variational Models, pp , P. Daniele, Evolutionary variational inequalities and economics models for demand-supply markets, Math. Models Methods Appl. Sci., vol. 4, pp , P. Daniele, S. Giuffrè, G. Idone, and A. Maugeri, Infinite dimensional duality and applications, Math. Ann., vol. 339, pp ,
20 A. Barbagallo et al 37. P. Daniele and S. Giuffrè, General infinite dimensional duality and applications to evolutionary network equilibrium problems, Optim. Lett., vol. 1, pp , P. Daniele, S. Giuffrè, and A. Maugeri, Remarks on general infinite dimensional duality with cone and equality constraints, Communications in Applied Analysis, vol. 13, pp , A. Maugeri and F. Raciti, On existence theorems for monotone and nonmonotone variational inequalities, J. Convex Anal., vol. 16, pp , A. Barbagallo and M.-G. Cojocaru, Continuity of solutions for parametric variational inequalities in banach space, J. Math. Anal., vol. 351, pp , P. Marcotte, Application of khobotov s algorithm to variational inequalities and network equilibrium problems, Inform. Systems Oper. Res., vol. 29, pp , F. Tinti, Numerical solution for pseudomonotone variational inequality problems by extragradient methods, variational analysis and applications, Nonconvex Optim. Appl., vol. 79, pp ,
A Cournot-Nash Bertrand Game Theory Model of a Service-Oriented Internet with Price and Quality Competition Among Network Transport Providers
of a Service-Oriented Internet with Price and Quality Competition Among Network Transport Providers Anna Nagurney 1 Tilman Wolf 2 1 Isenberg School of Management University of Massachusetts Amherst, Massachusetts
More informationEquilibria and Dynamics of. Supply Chain Network Competition with Information Asymmetry. and Minimum Quality Standards
Equilibria and Dynamics of Supply Chain Network Competition with Information Asymmetry in Quality and Minimum Quality Standards Anna Nagurney John F. Smith Memorial Professor and Dong (Michelle) Li Doctoral
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationSupply Chain Network Design Under Profit Maximization and Oligopolistic Competition
Supply Chain Network Design Under Profit Maximization and Oligopolistic Competition Anna Nagurney Department of Finance and Operations Management Isenberg School of Management University of Massachusetts
More informationOPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov
DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS Supplement Volume 2005 pp. 345 354 OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN E.V. Grigorieva Department of Mathematics
More informationWorking Paper Series
RGEA Universidade de Vigo http://webs.uvigo.es/rgea Working Paper Series A Market Game Approach to Differential Information Economies Guadalupe Fugarolas, Carlos Hervés-Beloso, Emma Moreno- García and
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationFUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM
International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationError Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach
Outline Error Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach The University of New South Wales SPOM 2013 Joint work with V. Jeyakumar, B.S. Mordukhovich and
More information15 Kuhn -Tucker conditions
5 Kuhn -Tucker conditions Consider a version of the consumer problem in which quasilinear utility x 2 + 4 x 2 is maximised subject to x +x 2 =. Mechanically applying the Lagrange multiplier/common slopes
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point
More informationApplications to Data Smoothing and Image Processing I
Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is
More informationAtomic Cournotian Traders May Be Walrasian
Atomic Cournotian Traders May Be Walrasian Giulio Codognato, Sayantan Ghosal, Simone Tonin September 2014 Abstract In a bilateral oligopoly, with large traders, represented as atoms, and small traders,
More informationName. Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions.
Name Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions. Question 1. A firm has a production function F (x 1, x 2 ) = ( x 1 + x 2 ) 2. It is a price
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More informationAn optimal transportation problem with import/export taxes on the boundary
An optimal transportation problem with import/export taxes on the boundary Julián Toledo Workshop International sur les Mathématiques et l Environnement Essaouira, November 2012..................... Joint
More informationSupport Vector Machines Explained
March 1, 2009 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),
More informationOn the Interaction and Competition among Internet Service Providers
On the Interaction and Competition among Internet Service Providers Sam C.M. Lee John C.S. Lui + Abstract The current Internet architecture comprises of different privately owned Internet service providers
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationFourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions
Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions Jennifer Zhao, 1 Weizhong Dai, Tianchan Niu 1 Department of Mathematics and Statistics, University of Michigan-Dearborn,
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationCONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí
Opuscula Math. 34 no. 4 2014 683 690 http://dx.doi.org/10.7494/opmath.2014.34.4.683 Opuscula Mathematica CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian Pasquale
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,
More informationCorollary. (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality
Corollary For equidistant knots, i.e., u i = a + i (b-a)/n, we obtain with (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality 120202: ESM4A - Numerical Methods
More informationDuality in Linear Programming
Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow
More informationSome Problems of Second-Order Rational Difference Equations with Quadratic Terms
International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationDiscussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski.
Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne
More information6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationLECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method
LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right
More information6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games Asu Ozdaglar MIT February 4, 2009 1 Introduction Outline Decisions, utility maximization Strategic form games Best responses
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationSensitivity analysis of utility based prices and risk-tolerance wealth processes
Sensitivity analysis of utility based prices and risk-tolerance wealth processes Dmitry Kramkov, Carnegie Mellon University Based on a paper with Mihai Sirbu from Columbia University Math Finance Seminar,
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationTHE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages
More information3. Reaction Diffusion Equations Consider the following ODE model for population growth
3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationOn Lexicographic (Dictionary) Preference
MICROECONOMICS LECTURE SUPPLEMENTS Hajime Miyazaki File Name: lexico95.usc/lexico99.dok DEPARTMENT OF ECONOMICS OHIO STATE UNIVERSITY Fall 993/994/995 Miyazaki.@osu.edu On Lexicographic (Dictionary) Preference
More informationLyapunov Stability Analysis of Energy Constraint for Intelligent Home Energy Management System
JAIST Reposi https://dspace.j Title Lyapunov stability analysis for intelligent home energy of energ manageme Author(s)Umer, Saher; Tan, Yasuo; Lim, Azman Citation IEICE Technical Report on Ubiquitous
More informationMulti-variable Calculus and Optimization
Multi-variable Calculus and Optimization Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Multi-variable Calculus and Optimization 1 / 51 EC2040 Topic 3 - Multi-variable Calculus
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationGame Theory: Supermodular Games 1
Game Theory: Supermodular Games 1 Christoph Schottmüller 1 License: CC Attribution ShareAlike 4.0 1 / 22 Outline 1 Introduction 2 Model 3 Revision questions and exercises 2 / 22 Motivation I several solution
More informationDuality in General Programs. Ryan Tibshirani Convex Optimization 10-725/36-725
Duality in General Programs Ryan Tibshirani Convex Optimization 10-725/36-725 1 Last time: duality in linear programs Given c R n, A R m n, b R m, G R r n, h R r : min x R n c T x max u R m, v R r b T
More informationSolutions Of Some Non-Linear Programming Problems BIJAN KUMAR PATEL. Master of Science in Mathematics. Prof. ANIL KUMAR
Solutions Of Some Non-Linear Programming Problems A PROJECT REPORT submitted by BIJAN KUMAR PATEL for the partial fulfilment for the award of the degree of Master of Science in Mathematics under the supervision
More informationOptimal shift scheduling with a global service level constraint
Optimal shift scheduling with a global service level constraint Ger Koole & Erik van der Sluis Vrije Universiteit Division of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The
More information1 Mathematical Models of Cost, Revenue and Profit
Section 1.: Mathematical Modeling Math 14 Business Mathematics II Minh Kha Goals: to understand what a mathematical model is, and some of its examples in business. Definition 0.1. Mathematical Modeling
More informationThe Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationMixedÀ¾ нOptimization Problem via Lagrange Multiplier Theory
MixedÀ¾ нOptimization Problem via Lagrange Multiplier Theory Jun WuÝ, Sheng ChenÞand Jian ChuÝ ÝNational Laboratory of Industrial Control Technology Institute of Advanced Process Control Zhejiang University,
More informationModeling and Performance Evaluation of Computer Systems Security Operation 1
Modeling and Performance Evaluation of Computer Systems Security Operation 1 D. Guster 2 St.Cloud State University 3 N.K. Krivulin 4 St.Petersburg State University 5 Abstract A model of computer system
More information1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
More informationConstrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2010, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
More informationLinear Programming Notes VII Sensitivity Analysis
Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationReinforcement Learning
Reinforcement Learning LU 2 - Markov Decision Problems and Dynamic Programming Dr. Martin Lauer AG Maschinelles Lernen und Natürlichsprachliche Systeme Albert-Ludwigs-Universität Freiburg martin.lauer@kit.edu
More informationComputing the Electricity Market Equilibrium: Uses of market equilibrium models
Computing the Electricity Market Equilibrium: Uses of market equilibrium models Ross Baldick Department of Electrical and Computer Engineering The University of Texas at Austin April 2007 Abstract We discuss
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationECONOMIC THEORY AND OPERATIONS ANALYSIS
WILLIAM J. BAUMOL Professor of Economics Princeton University ECONOMIC THEORY AND OPERATIONS ANALYSIS Second Edition Prentice-Hall, I Inc. Engkwood Cliffs, New Jersey CONTENTS PART 7 ANALYTIC TOOLS OF
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationProximal mapping via network optimization
L. Vandenberghe EE236C (Spring 23-4) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:
More informationNumerical Solution of Differential
Chapter 13 Numerical Solution of Differential Equations We have considered numerical solution procedures for two kinds of equations: In chapter 10 the unknown was a real number; in chapter 6 the unknown
More informationAn interval linear programming contractor
An interval linear programming contractor Introduction Milan Hladík Abstract. We consider linear programming with interval data. One of the most challenging problems in this topic is to determine or tight
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
More informationON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, 112612, UAE
International Journal of Pure and Applied Mathematics Volume 101 No. 3 2015, 401-405 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v101i3.7
More informationECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1
More informationComputer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 7: Conditionally Positive Definite Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationNew Economic Perspectives for Resource Allocation in Wireless Networks
2005 American Control Conference June 8-10, 2005. Portland, OR, USA FrA18.2 New Economic Perspectives for Resource Allocation in Wireless Networks Ahmad Reza Fattahi and Fernando Paganini Abstract The
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationOligopoly and Strategic Pricing
R.E.Marks 1998 Oligopoly 1 R.E.Marks 1998 Oligopoly Oligopoly and Strategic Pricing In this section we consider how firms compete when there are few sellers an oligopolistic market (from the Greek). Small
More informationAsian Option Pricing Formula for Uncertain Financial Market
Sun and Chen Journal of Uncertainty Analysis and Applications (215) 3:11 DOI 1.1186/s4467-15-35-7 RESEARCH Open Access Asian Option Pricing Formula for Uncertain Financial Market Jiajun Sun 1 and Xiaowei
More informationSome Research Problems in Uncertainty Theory
Journal of Uncertain Systems Vol.3, No.1, pp.3-10, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationA PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable
More informationConvex Programming Tools for Disjunctive Programs
Convex Programming Tools for Disjunctive Programs João Soares, Departamento de Matemática, Universidade de Coimbra, Portugal Abstract A Disjunctive Program (DP) is a mathematical program whose feasible
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationRotation Rate of a Trajectory of an Algebraic Vector Field Around an Algebraic Curve
QUALITATIVE THEORY OF DYAMICAL SYSTEMS 2, 61 66 (2001) ARTICLE O. 11 Rotation Rate of a Trajectory of an Algebraic Vector Field Around an Algebraic Curve Alexei Grigoriev Department of Mathematics, The
More information