Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Lagrangian decomposition for stochastic TIMES energy system optimization model

  • Energy system optimization models play an essential role in current decision support on topics including energy security, sustainable development and environmental protection from industrial, regional, national and even global perspective. One of the key energy system optimization models applied in international energy policy is TIMES. The article establishes two basic deterministic TIMES models which cover an energy commodity (coal or gas), a three-step supply curve and an end-use energy service demand. Then we convert the deterministic TIMES models into a stochastic optimization problem with multiple scenarios, and implement the Lagrangian decomposition approach in solving the stochastic programming models. The numerical experiment shows the feasibility of the Lagrangian decomposition algorithm to solve stochastic TIMES models with a small amount of scenarios, and analyze several reasons for non-convergence cases including the choice of step length and initial values of Lagrangian multipliers.

    Citation: Yujun Zhu, Ju Ming. Lagrangian decomposition for stochastic TIMES energy system optimization model[J]. AIMS Mathematics, 2022, 7(5): 7964-7996. doi: 10.3934/math.2022445

    Related Papers:

    [1] Kamaraj Dhurai, Nak Eun Cho, Srikandan Sivasubramanian . On a class of analytic functions closely related to starlike functions with respect to a boundary point. AIMS Mathematics, 2023, 8(10): 23146-23163. doi: 10.3934/math.20231177
    [2] Lina Ma, Shuhai Li, Huo Tang . Geometric properties of harmonic functions associated with the symmetric conjecture points and exponential function. AIMS Mathematics, 2020, 5(6): 6800-6816. doi: 10.3934/math.2020437
    [3] Georgia Irina Oros, Gheorghe Oros, Daniela Andrada Bardac-Vlada . Certain geometric properties of the fractional integral of the Bessel function of the first kind. AIMS Mathematics, 2024, 9(3): 7095-7110. doi: 10.3934/math.2024346
    [4] Bo Wang, Rekha Srivastava, Jin-Lin Liu . Certain properties of multivalent analytic functions defined by q-difference operator involving the Janowski function. AIMS Mathematics, 2021, 6(8): 8497-8508. doi: 10.3934/math.2021493
    [5] Pinhong Long, Huo Tang, Wenshuai Wang . Functional inequalities for several classes of q-starlike and q-convex type analytic and multivalent functions using a generalized Bernardi integral operator. AIMS Mathematics, 2021, 6(2): 1191-1208. doi: 10.3934/math.2021073
    [6] Ekram E. Ali, Rabha M. El-Ashwah, Wafaa Y. Kota, Abeer M. Albalahi, Teodor Bulboacă . A study of generalized distribution series and their mapping properties in univalent function theory. AIMS Mathematics, 2025, 10(6): 13296-13318. doi: 10.3934/math.2025596
    [7] K. Saritha, K. Thilagavathi . Differential subordination, superordination results associated with Pascal distribution. AIMS Mathematics, 2023, 8(4): 7856-7864. doi: 10.3934/math.2023395
    [8] Muajebah Hidan, Abbas Kareem Wanas, Faiz Chaseb Khudher, Gangadharan Murugusundaramoorthy, Mohamed Abdalla . Coefficient bounds for certain families of bi-Bazilevič and bi-Ozaki-close-to-convex functions. AIMS Mathematics, 2024, 9(4): 8134-8147. doi: 10.3934/math.2024395
    [9] Kholood M. Alsager, Sheza M. El-Deeb, Ala Amourah, Jongsuk Ro . Some results for the family of holomorphic functions associated with the Babalola operator and combination binomial series. AIMS Mathematics, 2024, 9(10): 29370-29385. doi: 10.3934/math.20241423
    [10] Aoen, Shuhai Li, Tula, Shuwen Li, Hang Gao . New subclass of generalized close-to-convex function related with quasi-subordination. AIMS Mathematics, 2025, 10(5): 12149-12167. doi: 10.3934/math.2025551
  • Energy system optimization models play an essential role in current decision support on topics including energy security, sustainable development and environmental protection from industrial, regional, national and even global perspective. One of the key energy system optimization models applied in international energy policy is TIMES. The article establishes two basic deterministic TIMES models which cover an energy commodity (coal or gas), a three-step supply curve and an end-use energy service demand. Then we convert the deterministic TIMES models into a stochastic optimization problem with multiple scenarios, and implement the Lagrangian decomposition approach in solving the stochastic programming models. The numerical experiment shows the feasibility of the Lagrangian decomposition algorithm to solve stochastic TIMES models with a small amount of scenarios, and analyze several reasons for non-convergence cases including the choice of step length and initial values of Lagrangian multipliers.



    In the literature, special functions have a great importance in a variety of fields of mathematics, such as mathematical physics, mathematical biology, fluid mechanics, geometry, combinatory and statistics. Due of the essential position of special functions in mathematics, they continue to play an essential role in the subject as well as in the geometric function theory. For geometric behavior of some other special functions, one can refer to [1,2,3,4,5,6,7,8,9,10,11,12]. An interesting way to discuss the geometric properties of special functions is by the means of some criteria due to Ozaki, Fejér and MacGregor. One of the important special functions is the Mathieu series that appeared in the nineteenth century in the monograph [13] defined on R by

    S(r)=n12n(n2+r2)2. (1.1)

    Surprisingly, the Mathieu series is considered in a variety of fields of mathematical physics, namely, in the elasticity of solid bodies [13]. For more applications regarding the Mathieu series, we refer the interested reader to [14, p. 258, Eq (54)]. The functions bear the name of the mathematician Émile Leonard Mathieu (1835–1890). Recently, a more general family of the Mathieu series was studied by Diananda [15] in the following form:

    Sμ(r)=n12n(n2+r2)μ+1(μ>0,rR). (1.2)

    In 2020, Gerhold et al. [16], considered a new Mathieu type power series, defined by

    Sα,β,μ(r;z)=k=0(k!)αzk((k!)β+r2)μ+1, (1.3)

    where α,μ0,β,r>0 and |z|1, such that α<β(μ+1).

    In [17], Bansal and Sokól have determined sufficient conditions imposed on the parameters such that the normalized form of the function S(r,z) belong to a certain class of univalent functions, such as starlike and close-to-convex. In [18], the authors presented some generalizations of the results of Bansal and Sokól by using the same technique. In addition, Gerhold et al. [18, Theorems 5 and 6] has established some sufficient conditions imposed on the parameter of the normalized form of the function S1,2,μ(r;z) defined by

    Qμ(r;z):=z+n=2n!(r2+1)μ+1((n!)2+r2)μ+1zn, (1.4)

    to be starlike and close-to-convex in the open unit disk. The main focus of the present paper is to extend and improve some results from [18] by using a completely different method. More precisely, in this paper we present some sufficient conditions, such as the normalized form of the function S1,β,μ(r;z) defined by

    Qμ,β(r;z)=z+n=2n!(r2+1)μ+1zn((n!)β+r2)μ+1, (1.5)

    satisfying several geometric properties such as starlikeness, convexity and close-to-convexity.

    We denoted by H the class of all analytic functions inside the unit disk

    D={z:zCand|z|<1}.

    Assume that A denoted the collection of all functions fH, satisfying the normalization f(0)=f(0)1=0 such that

    f(z)=z+k=2akzk,(zD).

    A function fA is said to be a starlike function (with respect to the origin zero) in D, if f is univalent in D and f(D) is a starlike domain with respect to zero in C. This class of starlike functions is denoted by S. The analytic characterization of S is given [19] below:

    (zf(z)f(z))>0(zD).

    If f(z) is a univalent function in D and f(D) is a convex domain in C, then fA is said to be a convex function in D. We denote this class of convex functions by K, which can also be described as follows:

    (1+zf(z)f(z))>0(zD).

    An analytic function f in A is called close-to-convex in the open unit disk D if there exists a function g(z), which is starlike in D such that

    (zf(z)g(z))>0,zD.

    It can be noted that every close-to-convex function in D is also univalent in D (see, for details, [19,20]).

    In order to show the main results, the following preliminary lemmas will be helpful. The first result is due to Ozaki (see also [21, Lemma 2.1]).

    Lemma 1.1. [22] Let

    f(z)=z+n=2anzn,

    be analytic in D. If

    12a2(n+1)an+10,

    or if

    12a2(n+1)an+12,

    then f is close-to-convex with respect to the function log(1z).

    Remark 1.2. We note that, as Ponnusamy and Vuorinen pointed out in [21], proceeding exactly as in the proof of Lemma 1.1, one can verify directly that if a function f:DC satisfies the hypothesis of the above lemma, then it is close-to-convex with respect to the convex function

    z1z.

    The next two lemmas are due to Fejér [23].

    Lemma 1.3. Suppose that a function f(z)=1+k=2akzk1, with ak0(k2) as analytic in D. If (ak)k1 is a convex decreasing sequence, i.e., ak2ak+1+ak+20 and akak+10 for all k1, then

    (f(z))>12(zD).

    Lemma 1.4. Suppose that a f(z)=z+k=2akzk, with ak0(k2) as analytic in D. If (kak)k1 and (kak(k+1)ak+1)k1 both are decreasing, then f is starlike in D.

    Lemma 1.5 ([24]). Assume that fA. If the following inequality

    |f(z)z1|<1,

    holds for all zD, then f is starlike in

    D12:={zCand|z|<12}.

    Lemma 1.6 ([25]). Assume that fA and satisfies

    |f(z)1|<1,

    for each zD, then f is convex in D12.

    Theorem 2.1. Let μ,β>0 and 0<r1 such that β1+2μ+1. In addition, if the following condition holds:

    H:(2β+12)μ+14,

    then the function Qμ,β(r;z) is close-to-convex in D with respect to the function log(1z).

    Proof. For the function Qμ,β(r;z), we have

    a1=1andak=k!(r2+1)μ+1((k!)β+r2)μ+1(k2).

    To prove the result, we need to show that the sequence {kak}k1 is decreasing under the given conditions. For k2 we have

    kak(k+1)ak+1=(r2+1)μ+1[kk!((k!)β+r2)μ+1(k+1)(k+1)!(((k+1)!)β+r2)μ+1]=k!(r2+1)μ+1[k((k!)β+r2)μ+1(k+1)2(((k+1)!)β+r2)μ+1]=k!(r2+1)μ+1Ak(β,μ,r)[((k!)β+r2)(((k+1)!)β+r2)]μ+1, (2.1)

    where

    Ak(β,μ,r)=k(((k+1)!)β+r2)μ+1(k+1)2((k!)β+r2)μ+1,k2.

    However, we have

    Ak(β,μ,r)=(k1μ+1((k+1)!)β+k1μ+1r2)μ+1((k+1)2μ+1(k!)β+(k+1)2μ+1r2)μ+1=exp((μ+1)log[k1μ+1((k+1)!)β+k1μ+1r2])exp((μ+1)log[(k+1)2μ+1(k!)β+(k+1)2μ+1r2])=j=0[logj(k1μ+1((k+1)!)β+k1μ+1r2)logj((k+1)2μ+1(k!)β+(k+1)2μ+1r2)](μ+1)jj!. (2.2)

    In addition, for all k2, we have

    k1μ+1((k+1)!)β+k1μ+1r2(k+1)2μ+1(k!)β+(k+1)2μ+1r2=r2(k1μ+1(k+1)2μ+1)+k1μ+1((k+1)!)β(k+1)2μ+1(k!)β[k1μ+1(k+1)2μ+1+k1μ+1((k+1)!)β2]+[k1μ+1((k+1)!)β2(k+1)2μ+1(k!)β]=k1μ+1(1+((k+1)!)β2((k+1)2k)1μ+1)+(k!)β(k1μ+1(k+1)β2(k+1)2μ+1)k1μ+1(k+1)2μ+1(1+(k!)β(k+1)21k1μ+1)+(k!)β(k+1)2μ+1(k1μ+1(k+1)21)k1μ+1(k+1)2μ+1(1+(k!)βk1μ+11k1μ+1)+(k!)β(k+1)2μ+1(k1μ+11), (2.3)

    which is positive by our assumption. Having (2.1)–(2.3), we conclude that the sequence (kak)k2 is decreasing. Finally, we see that the condition (H) implies that a12a2, then the function Qμ,β(r;z) is close-to-convex in D with respect to the function log(1z) by Lemma 1.1.

    If we set β=32 in Theorem 2.1, we derive the following result as follows:

    Corollary 2.2. Let 0<r1. If μ3, then the function Qμ,32(r;z) is close-to-convex in D with respect to the function log(1z).

    Upon setting μ=2 in Theorem 2.1, we get the following result:

    Corollary 2.3. Let 0<r1. If β53, then the function Q2,β(r;z) is close-to-convex in D with respect to the function log(1z).

    Remark 2.4. In [18], it is established that the function Qμ,2(r;z)=:Qμ(r;z) is close-to-convex in D with respect to the function z1z for all 0<rμ. Moreover, in view of Remark 1.2, we conclude that the function Qμ,2(r;z) is close-to-convex in D with respect to the function log(1z) for all 0<rμ. However, in view of Corollaries 2.2 and 2.3, we deduce that Theorem 2.1 improves the corresponding result available in [18, Theorem 5] for 0<r1.

    Theorem 2.5. Assume that μ,β>0,0<r1 such that β1+1μ+1. In addition, if the condition (H) holds, then

    (Qμ,β(r;z)z)>12,

    for all zD.

    Proof. For k1, we get

    ((k!)β+r2)μ+1(((k+1)!)β+r2)μ+1(akak+1)(r2+1)μ+1=k!(((k+1)!)β+r2)μ+1(k+1)!((k!)β+r2)μ+1=[(k!)1μ+1((k+1)!)β+r2)]μ+1[((k+1)!)1μ+1((k!)β+r2)]μ+1. (2.4)

    Further, for all k1, we have

    (k!)1μ+1((k+1)!)β+r2)((k+1)!)1μ+1((k!)β+r2)=r2[(k!)1μ+1((k+1)!)1μ+1]+(k!)1μ+1((k+1)!)β((k+1)!)1μ+1(k!)β(k!)1μ+1((k+1)!)1μ+1+(k!)1μ+1((k+1)!)β((k+1)!)1μ+1(k!)β=(k!)1μ+1[1+(k!)β(k+1)β2(k+1)1μ+1]+(k!)β+1μ+1[(k+1)β2(k+1)1μ+1](k!)1μ+1[1+(k+1)1+1μ+12(k+1)1μ+1]+(k!)β+1μ+1[(k+1)1+1μ+12(k+1)1μ+1]=(k!)1μ+1[1+(k+1)1μ+1((k+1)21)]+(k!)β+1μ+1(k+1)1μ+1((k+1)21)>0. (2.5)

    Hence, in view of (2.4) and (2.5), we deduce that the sequence (ak)k1 is decreasing. Next, we prove that (ak)k1 is a convex decreasing sequence, then, for k2 we obtain

    ((k!)β+r2)μ+1(((k+1)!)β+r2)μ+1(ak2ak+1)(r2+1)μ+1=k!(((k+1)!)β+r2)μ+12(k+1)!((k!)β+r2)μ+1=[(k!)1μ+1((k+1)!)β+r2)]μ+1[(2(k+1)!)1μ+1((k!)β+r2)]μ+1. (2.6)

    Moreover, we get

    (k!)1μ+1(((k+1)!)β+r2)(2(k+1)!)1μ+1((k!)β+r2)=r2[(k!)1μ+1(2(k+1)!)1μ+1]+(k!)1μ+1((k+1)!)β(2(k+1)!)1μ+1(k!)β>[(k!)1μ+1(2(k+1)!)1μ+1]+(k!)1μ+1((k+1)!)β3+2(k!)β+1μ+13[(k+1)β3.2μμ+1(k+1)1μ+1](k!)1μ+1[1+((k+1)!)1+1μ+13(2(k+1))1μ+1]+2(k!)β+1μ+13[(k+1)1+1μ+13.2μμ+1(k+1)1μ+1]=(k!)1μ+1[1+(k+1)1μ+1{(k+1)(k!)1+1μ+1321μ+1}]+2(k!)β+1μ+1(k+1)1μ+13[(k+1)3.2μμ+1]>2[12μμ+1](k!)β+1μ+1(k+1)1μ+1>0. (2.7)

    Keeping (2.6) and (2.7) in mind, we have ak2ak+1>0 for all k2. In addition, the condition (H) implies a12a20. This in turn implies that the sequence (ak)k1 is convex. Finally, by Lemma 1.3, we obtain the desired result.

    Taking β=32 in Theorem 2.5, we derive the following result:

    Corollary 2.6. Assume that r(0,1]. If μlog(4)log(232+1)log(2)11.14, then

    (Qμ,32(r;z)z)>12(zD).

    Setting μ=1 in Theorem 2.5, we established the following result which reads as follows:

    Corollary 2.7. Let 0<r1. If βlog(3)log(2), then

    (Q1,β(r;z)z)>12(zD).

    Remark 2.8. The result obtained in the above theorem has been derived from [18, Theorem 6] for β=2,μ>0 and 0<r<μ. Hence, in view of Corollaries 2.2 and 2.6, we deduce that Theorem 2.5 improves the corresponding result given in [18, Theorem 6] for 0<r1.

    Theorem 2.9. Assume that min(μ,β)>0,0<r1 such that β1+3μ+1, then the function Qμ,β(r;z) is starlike in D.

    Proof. We see in the proof of Theorem 2.1 that the sequence (kak)k1 is decreasing. Hence, with the aid of Lemma 1.4 to show that the function Qμ,β(r;z) is starlike in D, it suffices to prove that the sequence (kak(k+1)ak+1)k1 is decreasing. We have

    kak2(k+1)ak+1=k!(r2+1)μ+1Bk(β,μ,r)[((k!)β+r2)((k+1)!)β+r2)]μ+1, (2.8)

    where

    Bk(β,μ,r)=k(((k+1)!)β+r2)μ+12(k+1)2((k!)β+r2)μ+1,k1.

    For k2, we have

    k1μ+1(((k+1)!)β+r2)(2(k+1)2)1μ+1((k!)β+r2)k1μ+1(2(k+1)2)1μ+1+k1μ+1((k+1)!)β2+[k1μ+1((k+1)!)β2(2(k+1)2)1μ+1(k!)β]=k1μ+1+k1μ+1((k+1)!)β2(2(k+1)2)1μ+1+(k!)β(k1μ+1(k+1)β2(2(k+1)2)1μ+1)k1μ+1+(k+1)2μ+1(k1μ+1(k!)β(k+1)221μ+1)+(k!)β(k+1)2μ+1(k1μ+1(k+1)221μ+1)k1μ+1+(k+1)2μ+1(k1μ+1(k!)β21μ+1)+(k!)β(k+1)2μ+1(k1μ+121μ+1)>0, (2.9)

    which in turn implies that

    Bk(β,μ,r)>0,

    for all k2, and consequently, the sequence (kak(k+1)ak+1)k2 is decreasing. Further, a simple computation gives

    a14a2+3a3(1+r2)μ+1=1(1+r2)μ+18(2β+r2)μ+1+18(6β+r2)μ+112μ+182β(μ+1)+18(6β+r2)μ+1=2β(μ+1)2μ+42(β+1)(μ+1)+18(6β+r2)μ+12μ+42μ+42(β+1)(μ+1)+18(6β+r2)μ+1>0.

    Therefore, (kak(k+1)ak+1)k1 is decreasing, which leads us to the asserted result.

    In the next Theorem we present another set of sufficient conditions to be imposed on the parameters so that the function Qμ,β(r;z) is starlike in D.

    Theorem 2.10. Let the parameters be the same as in Theorem 2.1. In addition, if the following conditions

    H:(2β+12)μ+18(e2),

    hold true, then the function Qμ,β(r;z) is starlike in D.

    Proof. First of all, we need to prove that the sequences (uk)k2 and (vk)k2 defined by

    uk=(k!)2(r2+1)μ+1((k!)β+r2)μ+1andvk=(k1)(k!)2(r2+1)μ+1((k!)β+r2)μ+1,

    are decreasing. Indeed, we have

    ((k!)β+r2)μ+1(((k+1)!)β+r2)μ+1(ukuk+1)(k!)2(r2+1)μ+1=(((k+1)!)β+r2)μ+1(k+1)2((k!)β+r2)μ+1. (2.10)

    In addition, for any k2, we have

    ((k+1)!)β+r2(k+1)2μ+1((k!)β+r2)=r2(1(k+1)2μ+1)+((k+1)!)β(k+1)2μ+1(k!)β1(k+1)2μ+1+((k+1)!)β(k+1)2μ+1(k!)β=1+(((k+1)!)β2(k+1)2μ+1)+(((k+1)!)β2(k+1)2μ+1(k!)β)1+((k!)β(k+1)1+2μ+12(k+1)2μ+1)+(k!)β((k+1)1+2μ+12(k+1)2μ+1)=1+(k+1)2μ+1((k!)β(k+1)21)+(k!)β(k+1)2μ+1(k+121)>0. (2.11)

    According to (2.10) and (2.11) we conclude that the sequence (uk)k2 is decreasing. Also, for k2, we have

    ((k!)β+r2)μ+1(((k+1)!)β+r2)μ+1(vkvk+1)(k!)2(r2+1)μ+1=(k1)(((k+1)!)β+r2)μ+1k(k+1)2((k!)β+r2)μ+1. (2.12)

    Moreover, for all k2, we find

    (k1)1μ+1(((k+1)!)β+r2)(k(k+1)2)1μ+1((k!)β+r2)=r2((k1)1μ+1(k(k+1)2)1μ+1)+(k1)1μ+1((k+1)!)β(k(k+1)2)1μ+1(k!)β(k1)1μ+1(k(k+1)2)1μ+1+(k1)1μ+1((k+1)!)β3+2(k1)1μ+1((k+1)!)β3(k(k+1)2)1μ+1(k!)β(k1)1μ+1+(k+1)2μ+1((k1)1μ+1(k!)1+2μ+1(k+1)3k1μ+1)+(k!)β(k+1)2μ+1(2(k1)1μ+1(k+1)3k1μ+1)(k1)1μ+1+(k+1)2μ+1((k1)1μ+1(k!)1+2μ+1k1μ+1)+(k!)β(k+1)2μ+1(2(k1)1μ+1k1μ+1). (2.13)

    Since the sequence (k/(k1))n2 is decreasing, we deduce that kk12 for all k2 and consequently,

    (kk1)1μ+121μ+12(k2,μ>0).

    Hence, in view of the above inequality combined with (2.13) and (2.12), we conclude that the sequence (vk)k2 is decreasing. Now, we set

    ˜Qμ,β(r;z):=z[Qμ,β(r;z)]Qμ,β(r;z),zD.

    We see that the function ˜Qμ,β(r;z) is analytic in D and satisfies ˜Qμ,β(r;0)=1. Hence, to derive the desired result, it suffices to prove that, for any zD, we have

    (˜Qμ,β(r;z))>0.

    For this goal in view, it suffices to show that

    |˜Qμ,β(r;z)1|<1(zD).

    For all zD, we get

    |[Qμ,β(r;z)]Qμ,β(r;z)z|<k=2(k1)k!(r2+1)μ+1((k!)β+r2)μ+1=k=2vkk!v2(e2). (2.14)

    In addition, in view of the inequality:

    |a+b|||a||b||,

    we obtain

    |Qμ,β(r;z)z|>1k=2(k!)(r2+1)μ+1((k!)β+r2)μ+1=1k=2ukk!1u2(e2). (2.15)

    By using (2.14) and (2.15), for zD, we get

    |˜Qμ,β(r;z)1|=|[Qμ,β(r;z)]Qμ,β(r;z)z||Qμ,β(r;z)z|<v2(e2)1u2(e2). (2.16)

    Furthermore, by using the fact that the function rχμ,β(r)=(r2+1r2+2β)μ+1 is strictly increasing on (0,1], and with the aid of condition (H), we obtain

    (v2+u2)(e2)=8(e2)(r2+1)μ+1(2β+r2)μ+1<8(e2)(22β+1)μ+11. (2.17)

    Finally, by combining (2.16) and (2.17), we derived the desired results.

    By setting β=2 in Theorem 2.10, we obtain the following corollary:

    Corollary 2.11. If 0<r1 and μ1, then the function Qμ(r;z) defined in (1.4) is starlike in D.

    Taking β=32 in Theorem 2.10, we obtain:

    Corollary 2.12. Under the assumptions of Corollary 2.2, the function Qμ,32(r;z) is starlike in D.

    Setting in Theorem 2.10 the values μ=2, we compute the following corollary:

    Corollary 2.13. Suppose that all hypotheses of Corollary 2.3 hold, then the function Q2,β(r;z) is starlike in D.

    Example 2.14. The functions Q3,32(1/2;z) and Q2,53(1/2;z) are starlike in D.

    Figure 1 illustrates the mappings of the above examples in D.

    Figure 1.  Mappings of Qμ,β(r;z) over D.

    Theorem 2.15. Let μ,β>0 and 0<r1 such that β1+3μ+1. If the following condition

    H:(2β+12)μ+116(e2),

    holds true, then the function Qμ,β(r;z) is convex in D.

    Proof. We define the sequences (xk)k2 and (yk)k2 by

    xk=k(k!)2(r2+1)μ+1((k!)β+r2)μ+1andyk=k(k1)(k!)2(r2+1)μ+1((k!)β+r2)μ+1.

    Let k2, then

    ((k!)β+r2)μ+1(((k+1)!)β+r2)μ+1(xkxk+1)(k!)2(r2+1)μ+1=k(((k+1)!)β+r2)μ+1(k+1)3((k!)β+r2)μ+1. (2.18)

    However, we have

    k1μ+1(((k+1)!)β+r2)(k+1)3μ+1((k!)β+r2)k1μ+1(k+1)3μ+1+k1μ+1((k+1)!)β(k+1)3μ+1(k!)β=k1μ+1+(k1μ+1(k!)β(k+1)β2(k+1)3μ+1)+(k1μ+1(k!)β(k+1)β2(k+1)3μ+1(k!)β)k1μ+1+(k+1)3μ+1(k1μ+1(k!)β(k+1)21)+(k!)β(k+1)3μ+1(k1μ+1(k+1)21)>0. (2.19)

    Hence, in view of (2.18) and (2.19), we get that (xk)k2 is decreasing. Also, we have

    ((k!)β+r2)μ+1(((k+1)!)β+r2)μ+1(ykyk+1)k(k!)2(r2+1)μ+1=(k1)(((k+1)!)β+r2)μ+1(k+1)3((k!)β+r2)μ+1. (2.20)

    Moreover, for k2, we find that

    (k1)1μ+1(((k+1)!)β+r2)(k+1)3μ+1((k!)β+r2)(k1)1μ+1+((k1)1μ+1(k!)β(k+1)β2(k+1)3μ+1)+(k!)β((k1)1μ+1(n+1)β2(n+1)3μ+1)(k1)1μ+1+(k+1)3μ+1((k1)1μ+1(k!)β(k+1)21)+(k!)β(k+1)3μ+1((k1)1μ+1(k+1)21)>0. (2.21)

    Having (2.20) and (2.21) in mind, we deduce that the sequence (yk)k2 is decreasing. To show that the function Qμ,β(r;z) is convex in D, it suffices to establish that the function

    ˆQμ,β(r;z):=z[Qμ,β(r;z)],

    is starlike in D. For this objective in view, it suffices to find that

    |z[ˆQμ,β(r;z)]ˆQμ,β(r;z)1|<1(zD).

    For all zD and since (yk)k2 is decreasing, we get

    |[ˆQμ,β(r;z)]ˆQμ,β(r;z)z|<k=2k(k1)k!(r2+1)μ+1((k!)β+r2)μ+1=k=2ykk!y2(e2). (2.22)

    Further, for any zD, we obtain

    |ˆQμ,β(r;z)z|>1k=2k(k!)(r2+1)μ+1((k!)β+r2)μ+1=1k=2xkk!1x2(e2). (2.23)

    Keeping (2.22) and (2.23) in mind, for zD, we get

    |z[ˆQμ,β(r;z)]ˆQμ,β(r;z)1|=|[ˆQμ,β(r;z)]ˆQμ,β(r;z)z||ˆQμ,β(r;z)z|<y2(e2)1x2(e2)=8(e2)(r2+1)μ+1(2β+r2)μ+18(e2)(r2+1)μ+1. (2.24)

    Again, by using the fact that the function rχμ,β(r) is increasing on (0,1] and with the aid of hypothesis (H) we obtain that

    8(e2)(r2+1)μ+1(2β+r2)μ+18(e2)(r2+1)μ+1<1. (2.25)

    Finally, by combining the above inequality and (2.24), we obtain the desired result asserted by Theorem 2.15.

    Taking β=2 in Theorem 2.15, in view of (1.4), the following result holds true:

    Corollary 2.16. Let 0<r1. If μ2, then the function Qμ(r;z) is convex in D.

    If we set μ=1 in Theorem 2.15, in view of (1.5), we derive the following result:

    Corollary 2.17. Let 0<r1. If βlog(8e21)log(2), then the function Q1,β(r;z) is convex in D.

    Example 2.18. The functions Q2(r;z) and Q1,83(r;z) are convex in D.

    Figure 2 gives the mappings of the above presented examples in D.

    Figure 2.  Mappings of Qμ,β(r;z) over D.

    Theorem 2.19. Let the parameters be the same as in Theorem 2.1, then the function Qμ,β(r;z) is starlike in D12.

    Proof. For any zD we get

    |Qμ,β(r;z)z1|<k=2k!(r2+1)μ+1(k!)β+r2)μ+1=k=2ckk!, (2.26)

    where

    ck:=(k!)2(r2+1)μ+1((k!)β+r2)μ+1,k2.

    Straightforward calculation gives

    [((k!)β+r2)(((k+1)!)β+r2)]μ+1(ckck+1)(k!)2(r2+1)μ+1=(((k+1)!)β+r2)μ+1((k+1)2μ+1((k!)β+r2))μ+1. (2.27)

    Furthermore, for k2, we get

    ((k+1)!)β+r2(n+1)2μ+1((k!)β+r2)=r2(1(k+1)2μ+1)+((k+1)!)β(k!)β(k+1)2μ+1(1+((k+1)!)β2(k+1)2μ+1)+(k!)β((k+1)β2(k+1)2μ+1)(1+(k!)β(k+1)1+2μ+12(k+1)2μ+1)+(k!)β(k+1)2μ+1(k1)2(1+(k+1)2μ+1((k!)β(k+1)2)2)+(k!)β(k+1)2μ+1(k1)2>0. (2.28)

    Thus, the sequence (ck)k2 is decreasing. However, in view of (2.26), for zD we obtain

    |Qμ,β(r;z)z1|<k=2k!(r2+1)μ+1((k!)β+r2)μ+1=k=2c2k!=c2(e2)=4(e2)(r2+1)μ+1(2β+r2)μ+1. (2.29)

    According to the monotony property of the function rχβ,μ(r) on (0,1) we get

    χβ,μ(r)<14. (2.30)

    Hence, in view (2.29) and (2.30) we find for all zD that

    |Qμ,β(r;z)z1|<(e2)<1.

    With the help of Lemma 1.5, we deduce that the function Qμ,β(r;z) is starlike in D12.

    Corollary 2.20. Assume that all conditions of Corollary 2.2 are satisfied, then the function Qμ,32(r;z) is starlike in D12.

    Corollary 2.21. Suppose that all hypotheses of Corollary 2.3 hold, then the function Q2,β(r;z) is starlike in D12.

    If we set β=2 in the above Theorem, in view of (1.4), the following result is true:

    Corollary 2.22. Let 0<r1 If μ1, then the function Qμ(r;z) is starlike in D12.

    Example 2.23. The functions Q3,32(1/2;z),Q1(1;z) and Q2,53(1/2;z) are starlike in D12.

    In Figure 3, we give the mappings of the above presented examples in D.

    Figure 3.  Mappings of Qμ,β(r;z) over D12.

    Theorem 2.24. Let β,μ>0 and 0<r<1. If β1+3μ+1, then the function Qμ,β(r;z) is convex in D12.

    Proof. For all zD, it follows that

    |Qμ,β(r;z)1|<k=2kk!(r2+1)μ+1((k!)β+r2)μ+1=k=2dkk(k1), (2.31)

    where

    dk:=k2(k1)k!(r2+1)μ+1(k!)β+r2)μ+1,k2.

    For all k2, we get

    ((k!)β+r2)μ+1(((k+1)!)β+r2)μ+1(dkdk+1)kk!(1+r2)μ+1=((k(k1))1μ+1[((k+1)!)β+r2])μ+1(((k+1))3μ+1[(k!)β+r2])μ+1. (2.32)

    However, for all k2 and under the conditions imposed on the parameters, we have

    (k(k1))1μ+1[((k+1)!)β+r2]((k+1))3μ+1[(k!)β+r2](k(k1))1μ+1((k+1))3μ+1+(k(k1))1μ+1((k+1)!)β(k+1)3μ+1(k!)β=(k(k1))1μ+1+((k(k1))1μ+1(k!)β(k+1)β2(k+1)3μ+1)+(k!)β((k(k1))1μ+1(k+1)β2(k+1)3μ+1)(k(k1))1μ+1+(n+1)3μ+1((k(k1))1μ+1(k!)β(k+1)21)+(k!)β(k+1)3μ+1((k(k1))1μ+1(k+1)21)(k(k1))1μ+1+(k+1)3μ+1((k(k1))1μ+1(k!)β1)+(k!)β(k+1)3μ+1((k(k1))1μ+11)>0. (2.33)

    Hence, in view of (2.32) and (2.33) we conclude that the sequence (dk)k2 is decreasing. Therefore, by (2.31), we conclude

    |Qμ,β(r;z)1|<k2d2k(k1)=d2. (2.34)

    Moreover, since β1+3μ+1 and r(0,1], we get

    (r2+1r2+2β)μ+118,

    and consequently, for all zD, we obtain

    |Qμ,β(r;z)1|<1. (2.35)

    Finally, with the means of Lemma 1.6, we conclude that the function Qμ,β(r;z) is convex in D12.

    If we take β=2 in Theorem 2.15, in view of (1.4), the following result holds true:

    Corollary 2.25. Let 0<r1. If μ2, then the function Qμ(r;z) is convex in D12.

    If we let μ=1 in Theorem 2.15, in view of (1.5), we derive the following result:

    Corollary 2.26. Let 0<r1. If β52, then the function Q1,β(r;z) is convex in D12.

    Example 2.27. The functions Q2(r;z) and Q1,52(r;z) are convex in D12.

    In Figure 4, we present the mappings of these examples in D.

    Figure 4.  Mappings of Qμ,β(r;z) over D12.

    Remark 2.28. The geometric properties of the function Qμ(r;z) derived in Corollaries 2.16, 2.22 and 2.25 are new.

    In our present paper, we have derived sufficient conditions such that a class of functions associated to the generalized Mathieu type power series are to be starlike, close-to-convex and convex in the unit disk D. The various results, which we have established in this paper, are believed to be new, and their importance is illustrated by several interesting corollaries and examples. Furthermore, we are confident that our paper will inspire further investigation in this field and pave the way for some developments in the study of geometric functions theory involving certain classes of functions related to the Mathieu type powers series.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors extend their appreciation to the Deanship of Scientific Research at Northern Border University, Arar, KSA for funding this research work through the project number "NBU-FFR-2023-0093".

    The authors declare that they have no conflicts of interest.



    [1] A. Agra, C. Requejo, F. Rodrigues, An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem, Networks, 72 (2018), 5–24. https://doi.org/10.1002/net.21796 doi: 10.1002/net.21796
    [2] I. Aravena, A. Papavasiliou, Asynchronous Lagrangian scenario decomposition, Math. Program. Comput., 13 (2021), 1–50. https://doi.org/10.1007/s12532-020-00185-4 doi: 10.1007/s12532-020-00185-4
    [3] O. Balyk, K. S Andersen, S. Dockweiler, M. Gargiulo, K. Karlsson, R. Næraa, et al., TIMES-DK: technology-rich multi-sectoral optimisation model of the Danish energy system, Energy Strategy Rev., 23 (2019), 13–22. https://doi.org/10.1016/j.esr.2018.11.003 doi: 10.1016/j.esr.2018.11.003
    [4] J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numer. Math., 4 (1962), 238–252.
    [5] A. Berkelaar, C. Dert, B. Oldenkamp, S. Zhang, A primal-dual decomposition-based interior point approach to two-stage stochastic linear programming, Oper. Res., 50 (2002), 904–915. https://doi.org/10.1287/opre.50.5.904.360 doi: 10.1287/opre.50.5.904.360
    [6] J. R. Birge, F. V. Louveaux, A multicut algorithm for two-stage stochastic linear programs, Eur. J. Oper. Res., 34 (1988), 384–392. https://doi.org/10.1016/0377-2217(88)90159-2 doi: 10.1016/0377-2217(88)90159-2
    [7] C. Böhringer, The synthesis of bottom-up and top-down in energy policy modeling, Energy Econ., 20 (1998), 233–248. https://doi.org/10.1016/S0140-9883(97)00015-7 doi: 10.1016/S0140-9883(97)00015-7
    [8] S. S. Dey, M. Molinaro, Q. Wang, Analysis of sparse cutting planes for sparse MILPs with applications to stochastic MILPs, Math. Oper. Res., 43 (2018), 304–332. https://doi.org/10.1287/moor.2017.0866 doi: 10.1287/moor.2017.0866
    [9] S. Di Leo, F. Pietrapertosa, S. Loperte, M. Salvia, C. Cosmi, Energy systems modelling to support key strategic decisions in energy and climate change at regional scale, Renew. Sust. Energy Rev., 42 (2015), 394–414. https://doi.org/10.1016/j.rser.2014.10.031 doi: 10.1016/j.rser.2014.10.031
    [10] R. K. Dutkiewicz, International symposium on electricity, health and the environment, Cap Town: Energy Research Institute, University of Cape Town, 1995.
    [11] L. F. Escudero, M. Garın, G. Perez, A. Unzueta, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, Top, 20 (2012), 347–374. https://doi.org/10.1007/s11750-011-0237-1 doi: 10.1007/s11750-011-0237-1
    [12] X. Feng, S. Di Cairano, R. Quirynen, Inexact adjoint-based SQP algorithm for real-time stochastic nonlinear MPC, IFAC-PapersOnLine, 53 (2020), 6529–6535. https://doi.org/10.1016/j.ifacol.2020.12.068 doi: 10.1016/j.ifacol.2020.12.068
    [13] Y. Fu, G. Huang, L. Liu, M. Zhai, A factorial CGE model for analyzing the impacts of stepped carbon tax on Chinese economy and carbon emission, Sci. Total Environ., 759 (2021), 143512. https://doi.org/10.1016/j.scitotenv.2020.143512 doi: 10.1016/j.scitotenv.2020.143512
    [14] Documentation for the TIMES Model Part Ⅳ, Energy Technology Systems Analysis Programme, 2016. Available from: https://iea-etsap.org/docs/Documentation_for_the_TIMES_Model-Part-IV_October-2016.pdf.
    [15] M. Guignard, S. Kim, Lagrangian decomposition: A model yielding stronger lagrangian relaxation bounds, Math. Program., 39 (1993), 215–228. https://doi.org/10.1007/BF02592954 doi: 10.1007/BF02592954
    [16] R. Horst, P. M. Pardalos, N. Van Thoai, Introduction to global optimization, Springer Science & Business Media, 2000.
    [17] C. S. Ioakimidis, K. N. Genikomsakis, Integration of seawater pumped-storage in the energy system of the Island of Sao Miguel (Azores), Sustainability, 10 (2018), 3438. https://doi.org/10.3390/su10103438 doi: 10.3390/su10103438
    [18] Y. Jia, R. Liu, Analysis of Beijing energy saving and emission reduction strategy based on times model, J. Basic Sci. Eng., 21 (2013), 857–865.
    [19] R. Kanala, E. Fragniere, Mixing behavioral and technological data in mathematical programming framework, In: Operations Research Proceedings 2012, Springer, 2014,163–168. https://doi.org/10.1007/978-3-319-00795-3_24
    [20] A. Kanudia, R. Loulou, Robust responses to climate change via stochastic MARKAL: The case of Quebec, Eur. J. Oper. Res., 106 (1998), 15–30. https://doi.org/10.1016/S0377-2217(98)00356-7 doi: 10.1016/S0377-2217(98)00356-7
    [21] K. Kim, V. M. Zavala, Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs, Math. Program. Comput., 10 (2018), 225–266. https://doi.org/10.1007/s12532-017-0128-z doi: 10.1007/s12532-017-0128-z
    [22] A. J. Kleywegt, A. Shapiro, T. Homem-de Mello, The sample average approximation method for stochastic discrete optimization, SIAM J. Optim., 12 (2002), 479–502. https://doi.org/10.1137/S1052623499363220 doi: 10.1137/S1052623499363220
    [23] D. Kuhn, P. M. Esfahani, V. A. Nguyen, S. Shafieezadeh-Abadeh, Wasserstein distributionally robust optimization: Theory and applications in machine learning, Operations Research & Management Science in the Age of Analytics, 2019,130–166. https://doi.org/10.1287/educ.2019.0198
    [24] T. Larsson, C. O. Wene, Developing strategies for robust energy systems. Ⅰ: Methodology, Int. J. Energy Res., 17 (1993), 503–513. https://doi.org/10.1002/er.4440170606 doi: 10.1002/er.4440170606
    [25] P. Li, I. Keppo, N. Strachan, Incorporating homeowners' preferences of heating technologies in the UK TIMES model, Energy, 148 (2018), 716–727. https://doi.org/10.1016/j.energy.2018.01.150 doi: 10.1016/j.energy.2018.01.150
    [26] J. Liu, W. Chen, D. Liu, China's low carbon energy development strategy based on china times model system, J. Tsinghua Univ., 51 (2011), 525–529.
    [27] R. Loulou, M. Labriet, ETSAP-TIAM: The TIMES integrated assessment model Part Ⅰ: Model structure, Comput. Manag. Sci., 5 (2008), 7–40. https://doi.org/10.1007/s10287-007-0046-z doi: 10.1007/s10287-007-0046-z
    [28] Documentation for the TIMES Model Part Ⅰ, Energy Technology Systems Analysis Programme, 2016. Available from: https://iea-etsap.org/docs/Documentation_for_the_TIMES_Model-Part-I_July-2016.pdf.
    [29] Documentation for the TIMES Model Part Ⅱ, Energy Technology Systems Analysis Programme, 2016. Available from: https://iea-etsap.org/docs/Documentation_for_the_TIMES_Model-Part-II_July-2016.pdf.
    [30] M. J. Mayer, A. Szilágyi, G. Gróf, Environmental and economic multi-objective optimization of a household level hybrid renewable energy system by genetic algorithm, Appl. Energy, 269 (2020), 115058. https://doi.org/10.1016/j.apenergy.2020.115058 doi: 10.1016/j.apenergy.2020.115058
    [31] W. McDowall, B. S. Rodriguez, A. Usubiaga, J. A. Fernández, Is the optimal decarbonization pathway influenced by indirect emissions? Incorporating indirect life-cycle carbon dioxide emissions into a European TIMES model, J. Clean. Prod., 170 (2018), 260–268. https://doi.org/10.1016/j.jclepro.2017.09.132 doi: 10.1016/j.jclepro.2017.09.132
    [32] S. Pfenninger, A. Hawkes, J. Keirstead, Energy systems modeling for twenty-first century energy challenges, Renew. Sust. Energy Rev., 33 (2014), 74–86. https://doi.org/10.1016/j.rser.2014.02.003 doi: 10.1016/j.rser.2014.02.003
    [33] B. T. Polyak, Introduction to optimization, New York: Optimization Software Inc., Publications Division, 1987.
    [34] L. Qi, R. S. Womersley, An SQP algorithm for extended linear-quadratic problems in stochastic programming, Ann. Oper. Res., 56 (1995), 251–285. https://doi.org/10.1007/BF02031711 doi: 10.1007/BF02031711
    [35] W. Romeijnders, N. van der Laan, Pseudo-valid cutting planes for two-stage mixed-integer stochastic programs with right-hand-side uncertainty, Oper. Res., 68 (2020), 1199–1217. https://doi.org/10.1287/opre.2019.1905 doi: 10.1287/opre.2019.1905
    [36] A. M. Rush, M. J. Collins, A tutorial on dual decomposition and Lagrangian relaxation for inference in natural language processing, J. Artif. Intell. Res., 45 (2012), 305–362. https://doi.org/10.1613/jair.3680 doi: 10.1613/jair.3680
    [37] A. Schaefer, H. D. Jacoby, Technology detail in a multisector CGE model: Transport under climate policy, Energy Econ., 27 (2005), 1–24. https://doi.org/10.1016/j.eneco.2004.10.005 doi: 10.1016/j.eneco.2004.10.005
    [38] G. S. Seck, V. Krakowski, E. Assoumou, N. Maïzi, V. Mazauric, Embedding power system's reliability within a long-term Energy System Optimization Model: Linking high renewable energy integration and future grid stability for France by 2050, Appl. Energy, 257 (2020), 114037. https://doi.org/10.1016/j.apenergy.2019.114037 doi: 10.1016/j.apenergy.2019.114037
    [39] T. Schulze, Stochastic programming for hydro-thermal unit commitment, PhD's Thesis, The University of Edinburgh, 2015.
    [40] A. J. Seebregts, G. A. Goldstein, K. Smekens, Energy/environmental modeling with the MARKAL family of models, In: Operations Research Proceedings 2001, Springer, 2002, 75–82. https://doi.org/10.1007/978-3-642-50282-8_10
    [41] G. Tian, Z. Wu, Y. Hu, Calculation of optimal tax rate of water resources and analysis of social welfare based on CGE model: A case study in Hebei Province, China, Water Policy, 23 (2021), 96–113. https://doi.org/10.2166/wp.2020.118 doi: 10.2166/wp.2020.118
    [42] A Scottish TIMES Model: An Overview, The Scottish Government for the Environment, Climate Change and Land Reform Committee, 2016. Available from: https://archive2021.parliament.scot/S5_Environment/General%20Documents/20160922_Scottish_TIMES_model_-_an_overview.pdf.
    [43] UK TIMES Model Overview, UCL Energy Institute, 2014. Available from: https://www.ucl.ac.uk/drupal/site_energy-models/sites/energy-models/files/uk-times-overview.pdf.
    [44] Review of the Scottish TIMES Energy System Model, University College London, 2021. Available from: https://era.ed.ac.uk/handle/1842/37509.
    [45] R. M. Van Slyke, R. Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM J. Appl. Math., 17 (1969), 638–663. https://doi.org/10.1137/0117061 doi: 10.1137/0117061
    [46] Y. Wang, Y. Wang, Y. Huang, F. Li, M. Zeng, J. Li, et al., Planning and operation method of the regional integrated energy system considering economy and environment, Energy, 171 (2019), 731–750. https://doi.org/10.1016/j.energy.2019.01.036 doi: 10.1016/j.energy.2019.01.036
    [47] Y. Zhang, M. Hong, J. Li, J. Ren, Y. Man, Energy system optimization model for tissue papermaking process, Comput. Chem. Eng., 146 (2021), 107220. https://doi.org/10.1016/j.compchemeng.2020.107220 doi: 10.1016/j.compchemeng.2020.107220
    [48] Z. X. Zhang, Can china afford to commit itself an emissions cap? An economic and political analysis, Energy Econ., 22 (2000), 587–614. https://doi.org/10.1016/S0140-9883(00)00048-7 doi: 10.1016/S0140-9883(00)00048-7
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2215) PDF downloads(97) Cited by(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog