Processing math: 100%
Research article Special Issues

Monitoring river water quality through predictive modeling using artificial neural networks backpropagation

  • Predicting river water quality in the Special Region of Yogyakarta (DIY) is crucial. In this research, we modeled a river water quality prediction system using the artificial neural network (ANN) backpropagation method. Backpropagation is one of the developments of the multilayer perceptron (MLP) network, which can reduce the level of prediction error by adjusting the weights based on the difference in output and the desired target. Water quality parameters included biochemical oxygen demand (BOD), chemical oxygen demand (COD), total suspended solids (TSS), dissolved oxygen (DO), total phosphate, fecal coliforms, and total coliforms. The research object was the upstream, downstream, and middle parts of the Oya River. The data source was secondary data from the DIY Environment and Forestry Service. Data were in the form of time series data for 2013–2023. Descriptive data results showed that the water quality of the Oya River in 2020–2023 was better than in previous years. However, increasing community and industrial activities can reduce water quality. This was concluded based on the prediction results of the ANN backpropagation method with a hidden layer number of 4. The prediction results for period 3 in 2023 and period 1 in 2024 are that 1) the concentrations of BOD, fecal coli, and total coli will increase and exceed quality standards, 2) COD and TSS concentrations will increase but will still be below quality standards, 3) DO and total phosphate concentrations will remain constant and still on the threshold of quality standards. The possibility of several water quality parameters increasing above the quality standards remains, so the potential for contamination of the Oya River is still high. Therefore, early prevention of river water pollution is necessary.

    Citation: Muhammad Andang Novianta, Syafrudin, Budi Warsito, Siti Rachmawati. Monitoring river water quality through predictive modeling using artificial neural networks backpropagation[J]. AIMS Environmental Science, 2024, 11(4): 649-664. doi: 10.3934/environsci.2024032

    Related Papers:

    [1] Luigi Montoro, Berardino Sciunzi . Qualitative properties of solutions to the Dirichlet problem for a Laplace equation involving the Hardy potential with possibly boundary singularity. Mathematics in Engineering, 2023, 5(1): 1-16. doi: 10.3934/mine.2023017
    [2] Juan-Carlos Felipe-Navarro, Tomás Sanz-Perela . Semilinear integro-differential equations, Ⅱ: one-dimensional and saddle-shaped solutions to the Allen-Cahn equation. Mathematics in Engineering, 2021, 3(5): 1-36. doi: 10.3934/mine.2021037
    [3] Francesca G. Alessio, Piero Montecchiari . Gradient Lagrangian systems and semilinear PDE. Mathematics in Engineering, 2021, 3(6): 1-28. doi: 10.3934/mine.2021044
    [4] Filippo Gazzola, Gianmarco Sperone . Remarks on radial symmetry and monotonicity for solutions of semilinear higher order elliptic equations. Mathematics in Engineering, 2022, 4(5): 1-24. doi: 10.3934/mine.2022040
    [5] Elena Beretta, M. Cristina Cerutti, Luca Ratti . Lipschitz stable determination of small conductivity inclusions in a semilinear equation from boundary data. Mathematics in Engineering, 2021, 3(1): 1-10. doi: 10.3934/mine.2021003
    [6] Huyuan Chen, Laurent Véron . Weak solutions of semilinear elliptic equations with Leray-Hardy potentials and measure data. Mathematics in Engineering, 2019, 1(3): 391-418. doi: 10.3934/mine.2019.3.391
    [7] Marco Cirant, Kevin R. Payne . Comparison principles for viscosity solutions of elliptic branches of fully nonlinear equations independent of the gradient. Mathematics in Engineering, 2021, 3(4): 1-45. doi: 10.3934/mine.2021030
    [8] Yuzhe Zhu . Propagation of smallness for solutions of elliptic equations in the plane. Mathematics in Engineering, 2025, 7(1): 1-12. doi: 10.3934/mine.2025001
    [9] Antonio Greco, Francesco Pisanu . Improvements on overdetermined problems associated to the p-Laplacian. Mathematics in Engineering, 2022, 4(3): 1-14. doi: 10.3934/mine.2022017
    [10] Italo Capuzzo Dolcetta . The weak maximum principle for degenerate elliptic equations: unbounded domains and systems. Mathematics in Engineering, 2020, 2(4): 772-786. doi: 10.3934/mine.2020036
  • Predicting river water quality in the Special Region of Yogyakarta (DIY) is crucial. In this research, we modeled a river water quality prediction system using the artificial neural network (ANN) backpropagation method. Backpropagation is one of the developments of the multilayer perceptron (MLP) network, which can reduce the level of prediction error by adjusting the weights based on the difference in output and the desired target. Water quality parameters included biochemical oxygen demand (BOD), chemical oxygen demand (COD), total suspended solids (TSS), dissolved oxygen (DO), total phosphate, fecal coliforms, and total coliforms. The research object was the upstream, downstream, and middle parts of the Oya River. The data source was secondary data from the DIY Environment and Forestry Service. Data were in the form of time series data for 2013–2023. Descriptive data results showed that the water quality of the Oya River in 2020–2023 was better than in previous years. However, increasing community and industrial activities can reduce water quality. This was concluded based on the prediction results of the ANN backpropagation method with a hidden layer number of 4. The prediction results for period 3 in 2023 and period 1 in 2024 are that 1) the concentrations of BOD, fecal coli, and total coli will increase and exceed quality standards, 2) COD and TSS concentrations will increase but will still be below quality standards, 3) DO and total phosphate concentrations will remain constant and still on the threshold of quality standards. The possibility of several water quality parameters increasing above the quality standards remains, so the potential for contamination of the Oya River is still high. Therefore, early prevention of river water pollution is necessary.



    Recently, several extensions and generalizations have been considered for classical convexity. Strongly convex functions were introduced and studied by Polyak [45], which play an important part in the optimization theory and related areas. Karmardian [15] used the strongly convex functions to discuss the unique existence of a solution of the nonlinear complementarity problems. Strongly convex functions are used to investigate the convergence analysis for solving variational inequalities and equilibrium problems, see Zu and Marcotte [51]. See also Nikodem and Pales [20] and Qu and Li [46]. Awan et al. [7,8,9] have derived Hermite-Hadamard type inequalities, which provide upper and lower estimate for the integrand. For more applications and properties of the strongly convex functions. See, for example, [1,2,4,9,10,14,15,16,18,19,20,25,29,30,33,34,35,40,42,45,46,52].

    Hanson [13] introduced the concept of invex function for the differentiable functions, which played significant part in the mathematical programming. Ben-Israel and Mond [11] introduced the concept of invex set and preinvex functions. It is known that the differentiable preinvex function are invex functions. The converse also holds under certain conditions, see [17]. Noor [22] proved that the minimum of the differentiable preinvex functions on the invex set can be characterized the variational-like inequality. Noor [26,27,28] proved that a function f is preinvex function, if and only if, it satisfies the Hermite-Hadamard type integral inequality. Noor et al. [29,30,31,37,38,39] investigated the applications of the strongly preinvex functions and their variant forms. See also [48,49,50] and the references therein.

    It is known that more accurate and inequalities can be obtained using the logarithmically convex functions than the convex functions. Closely related to the log-convex functions, we have the concept of exponentially convex(concave) functions, the origin of exponentially convex functions can be traced back to Bernstein [12]. Avriel [6] introduced and studied the concept of r-convex functions, where as the (r,p)-convex functions were studied by Antczak [3]. For further properties of the r-convex functions, see Zhao et al. [51] and the references therein. Exponentially convex functions have important applications in information theory, big data analysis, machine learning and statistic. See [2,3,5,6,41] and the references therein. Noor and Noor [32,33,34] considered the concept of exponentially convex functions and discussed the basic properties. It is worth mentioning that these exponentially convex functions [13,14,15] are distinctly different from the exponentially convex functions considered and studied by Bernstein [12], Awan et al. [7] and Pecaric et al. [43,44]. We would like to point out that The definition of exponential convexity in Noor and Noor [32,33,34] is quite different from Bernstein [12]. Noor and Noor [36] studied the properties of the exponentially preinvex functions and their variant forms. They have shown that the exponentially preinvex functions enjoy the same interesting properties which exponentially convex functions have. See [32,33,34] and the references therein for more details.

    Inspired by the research work going in this field, we introduce and consider some new classes of nonconvex functions with respect to an arbitrary non-negative function and arbitrary bifunction, which is called the strongly exponentially generalized preinvex functions. Several new concepts of monotonicity are introduced. We establish the relationship between these classes and derive some new results under some mild conditions. Optimality conditions for differentiable strongly exponentially generalized preinvex functions are investigated. As special cases, one can obtain various new and refined versions of known results. It is expected that the ideas and techniques of this paper may stimulate further research in this field.

    Let Kη be a nonempty closed set in a real Hilbert space H. We denote by , and be the inner product and norm, respectively. Let F:KηR be a continuous function and η(.,.):Kη×KηR be an arbitrary continuous bifunction. Let ξ(.) be a non-negative function.

    Definition 2.1 ([11]).The set Kη in H is said to be invex set with respect to an arbitrary bifunction η(,), if

    u+λη(v,u)Kη,u,vKη,λ[0,1].

    The invex set Kη is also called η-connected set. If η(v,u)=vu, then the invex set Kη is a convex set, but the converse is not true. For example, the set Kη=R(12,12) is an invex set with respect to η, where

    η(v,u)={vu,forv>0,u>0orv<0,u<0uv,forv<0,u>0orv<0,u<0.

    It is clear that Kη is not a convex set.

    We now introduce some new classes of strongly exponentially preinvex functions.

    Definition 2.2. The function F on the invex set Kη is said to be strongly exponentially generalized preinvex with respect to the bifunction ξ(.), if there exists a constant μ>0, such that

    eF(u+λη(v,u))(1λ)eF(u)+λeF(v)μλ(1λ)ξ(η(v,u)),u,vKη,λ[0,1].

    The function F is said to be strongly exponentially generalized preconcave, if and only if, F is strongly exponentially generalized preinvex. Note that every strongly exponentially generalized convex function is a strongly exponentially generalized preinvex, but the converse is not true.

    We now discuss some special cases of the strongly exponentially preinvex functions:

    I. If h(η(v,u))=∥η(v,u)2, then the strongly exponentially generalized preinvex function becomes strongly generalized preinvex functions, that is,

    eF(u+λη(v,u))(1λ)eF(u)+λeF(v)μλ(1λ)η(v,u)2,u,vKη,λ[0,1].

    For the properties of the strongly preinvex functions in variational inequalities and equilibrium problems, see Noor [29,30,31].

    II. If η(v,u)=vu, then Definition 2.2 becomes:

    Definition 2.3. The function F on the convex set K is said to be strongly exponentially generalized convex with respect to a non-negative function ξ(.), if there exists a constant μ>0, such that

    eF(u+λ(vu))(1λ)eF(u)+λeF(v)μλ(1λ)ξ(vu)),u,vK,λ[0,1].

    III. If ξ(η(v,u))=W(v,u), where W(v,u) is any arbitrary bifunction, then Definition 2.2 becomes:

    Definition 2.4. The function F on the convex set K is said to be strongly exponentially generalized convex with respect to a non-negative bifunction W(.,.), if there exists a constant μ>0, such that

    eF(u+λ(vu))(1λ)eF(u)+λeF(v)μλ(1λ)W(v,u),u,vK,λ[0,1],

    which has been studied by Noor [21].

    In brief, for appropriate choice of the arbitrary function ξ(.) and the bifunction η(.,.), one can obtain a wide class of exponentially preinvex convex functions and their variant forms, see Noor and Noor [33,34].

    Definition 2.5. The function F on the invex set Kη is said to be strongly exponentially affine generalized preinvex with respect to the bifunction ξ(.), if there exists a constant μ>0, such that

    eF(u+λη(v,u))=(1λ)eF(u)+λeF(v)μλ(1λ)ξ(η(v,u)),u,vKη,ξ[0,1].

    If t=12, then the function F satisfies

    eF(2u+η(v,u)2)=12{eF(u)+eF(v)}14μξ(η(v,u)),u,vKη,

    and is called strongly exponentially affine Jensen generalized preinvex function.

    Definition 2.6. The function F on the invex set Kη is said to be strongly exponentially generalized quasi preinvex with respect to a non-negative bifunction ξ(.), if there exists a constant μ>0 such that

    eF(u+λη(v,u))max{eF(u),eF(v)}μλ(1λ)ξ(η(v,u)),u,vKη,λ[0,1].

    Definition 2.7. The function F on the invex set Kη is said to be strongly exponentially generalized log-preinvex with respect to ξ(.), if there exists a constant μ>0 such that

    eF(u+λη(v,u))(eF(u))1λ(eF(v))λμλ(1λ)ξ(η(v,u)),u,vKη,λ[0,1],

    where F()>0.

    From the above definition, we have

    eF(u+tη(v,u))(eF(u))1t(eF(v))tμλ(1λ)ξ(η(v,u))(1t)eF(u)+teF(v)μλ(1λ)ξ(η(v,u))max{eF(u),eF(v)}μλ(1λ)ξ(η(v,u)).

    It is observed that every strongly exponentially generalized log-preinvex function is strongly exponentially generalized preinvex function and every strongly exponentially generalized preinvex function is a strongly exponentially generalized quasi-preinvex function. However, the converse is not true.

    For λ=1, Definitions 2.2 and 2.7 reduce to the following condition.

    Condition A.

    eF(u+η(v,u))eF(v),u,vKη.

    Definition 2.8. The differentiable function F on the invex set Kη is said to be strongly exponentially generalized invex function with respect to an arbitrary non-negative function ξ(.) and the bifunction η(,), if there exists a constant μ>0 such that

    eF(veF(u)eF(u)F(u),η(v,u)+μξ(η(v,u)),u,vKη,

    where F(u)), is the differential of F at u.

    Remark 2.1. If μ=0, then the Definitions 2.2–2.7 reduce to the ones in Noor nd Noor [36].

    Definition 2.9. A differential operator F:KH is said to be:

    1. strongly exponentially generalized η-monotone, iff, there exists a constant α>0 such that

    eF(u)F(u),η(v,u)+eF(v)F(v),η(u,v)α{ξ(η(v,u))+ξ(η(u,v))},u,vKη.

    2. exponetiallyη-monotone, iff,

    eF(u)F(u),η(v,u)+eF(v)F(v),η(u,v)0,u,vKη.

    3. strongly exponentially generalized η-pseudomonotone, iff, there exists a constant ν>0 such that

    eF(u)F(u),η(v,u)+νξ(η(v,u))0eF(v)F(v),η(u,v)0,u,vKη.

    4. strongly exponentially relaxed generalized η-pseudomonotone, iff, there exists constant μ>0 such that

    eF(u)F(u),η(v,u)0eF(v)F(v),η(u,v)+μξ(η(u,v))0,u,vKη.

    5. strictly exponentially η-monotone, iff,

    eF(u)F(u),η(v,u)+eF(v)F(v),η(u,v)<0,u,vKη.

    6. exponentially η-pseudomonotone, iff,

    eF(u)F(u),η(v,u)0eF(v)F(v),η(u,v)0,u,vKη.

    7. exponentially quasi η-monotone, iff,

    eF(u)F(u),η(v,u)>0eF(v)F(v),η(u,v)0,u,vKη.

    8. strictly exponentially η-pseudomonotone, iff,

    eF(u)F(u),η(v,u)0eF(v)F(v),η(u,v)<0,u,vKη.

    Definition 2.10. A differentiable function F on the invex set Kη is said to be strongly exponentially pseudo generalized η-invex function, iff, if there exists a constant μ>0 such that

    eF(u)F(u),η(v,u)+μh(η(u,v))0eF(v)eF(u)0,u,vKη.

    Definition 2.11. A differentiable function F on Kη is said to be strongly exponentially generalized quasi-invex function, iff, if there exists a constant μ>0 such that

    eF(v)eF(u)eF(u)F(u),η(v,u)+μξ(η(u,v))0,u,vKη.

    Definition 2.12. The function F on the set Kη is said to be exponentially pseudo-invex, if

    eF(u)F(u),η(v,u)0eF(v)eF(u),u,vKη.

    Definition 2.13. The differentiable function F on the Kη is said to be exponentially quasi-invex function, if such that

    eF(v)eF(u)eF(u)F(u),η(v,u)0,u,vKη.

    If η(v,u)=η(v,u),u,vK, then Definitions 2.9–2.13 reduce to the known ones. All these new concepts may play important and fundamental part in the mathematical programming and optimization.

    We also need the following assumption regarding the bifunction η(,), which plays an important in the derivation of the main results.

    Condition C [17]. Let η(,):Kη×KηH satisfy thw assumptions

    η(u,u+λη(v,u))=λη(v,u)η(v,u+λη(v,u))=(1λ)η(v,u),u,vKη,λ[0,1].

    Through out this section we assume that the non-negative function ξ is even and homogeneous of degree two, that is, ξ(u)=ξ(u),ξ(γu)=γ2ξ(u),uKη,γR, unless otherwise specified.

    Theorem 3.1. Let F be a differentiable function on the invex set Kη in H and Condition C hold. Let the function ξ be even and exponentially homogeneous of degree 2. If the function F is strongly exponentially generalized preinvex function, if and only if. F is a strongly exponentially generalized invex function.

    Proof. Let F be a strongly exponentially generalized preinvex function. Then

    eF(u+λη(v,u))(1λ)eF(u)+λeF(v)λ(1λ)μξ(η(v,u)),u,vKη,

    which can be written as

    eF(v)eF(u){eF(u+λη(v,u))eF(u)λ}+(1λ)μξ(η(v,u)).

    Taking the limit in the above inequality as λ0, we have

    eF(v)eF(u)eF(u)F(u),η(v,u))+μξ(η(v,u)).

    This shows that F is a strongly exponentially generalized invex function.

    Conversley, let F be a strongly exponentially generalized invex function on the invex set Kη. Then u,vKη,λ[0,1], vλ=u+λη(v,u)Kη, using Condition C and the fact that the function ξ is even and exponentially homogeneous of degree 2, we have

    eF(v)eF(u+λη(v,u))eF(u+λη(v,u))F(u+λη(v,u)),η(v,u+λη(v,u))+μξ(η(v,u+tη(v,u)))=(1λ)eF(u+λη(v,u))F(u+λη(v,u)),η(v,u)+μ(1λ)2ξ(η(v,u)). (3.1)

    In a similar way, we have

    eF(u)eF(u+λη(v,u))eF(u+λη(v,u))F(u+λη(v,u)),η(u,u+λη(v,u))+μξ(η(u,u+ξη(v,u)))=λeF(u+λη(v,u))F(u+λη(v,u)),η(v,u)+μλ2ξ(η(v,u)). (3.2)

    Multiplying (3.1) by λ and (3.2) by (1λ) and adding the resultant, we have

    eF(u+λη(v,u))(1λ)eF(u)+λeF(v)λ(1λ)μξ(η(v,u).

    Theorem 3.2. Let F be differentiable on the invex set Kη and let Condition A and Condition C Hold. Let the function ξ be an even and exponentially homogeneous of degree 2. The function F is a strongly exponentially generalized invex function, if and only if, F is strongly exponentially generalized η-monotone.

    Proof. Let F be a strongly exponentially generalized invex function on the invex set Kη. Then

    eF(v)eF(u)eF(u+λη(v,u))F(u),η(v,u)+μξ(η(v,u))u,vKη. (3.3)

    Changing the role of u and v in (3.3), we have

    eF(u)eF(v)eF(v)F(v),η(u,v)+μξ(η(u,v))u,vKη. (3.4)

    Adding (3.3) and (3.4), we have

    eF(u)F(u),η(v,u))+eF(v)F(v),η(u,v)μ{ξ(η(v,u))+ξ(η(u,v))}, (3.5)

    which shows that F is strongly exponentially generalized η-monotone.

    Conversely, let F be strongly exponentially generalized η-monotone. From (3.5), we have

    eF(v)F(v),η(u,v)eF(u)F(u),η(v,u)){ξ(η(v,u))+ξ(η(u,v))}, (3.6)

    Since Kη is an invex set, u,vKη, t[0,1] vλ=u+λη(v,u)Kη. Taking v=vλ in (3.6), using Condition C and the fact that the function h is even and exponentially homogeneous of degree 2, we have

    eF(vλ)F(vλ),η(u,u+tη(v,u))eF(u)F(u),η(u+λη(v,u),u))μ{ξ(η(u+λη(v,u),u))+ξ(η(u,u+λη(v,u)))}=λeF(u)F(u),η(v,u)2λ2μξ(η(v,u)),

    which implies that

    eF(vλ)F(vλ),η(v,u)eF(u)F(u),η(v,u)+2μλξ(η(v,u)). (3.7)

    Let

    φ(λ)=eF(u+λη(v,u)). (3.8)

    Then

    φ(0)=eF(u),φ(1)=eF(u+λη(v,u)). (3.9)

    From (3.7), we have

    φ(t)=eF(u+λη(v,u))F(u+λη(v,u)),η(v,u)eF(u)F(u),η(v,u)+2μλξ(η(v,u)). (3.10)

    Integrating (3.10) between 0 and 1, we have

    φ(1)φ(0)eF(u)F(u),η(v,u)+μξ(η(v,u)).

    that is,

    eF(u+ξη(v,u))eF(u)eF(u)F(u),η(v,u)+μξ(η(v,u)).

    By using Condition A, we have

    eF(v)eF(u)eF(u)F(u),η(v,u)+μξ(η(v,u)).

    which shows that F is strongly exponentially generalized invex function on the invex set Kη.

    Theorem 3.3. Let F be a differentiable strongly exponentially generalized preinvex function with modulus μ>0. If uKη is the minimum of the function F, then

    eF(v)eF(u)μξ(η(v,u)),u,vKη. (3.11)

    Proof. Let uKη be a minimum of the function F. Then

    F(u)F(v),vKη

    from which, we have

    eF(u)eF(v),vKη. (3.12)

    Since K+η is an invex set, so, u,vKη,λ[0,1],

    vλ=u+λη(v,u)Kη.

    Taking v=vλ in (3.12), we have

    0limλ0{eF(u+λη(v,u))eF(u)λ}=eF(u)F(u),η(v,u). (3.13)

    Since F is differentiable strongly exponentially generalized prenvex function, so

    eF(u+λη(v,u))eF(u)+λ(eF(v)eF(u))μλ(1λ)h(η(v,u)),u,vKη,λ[0,1],

    from which, using (3.13), we have

    eF(v)eF(u)limλ0{eF(u+λη(v,u))eF(u)λ}+μξ(η(v,u)).=eF(u)F(u),vu+μξ(η(v,u))μh(η(v,u)),

    the required result (3.1).

    Remark 3.1. If

    eF(u)F(u),vu+μξ(η(v,u))0,u,vKη,

    then uKη is the minimum of the function F.

    We would like to emphasize that the minimum uKη of the strongly exponentially generalized preinvex functions can be characterized by inequality

    eF(u)F(u),η(v.u)0,vKη, (3.14)

    which is called the exponential variational-like inequality and appears to be a new one. It is an interesting problem to study the existence of a unique solution of the exponentially variational-like inequality (3.14) and its applications.

    Theorem 3.4. Let F be exponentially strongly generalized relaxed η- pseudomonotone and Condition A and C hold. If the function ξ is even and exponentially homogeneous of degree 2, then F is a strongly exponentially generalized η-pseudo-invex function.

    Proof. Let F be strongly exponentially relaxed generalized η-pseudomonotone. Then

    eF(u)F(u),η(v,u)0,u,vKη,

    implies that

    eF(v)F(v),η(u,v)αξ(η(u,v)). (3.15)

    Since Kη is an invex set, u,vKη, λ[0,1], vλ=u+λη(v,u)Kη. Taking v=vλ in (3.15), using Condition C and the fact that the function ξ is even and exponentially homogeneous of degree 2, we have

    eF(u+λη(v,u))F(u+λη(v,u)),η(u,v)λαξ(η(v,u)). (3.16)

    Let

    φ(t)=eF(u+λη(v,u)),u,vKη,λ[0,1].

    Then, using (3.16), we have

    φ(λ)=eF(u+λη(v,u))F(u+λη(v,u)),η(u,v)λαξ(η(v,u)).

    Integrating the above relation between 0 to 1, we have

    φ(1)φ(0)α2ξ(η(v,u)),

    that is,

    eF(u+λη(v,u))eF(u)α2ξ(η(v,u)),

    which implies, using Condition A, that

    eF(v)eF(u)α2ξ(η(v,u)),

    showing that F is a strongly exponentially generalized η-pseudo-invex function.

    As special cases of Theorem 3.4, we have the following:

    Theorem 3.5. Let the differential F(u) of a function F(u) on the invex set Kη be exponentially η-pseudomonotone and let Conditions A and C hold. If the function ξ is even and exponentially homogeneous of degree 2, then F is exponentially pseudo η-invex function.

    Theorem 3.6. Let the differential F(u) of a function F(u) on the invex set Kη be strongly exponentially generalized η-pseudomonotone and Conditions A and C hold. If the function h is even and exponentially homogeneous of degree 2, then F is strongly exponentially generalized pseudo η-invex function.

    Theorem 3.7. Let the differential F(u) of a function F(u) on the invex set Kη be strongly exponentially generalized η-pseudomonotone and let Conditions A and C hold. If the function h is even and exponentially homogeneous of degree 2, then F is strongly exponentially generalized pseudo η-invex function.

    Theorem 3.8. Let the differential F(u) of a function F(u) on the invex set be exponentially η-pseudomonotone and Conditions A and C hold. If the function h is even and exponentially homogeneous of degree 2, then F is exponentially pseudo invex function.

    Theorem 3.9. Let the differential eF(u)F(u) of a differentiable preinvex function F(u) be Lipschitz continuous on the invex set Kη with a constant β>0. Then

    eF(u+η(v,u))eF(u)eF(u)F(u),η(v,u)+β2η(v,u)2,u,vKη.

    Proof. Its proof follows from Noor and Noor [30].

    Definition 3.1. The function F is said to be sharply strongly generalized pseudo preinvex, if there exists a constant μ>0 such that

    F(u),η(v,u)0F(v)F(v+λη(v,u))+μλ(1λ)ξ(η(v,u)),u,vKη,λ[0,1].

    Theorem 3.10. Let F be a sharply strongly generalized pseudo preinvex function on Kη with a constant μ>0. Then

    F(v),η(v,u)μξ(η(v,u)),u,vKη.

    Proof. Let F be a sharply strongly generalized pesudo preinvex function on Kη. Then

    F(v)F(v+λη(v,u))+μλ(1λ)ξ(η(v,u)),u,vKη,λ[0,1].

    from which we have

    {F(v+λη(v,u))F(v)λ}+μ(1λ)ξ(η(v,u))0.

    Taking limit in the above inequality, as t0, we have

    F(v),η(v,u)μξ(η(v,u)),

    the required result.

    Definition 3.2. A function F is said to be a exponentially generalized pseudo preinvex function, if there exists a strictly positive bifunction B(.,.), such that

    eF(v)<eF(u)eF(u+λη(v,u))<eF(u)+λ(λ1)B(v,u),u,vKη,λ[0,1].

    Theorem 3.11. If the function F is strongly exponentially generalized preinvex function such that eF(v)<eF(u), then the function F is strongly exponentially generalized pseudo preinvex.

    Proof. Since eF(v)<eF(u) and F is strongly exponentially generalized preinvex function, then u,vKη,λ[0,1], we have

    eF(u+λη(v,u))eF(u)+λ(eF(v)eF(u))μλ(1λ)ξ(η(v,u)))<eF(u)+λ(1λ)(eF(v)eF(u))μλ(1λ)ξ(η(v,u)))=eF(u)+t(t1)(eF(u)eF(v))μλ(1λ)ξ(η(v,u))<eF(u)+t(t1)B(u,v)μλ(1λ)ξ(η(v,u)),

    where B(u,v)=eF(u)eF(v)>0. This shows that F is a strongly exponentially generalized preinvex function.

    It is well known that each strongly convex functions is of the form ±.2, where f is a convex function. We now establish a similar result for the strongly exponentially generalized preinvex functions.

    Theorem 3.12. Let f be a strongly exponentially affine generalized preinvex function. Then F is a strongly exponentially generalized preinvex function, if and only if, ζ=Ff is a exponentially preinvex function.

    Proof. Let f be strongly exponentially affine generalized preinvex function. Then

    ef(u+λη(v,u))=(1λ)ef(u)+λef(v)μλ(1λ)ξ(η(v,u)). (3.17)

    From the strongly exponentially generalized preinvexity of F, we have

    eF(u+λη(v,u))(1λ)eF(u)+teF(v)μλ(1λ)ξ(η(v,u)). (3.18)

    From (3.17) and (3.18), we have

    eF(u+λη(v,u))ef(u+λη(v.u))(1λ)(eF(u)ef(u))+λ(eF(v)ef(v)), (3.19)

    from which it follows that

    eζ(u+λη(v,u))=eF((u+λη(v,u)))ef((1λ)u+λv)(1λ)eF(u)+λeF(v)(1λ)ef(u)λef(v)=(1λ)(eF(u)ef(u))+λ(eF(v)ef(v)),

    which show that ζ=Ff is an exponentially preinvex function.

    The inverse implication is obvious. We would like to remark that one can show that F is a strongly exponentially generalized preinvex function, if and only if, F is strongly exponentially affine preinvex function essentially using the technique of Adamek [1] and Noor et al. [17].

    It is worth mentioning that the strongly exponentially generalized preinvex is also Wright strongly exponentially generalized preinvex functions. From the definition 2, we have

    eF(u+λη(v,u))+eF(v+λη(u,v)eF(u)+eF(v)2μλ(1λ)ξ(η(v,u)),u,vKη,λ[0,1],

    which is called Wright strongly exponentially generalized preinvex function. One can studies the properties and applications of the Wright strongly exponentially generalized preinvex functions in optimization operations research.

    In this paper, we have introduced and studied a new class of preinvex functions with respect to any arbitrary function and bifunction. which is called strongly exponentially generalized function. It is shown that several new classes of strongly preinvex and convex functions can be obtained as special cases of these relative strongly generalized preinvex functions. Some basic properties of these functions are explored. The ideas and techniques of this paper may motivate further research.

    The authors would like to thank the Rector, COMSATS University Islamabad, Pakistan, for providing excellent research and academic environments.

    The authors declare no conflict of interest.



    [1] Utama JP, Syafrudin, Nugraha WD (2015) Penentuan Daya tampung beban pencemaran BOD dan Fecal Coliform Sungai Plumbon Kota Semarang Dengan software QUAL2E. J Teknik Lingkungan 4: 1–9.
    [2] Warsito B, Sumiyati S, Yasin H, et al. (2021) Evaluation of river water quality by using hierarchical clustering analysis, IOP Conference Series: Earth and Environmental Science. https://doi.org/10.1088/1755-1315/896/1/012072 doi: 10.1088/1755-1315/896/1/012072
    [3] Zubaidah T, Karnaningroem N, Slamet A (2018) K-means method for clustering water quality status on the rivers of Banjarmasin, Indonesia. ARPN J Eng Appl Sci 13. https://doi.org/10.31227/osf.io/s9n2u doi: 10.31227/osf.io/s9n2u
    [4] Novianta MA, Syafrudin S, Warsito B (2023) K-means clustering for Grouping Rivers in DIY based on water quality parameters. JUITA J Inform 11: 155–163. https://doi.org/10.30595/juita.v11i1.16986 doi: 10.30595/juita.v11i1.16986
    [5] Di Z, Chang M, Guo P (2019) Water quality evaluation of the Yangtze River in China using machine learning techniques and data monitoring on different time scales. Water 11: 339. https://doi.org/10.3390/w11020339 doi: 10.3390/w11020339
    [6] Mohammadrezapour O, Kisi O, Pourahmad F (2020) Fuzzy c-means and K-means clustering with genetic algorithm for identification of homogeneous regions of groundwater quality. Neural Comput Appl 32: 3763–3775. https://doi.org/10.1007/s00521-018-3768-7 doi: 10.1007/s00521-018-3768-7
    [7] Widyastuti M, Marfai MA (2004) Kajian daya tampung sungai gajahwong thdp beban pencemaran. Majalah Geografi Indonesia. 8: 81–97.
    [8] Riza H, Santoso EW, Tejakusuma IG, et al. (2020) Utilization of artificial intelligence to improve flood disaster mitigation. Jurnal Sains dan Teknologi Mitigasi Bencana 30: 1–11. https://doi.org/10.29122/jstmb.v15i1.4145 doi: 10.29122/jstmb.v15i1.4145
    [9] Makubura R, Meddage DPP, Azamathulla HM, et al. (2022) A simplified mathematical formulation for water quality index (WQI): A case study in the Kelani River Basin, Sri Lanka. Fluids 7: 147. https://doi.org/10.3390/fluids7050147 doi: 10.3390/fluids7050147
    [10] Madhushani C, Dananjaya K, Ekanayake IU, et al. (2024) Modeling streamflow in non-gauged watersheds with sparse data considering physiographic, dynamic climate, and anthropogenic factors using explainable soft computing techniques. J Hydrol 631: 130846. https://doi.org/10.1016/j.jhydrol.2024.130846 doi: 10.1016/j.jhydrol.2024.130846
    [11] Perera UAKK, Coralage DTS, Ekanayake IU, et al. (2024) A new frontier in streamflow modeling in ungauged basins with sparse data: A modified generative adversarial network with explainable AI. Results Eng 21: 101920. https://doi.org/10.1016/j.rineng.2024.101920 doi: 10.1016/j.rineng.2024.101920
    [12] Pohan S, Warsito B, Suryono S (2020) Backpropagation artificial neural network for prediction plant seedling growth. J Phys 1524: 012147. https://doi.org/10.1088/1742-6596/1524/1/012147 doi: 10.1088/1742-6596/1524/1/012147
    [13] Purba RA, Samsir S, Siddik M, et al. (2020), The optimization of backpropagation neural networks to simplify decision making, IOP Conference Series: Materials Science and Engineering, 830: 022091. https://doi.org/10.1088/1757-899X/830/2/022091 doi: 10.1088/1757-899X/830/2/022091
    [14] Nurjaya IK, Estananto E, Murti A (2022) Pemodelan sistem kendali suhu otomatis pada Smart poultry farm menggunakan metode jaringan saraf tiruan. eProc Eng 9.
    [15] Haekal M, Wibowo WC (2023) Prediksi kualitas air sungai menggunakan metode pembelajaran mesin: Studi kasus Sungai Ciliwung: Prediction of river water quality using machine learning methods: Ciliwung River case study. Jurnal Teknologi Lingkungan 24: 273–282. https://doi.org/10.55981/jtl.2023.795 doi: 10.55981/jtl.2023.795
    [16] Mustafa HM, Mustapha A, Hayder G, et al. (2021) Applications of iot and artificial intelligence in water quality monitoring and prediction: A review, In 2021 6th International Conference on inventive computation technologies (ICICT), 968–975. https://doi.org/10.1109/ICICT50816.2021.9358675
    [17] DLHK DIY (2021) Dokumen Informasi Kinerja Pengelolaan Lingkungan Hidup Daerah (DIKPLHD) Provinsi DIY Tahun 2021, Yogyakarta.
    [18] Masruroh M (2020) Perbandingan metode regresi linear dan neural network backpropagation dalam prediksi nilai Ujian nasional siswa smp menggunakan software R. Joutica 5: 331–336. https://doi.org/10.30736/jti.v5i1.347 doi: 10.30736/jti.v5i1.347
    [19] Wanto A (2019) Prediksi produktivitas jagung di Indonesia sebagai upaya antisipasi impor menggunakan jaringan saraf tiruan backpropagation, SINTECH 2: 53–62. https://doi.org/10.31598/sintechjournal.v2i1.355 doi: 10.31598/sintechjournal.v2i1.355
    [20] Sudarsono A (2016) Jaringan syaraf tiruan untuk memprediksi laju pertambahan penduduk menggunakan metode backpropagation (studi Kasus di Kota Bengkulu). Jurnal Media Infotama 12. https://doi.org/10.37676/jmi.v12i1.273 doi: 10.37676/jmi.v12i1.273
    [21] Cynthia EP, Ismanto E (2017) Jaringan syaraf tiruan algoritma backpropagation dalam memprediksi ketersediaan komoditi pangan provinsi riau. RABIT Jurnal Teknologi Dan Sistem Informasi Univrab 2. https://doi.org/10.36341/rabit.v2i2.152 doi: 10.36341/rabit.v2i2.152
    [22] Aggarwal L, Sahoo BM (2018) Back propagation algorithm for computerized paper evaluation using neural network. IJSRST 4.
    [23] Bande S, Shete VV (2017) Smart flood disaster prediction system using IoT & neural networks, 2017 International Conference on Smart Technologies For Smart Nation (SmartTechCon), 189–194. https://doi.org/10.1109/SmartTechCon.2017.8358367 doi: 10.1109/SmartTechCon.2017.8358367
    [24] Mitra P, Ray R, Chatterjee R, et al. (2016) Flood forecasting using Internet of things and artificial neural networks, 2016 IEEE 7th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON), 1–5. https://doi.org/10.1109/IEMCON.2016.7746363 doi: 10.1109/IEMCON.2016.7746363
    [25] Alquisola GLV, Coronel DJA, Reolope BMF, et al. (2018) Prediction and visualization of the disaster risks in the Philippines using discrete wavelet transform (DWT), autoregressive integrated moving average (ARIMA), and artificial neural network (ANN), 2018 3rd International Conference on Computer and Communication Systems (ICCCS), 146–149. https://doi.org/10.1109/CCOMS.2018.8463238
    [26] Wu J, Ming H, Xu J, (2021) Research on intelligent disaster prevention and mitigation method in high flood risk area of river basin based on artificial neural network, 2021 7th International Conference on Hydraulic and Civil Engineering & Smart Water Conservancy and Intelligent Disaster Reduction Forum (ICHCE & SWIDR), 943–952. https://doi.org/10.1109/ICHCESWIDR54323.2021.9656352 doi: 10.1109/ICHCESWIDR54323.2021.9656352
  • This article has been cited by:

    1. Robert Friedman, Higher Cognition: A Mechanical Perspective, 2022, 2, 2673-8392, 1503, 10.3390/encyclopedia2030102
    2. Robert Friedman, Techniques for Theoretical Prediction of Immunogenic Peptides, 2024, 4, 2673-8392, 600, 10.3390/encyclopedia4010038
  • Reader Comments
  • © 2024 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(1414) PDF downloads(81) Cited by(2)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog