This paper established a mathematical model with nonconvex bilinear terms. It formulated the complex material flow in the petroleum refinery scenario based on the concept of the "P model". The mathematical model described the nonlinear constraints such as linear and nonlinear mass and volume intersection flow blending of crude and middle material physical properties. Additionally, it described the complex inflow and outflow in secondary devices as nonlinear constraints such as delta-base structure and physical property transfer. It is highly difficult to determine the direction and quantity of each material in the network of refineries. An improved interior point algorithm with an initial point strategy was proposed to find a high-quality feasible solution in a short time. The real instances from the petroleum refinery were employed to compare and analyze the solutions from the improved algorithm and commercial solver. The experimental results show that the proposed algorithm framework can balance the solution quality and computational efficiency and perform well in different scenarios of refinery material flow networks.
Citation: Fenglian Dong, Dongdong Ge, Lei Yang, Zhiwei Wei, Sichen Guo, Hekai Xu. Nonlinear modeling and interior point algorithm for the material flow optimization in petroleum refinery[J]. Electronic Research Archive, 2024, 32(2): 915-927. doi: 10.3934/era.2024044
[1] | Abdelaziz Alsubie, Anas Al-Masarwah . MBJ-neutrosophic hyper $ BCK $-ideals in hyper $ BCK $-algebras. AIMS Mathematics, 2021, 6(6): 6107-6121. doi: 10.3934/math.2021358 |
[2] | Rajab Ali Borzooei, Hee Sik Kim, Young Bae Jun, Sun Shin Ahn . MBJ-neutrosophic subalgebras and filters in $ BE $-algebras. AIMS Mathematics, 2022, 7(4): 6016-6033. doi: 10.3934/math.2022335 |
[3] | Amr Elrawy, Mohamed Abdalla . Results on a neutrosophic sub-rings. AIMS Mathematics, 2023, 8(9): 21393-21405. doi: 10.3934/math.20231090 |
[4] | Ali Yahya Hummdi, Amr Elrawy . On neutrosophic ideals and prime ideals in rings. AIMS Mathematics, 2024, 9(9): 24762-24775. doi: 10.3934/math.20241205 |
[5] | Majdoleen Abu Qamar, Abd Ghafur Ahmad, Nasruddin Hassan . An approach to Q-neutrosophic soft rings. AIMS Mathematics, 2019, 4(4): 1291-1306. doi: 10.3934/math.2019.4.1291 |
[6] | Saba Al-Kaseasbeh, Madeline Al Tahan, Bijan Davvaz, Mariam Hariri . Single valued neutrosophic $ (m, n) $-ideals of ordered semirings. AIMS Mathematics, 2022, 7(1): 1211-1223. doi: 10.3934/math.2022071 |
[7] | Xin Zhou, Xiao Long Xin . Ideals on neutrosophic extended triplet groups. AIMS Mathematics, 2022, 7(3): 4767-4777. doi: 10.3934/math.2022264 |
[8] | D. Jeni Seles Martina, G. Deepa . Some algebraic properties on rough neutrosophic matrix and its application to multi-criteria decision-making. AIMS Mathematics, 2023, 8(10): 24132-24152. doi: 10.3934/math.20231230 |
[9] | Ning Liu, Zengtai Gong . Derivatives and indefinite integrals of single valued neutrosophic functions. AIMS Mathematics, 2024, 9(1): 391-411. doi: 10.3934/math.2024022 |
[10] | Dongsheng Xu, Huaxiang Xian, Xiewen Lu . Interval neutrosophic covering rough sets based on neighborhoods. AIMS Mathematics, 2021, 6(4): 3772-3787. doi: 10.3934/math.2021224 |
This paper established a mathematical model with nonconvex bilinear terms. It formulated the complex material flow in the petroleum refinery scenario based on the concept of the "P model". The mathematical model described the nonlinear constraints such as linear and nonlinear mass and volume intersection flow blending of crude and middle material physical properties. Additionally, it described the complex inflow and outflow in secondary devices as nonlinear constraints such as delta-base structure and physical property transfer. It is highly difficult to determine the direction and quantity of each material in the network of refineries. An improved interior point algorithm with an initial point strategy was proposed to find a high-quality feasible solution in a short time. The real instances from the petroleum refinery were employed to compare and analyze the solutions from the improved algorithm and commercial solver. The experimental results show that the proposed algorithm framework can balance the solution quality and computational efficiency and perform well in different scenarios of refinery material flow networks.
The classical convexity and concavity of functions are two fundamental notions in mathematics, they have widely applications in many branches of mathematics and physics [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]. The origin theory of convex functions is generally attributed to Jensen [31]. The well-known book [32] played an indispensable role in the the theory of convex functions.
The significance of inequalities is increasing day by day in the real world because of their fertile applications in our life and used to solve many complex problems in all areas of science and technology [33,34,35,36,37,38,39,40]. Integral inequalities have numerous applications in number theory, combinatorics, orthogonal polynomials, hypergeometric functions, quantum theory, linear programming, optimization theory, mechanics and in the theory of relativity [41,42,43,44,45,46,47,48]. This subject has received considerable attention from researchers [49,50,51,52,53,54] and hence it is assumed as an incorporative subject between mathematics, statistics, economics, and physics [55,56,57,58,59,60].
One of the most well known and considerably used inequalities for convex function is the Hermite-Hadamard inequality, which can be stated as follows.
Let I⊆R be an interval, Y:I→R be a convex function. Then the double inequality
Y(ρ1+ρ22)≤1ρ2−ρ1ρ2∫ρ1Y(ϱ)dϱ≤Y(ρ1)+Y(ρ2)2 | (1.1) |
holds for all ρ1,ρ2∈I with ρ1≠ρ2. If Y is concave on the interval I, then the reversed inequality (1.1) holds.
The Hermite-Hadamard inequality (1.1) has wide applications in the study of functional analysis (geometry of Banach spaces) and in the field of non-linear analysis [61]. Interestingly, both sides of the above integral inequality (1.1) can characterize the convex functions.
Closely related to the convex (concave) functions, we have the concept of exponentially convex (concave) functions. The exponentially convex (concave) functions can be considered as a noteworthy extension of the convex functions and have potential applications in information theory, big data analysis, machine learning, and statistics [62,63]. Bernstein [64] and Antczak [65] introduced these exponentially convex functions implicitly and discuss their role in mathematical programming. Dragomir and Gomm [66] and Rashid et al. [67] established novel outcomes for these exponentially convex functions.
Now we recall the concept of exponentially convex functions, which is mainly due to Awan et al. [68].
Definition 1.1. ([68]) Let θ∈R. Then a real-valued function Y:[0,∞)→R is said to be θ-exponentially convex if
Y(τρ1+(1−τ)ρ2)≤τeθρ1Y(ρ1)+(1−τ)eθρ2Y(ρ2) | (1.2) |
for all ρ1,ρ2∈[0,∞) and τ∈[0,1]. Inequality (1.2) will hold in the reverse direction if Y is concave.
For example, the mapping Y:R→R, defined by Y(υ)=−υ2 is a concave function, thus this mapping is an exponentially convex for all θ>0. Exponentially convex functions are employed for statistical analysis, recurrent neural networks, and experimental designs. The exponentially convex functions are highly useful due to their dominant features.
Recall the concept of exponentially quasi-convex function, introduced by Nie et al. [69].
Definition 1.2. ([69]) Let θ∈R. Then a mapping Y:[0,∞)⊆R→R is said to be θ-exponentially quasi-convex if
Y(τρ1+(1−τ)ρ2)≤max{eθρ1Y(ρ1),eθρ2Y(ρ2)} |
for all ρ1,ρ2∈[0,∞) and τ∈[0,1].
Kirmaci [70], and Pearce and Pečarič [71] established the new inequalities involving the convex functions as follows.
Theorem 1.3. ([70]) Let I⊆R be an interval, ρ1,ρ1∈I with ρ1<ρ2, and Y:I→R be a differentiable mapping on I∘ (where and in what follows I∘ denotes the interior of I) such that Y′∈L([ρ1,ρ2]) and |Y′| is convex on [ρ1,ρ2]. Then
|Y(ρ1+ρ22)−1ρ2−ρ1ρ2∫ρ1Y(ϱ)dϱ|≤(ρ2−ρ1)(|Y′(ρ1)|+|Y′(ρ2)|)8. | (1.3) |
Theorem 1.4. ([71]) Let λ∈R with λ≠0, I⊆R be an interval, ρ1,ρ1∈I with ρ1<ρ2, and Y:I→R be a differentiable mapping on I∘ such that Y′∈L([ρ1,ρ2]) and |Y′|λ is convex on [ρ1,ρ2]. Then
|Y(ρ1+ρ22)−1ρ2−ρ1ρ2∫ρ1Y(ϱ)dϱ|≤(ρ2−ρ1)4[|Y′(ρ1)|λ+|Y′(ρ2)|2]1λ. | (1.4) |
The principal objective of this work is to determine the novel generalizations for weighted variants of (1.3) and (1.4) associated with the class of functions whose derivatives in absolute value at certain powers are exponentially convex with the aid of the auxiliary result. Moreover, an analogous improvement is developed for exponentially quasi-convex functions. Utilizing the obtained consequences, some new bounds for the weighted mean formula, rth moments of a continuous random variable and special bivariate means are established. The repercussions of the Hermite-Hadamard inequalities have depicted the presentations for various existing outcomes. Results obtained by the application of the technique disclose that the suggested scheme is very accurate, flexible, effective and simple to use.
In what follows we use the notations
L(ρ1,ρ2,τ)=n+τn+1ρ1+1−τn+1ρ2 |
and
M(ρ1,ρ2,τ)=1−τn+1ρ1+n+τn+1ρ2 |
for τ∈[0,1] and all n∈N.
From now onwards, let ρ1,ρ2∈R with ρ1<ρ2 and I=[ρ1,ρ2], unless otherwise specified. The following lemma presented as an auxiliary result which will be helpful for deriving several new results.
Lemma 2.1. Let n∈N, Y:I→R be a differentiable mapping on I∘ such that Y′∈L1([ρ1,ρ2]), and U:[ρ1,ρ2]→[0,∞) be differentiable mapping. Then one has
12[U(ρ1)[Y(ρ1)+Y(ρ2)]−{U(nρ1+ρ2n+1)−U(ρ1+nρ2n+1)+U(ρ2)}Y(nρ1+ρ2n+1) |
−{U(nρ1+ρ2n+1)−U(ρ1+nρ2n+1)+U(ρ2)}Y(nρ1+ρ2n+1)]+ρ2−ρ12(n+1)1∫0{[Y(n+τn+1ρ1 |
1−τn+1ρ2)+Y(1−τn+1ρ1+n+τn+1ρ2)][U′(n+τn+1ρ1+1−τn+1ρ2)+U′(1−τn+1ρ1+n+τn+1ρ2)]}dτ |
=ρ2−ρ12(n+1){1∫0[U(n+τn+1ρ1+1−τn+1ρ2)−U(1−τn+1ρ1+n+τn+1ρ2)+U(ρ2)] |
×[−Y′(n+τn+1ρ1+1−τn+1ρ2)+Y′(1−τn+1ρ1+n+τn+1ρ2)]dτ}. | (2.1) |
Proof. It follows from integration by parts that
I1=−1∫0[U(n+τn+1ρ1+1−τn+1ρ2)−U(1−τn+1ρ1+n+τn+1ρ2)+U(ρ2)]Y′(n+τn+1ρ1+1−τn+1ρ2)dτ |
=n+1ρ2−ρ1{U(n+τn+1ρ1+1−τn+1ρ2)−U(1−τn+1ρ1+n+τn+1ρ2)+U(ρ2)}Y(n+τn+1ρ1+1−τn+1ρ2)|10 |
−ρ1−ρ2n+11∫0Y(n+τn+1ρ1+1−τn+1ρ2)[U′(n+τn+1ρ1+1−τn+1ρ2)+U′(1−τn+1ρ1+n+τn+1ρ2)]dτ |
=n+1ρ2−ρ1[U(ρ1)Y(ρ1)−[U(nρ1+ρ2n+1)−U(ρ1+nρ2n+1)+U(ρ2)]]Y(nρ1+ρ2n+1) |
+1∫0Y(n+τn+1ρ1+1−τn+1ρ2)[U′(n+τn+1ρ1+1−τn+1ρ2)+U′(1−τn+1ρ1+n+τn+1ρ2)]dτ. |
Similarly, we have
I2=1∫0[U(n+τn+1ρ1+1−τn+1ρ2)−U(1−τn+1ρ1+n+τn+1ρ2)+U(ρ2)]Y′(1−τn+1ρ1+n+τn+1ρ2)dτ |
=n+1ρ2−ρ1[U(ρ1)Y(ρ1)−[U(nρ1+ρ2n+1)−U(ρ1+nρ2n+1)+U(ρ2)]]Y(nρ1+ρ2n+1) |
+1∫0Y(1−τn+1ρ1+n+τn+1ρ2)[U′(n+τn+1ρ1+1−τn+1ρ2)+U′(1−τn+1ρ1+n+τn+1ρ2)]dτ. |
Adding I1 and I2, then multiplying by ρ2−ρ12(n+1) we get the desired identity (2.1).
Theorem 2.2. Let n∈N, θ∈R, Y:I→R be a differentiable mapping on I∘ such that |Y′| is θ-exponentially convex on I, and V:I→[0,∞) be a continuous and positive mapping such it is symmetric with respect to nρ1+ρ2n+1. Then
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
≤ρ2−ρ1n+1[|eθρ1Y′(ρ1)|+|eθρ2Y′(ρ2)|]1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱdτ. | (2.2) |
Proof. Let τ∈[ρ1,ρ2] and Y(τ)=τ∫ρ1V(ϱ)dϱ. Then it follows from Lemma 2.1 that
ρ2−ρ12(n+1)1∫0[Y(n+τn+1ρ1+1−τn+1ρ2)+Y(1−τn+1ρ1+n+τn+1ρ2)][V(n+τn+1ρ1+1−τn+1ρ2) |
+V(1−τn+1ρ1+n+τn+1ρ2)]dτ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ |
=ρ2−ρ12(n+1)1∫0{L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱ+ρ2∫M(ρ1,ρ2,τ)V(ϱ)dϱ} |
×[−Y′(n+τn+1ρ1+1−τn+1ρ2)+Y′(1−τn+1ρ1+n+τn+1ρ2)]dτ. | (2.3) |
Since V(ϱ) is symmetric with respect to ϱ=nρ1+ρ2n+1, we have
ρ2−ρ12(n+1)1∫0[Y(n+τn+1ρ1+1−τn+1ρ2)+Y(1−τn+1ρ1+n+τn+1ρ2)][V(n+τn+1ρ1+1−τn+1ρ2) |
+V(1−τn+1ρ1+n+τn+1ρ2)]dτ |
=ρ2−ρ1(n+1)1∫0Y(n+τn+1ρ1+1−τn+1ρ2)V(n+τn+1ρ1+1−τn+1ρ2)dτ |
+ρ2−ρ1(n+1)1∫0Y(1−τn+1ρ1+n+τn+1ρ2)V(1−τn+1ρ1+n+τn+1ρ2)dτ |
=nρ1+ρ2n+1∫ρ1Y(ϱ)V(ϱ)dϱ+ρ2∫ρ1+nρ2n+1Y(ϱ)V(ϱ)dϱ=ρ2∫ρ1Y(ϱ)V(ϱ)dϱ | (2.4) |
and
L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱ=ρ2∫M(ρ1,ρ2,τ)V(ϱ)dϱ∀τ∈[0,1]. | (2.5) |
From (2.3)–(2.5) we clearly see that
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
≤ρ2−ρ1n+1{1∫0L(ρ1,ρ2,τ)∫ρ1|Y′(n+τn+1ρ1+1−τn+1ρ2)|dτ+1∫0L(ρ1,ρ2,τ)∫ρ1|Y′(1−τn+1ρ1+n+τn+1ρ2)|dτ}. | (2.6) |
Making use of the exponentially convexity of |Y′| we get
1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)|Y′(n+τn+1ρ1+1−τn+1ρ2)|dϱdτ+1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)|Y′(1−τn+1ρ1+n+τn+1ρ2)|dϱdτ |
≤1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)[n+τn+1|eθρ1Y′(ρ1)|+1−τn+1|eθρ2Y′(ρ2)|+1−τn+1|eθρ1Y′(ρ1)+n+τn+1|eθρ2Y′(ρ2)||]dϱdτ |
=[|eθρ1Y′(ρ1)|+|eθρ2Y′(ρ2)|]1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱdτ. | (2.7) |
Therefore, inequality (2.2) follows from (2.6) and (2.7).
Corollary 2.1. Let θ=0. Then Theorem 2.2 leads to
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
≤ρ2−ρ1n+1[|Y′(ρ1)|+|Y′(ρ2)|]1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱdτ. |
Corollary 2.2. Let n=1. Then Theorem 2.2 reduces to
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(ρ1+ρ22)ρ2∫ρ1V(ϱ)dϱ| |
≤ρ2−ρ12[|eθρ1Y′(ρ1)|+|eθρ2Y′(ρ2)|]1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱdτ. |
Corollary 2.3. Let V(ϱ)=1. Then then Theorem 2.3 becomes
|Y(nρ1+ρ2n+1)−1ρ2−ρ1ρ2∫ρ1Y(ϱ)dϱ| |
≤ρ2−ρ12(n+1)2[|eθρ1Y′(ρ1)|+|eθρ2Y′(ρ2)|]. |
Remark 2.1. Theorem 2.2 leads to the conclusion that
(1) If n=1 and θ=0, then we get Theorem 2.2 of [72].
(2) If n=V(ϱ)=1 and θ=0, then we obtain inequality (1.2) of [70]
Theorem 2.3. Taking into consideration the hypothesis of Theorem 2.2 and λ≥1. If θ∈R and |Y′|λ is θ-exponentially convex on I, then
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
≤2(ρ2−ρ1)n+1[|eθρ1Y′(ρ1)|λ+|eθρ2Y′(ρ2)|λ2]1λ1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ | (2.8) |
for all n∈N.
Proof. Continuing inequality (2.6) in the proofs of Theorem 2.2 and using the well-known Hölder integral inequality, one has
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
≤ρ2−ρ1n+1{(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ)1−1λ(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)|Y′(n+τn+1ρ1+1−τn+1ρ2)|λdϱdτ)1λ |
+(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ)1−1λ(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)|Y′(1−τn+1ρ1+n+τn+1ρ2)|λdϱdτ)1λ} |
≤ρ2−ρ1n+1(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ)1−1λ{(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)|Y′(n+τn+1ρ1+1−τn+1ρ2)|λdϱdτ)1λ |
+(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)|Y′(1−τn+1ρ1+n+τn+1ρ2)|λdϱdτ)1λ}. | (2.9) |
It follows from the power-mean inequality
μa+νa<21−a(μ+ν)a |
for μ,ν>0 and a<1 that
(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)|Y′(n+τn+1ρ1+1−τn+1ρ2)|λdϱdτ)1λ | (2.10) |
+(1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)|Y′(1−τn+1ρ1+n+τn+1ρ2)|λdϱdτ)1λ |
≤21−1λ{1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)(|Y′(n+τn+1ρ1+1−τn+1ρ2)|λ+|Y′(1−τn+1ρ1+n+τn+1ρ2)|λ)dϱdτ}1λ. |
Since |Y′|λ is an θ-exponentially convex on I, we have
|Y′(n+τn+1ρ1+1−τn+1ρ2)|λ+|Y′(1−τn+1ρ1+n+τn+1ρ2)| |
≤n+τn+1|eθρ1Y′(ρ1)|q+1−τn+1|eθρ2Y′(ρ2)|q+1−τn+1|eθρ1Y′(ρ1)|q+n+τn+1|eθρ2Y′(ρ2)|q |
=|eθρ1Y′(ρ1)|q+|eθρ2Y′(ρ2)|q. | (2.11) |
Combining (2.9)–(2.11) gives the required inequality (2.8).
Corollary 2.4. Let n=1. Then Theorem 2.3 reduces to
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(ρ1+ρ22)ρ2∫ρ1V(ϱ)dϱ| |
≤(ρ2−ρ1)[|eθρ1Y′(ρ1)|λ+|eθρ2Y′(ρ2)|λ2]1λ1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ. |
Corollary 2.5. Let θ=0. Then Theorem 2.3 leads to
|ρ2∫ρ1Y(x)V(x)dx−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
≤2(ρ2−ρ1)n+1[|Y′(ρ1)|λ+|Y′(ρ2)|λ2]1λ1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ. |
Corollary 2.6. Let V(ϱ)=1. Then Theorem 2.3 becomes
|Y(nρ1+ρ2n+1)−1ρ2−ρ1ρ2∫ρ1Y(ϱ)dϱ|≤(ρ2−ρ1)2(n+1)[|Y′(ρ1)|λ+|Y′(ρ2)|λ2]1λ. |
Remark 2.2. From Theorem 2.3 we clearly see that
(1) If n=1 and θ=0, then we get Theorem 2.4 in [72].
(2) If V(ϱ)=n=1 and θ=0, then we get inequality (1.3) in [71].
In the following result, the exponentially convex functions in Theorem 2.3 can be extended to exponentially quasi-convex functions.
Theorem 2.4. Using the hypothesis of Theorem 2.2. If |Y′| is θ-exponentially quasi-convex on I, then
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| | (2.12) |
≤(ρ2−ρ1)n+1[max{|eθρ1Y′(ρ1)|,|eθ(nρ1+ρ2n+1)Y′(nρ1+ρ2n+1)|} |
+max{|eθρ2Y′(ρ2)|,|eθ(ρ1+nρ2n+1)Y′(ρ1+nρ2n+1)|}]1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ |
for all n∈N.
Proof. Using the exponentially quasi-convexity of |Y′| for (2.6) in the proofs of Theorem 2.2, we get
|Y′(n+τn+1ρ1+1−τn+1ρ2)|=max{|eθρ1Y′(ρ1)|,|eθ(nρ1+ρ2n+1)Y′(nρ1+ρ2n+1)|} | (2.13) |
and
|Y′(1−τn+1ρ1+n+τn+1ρ2)|=max{|eθρ2Y′(ρ2)|,|eθ(ρ1+nρ2n+1)Y′(ρ1+nρ2n+1)|}. | (2.14) |
Combining (2.6), (2.13) and (2.14), we get the desired inequality (2.12).
Next, we discuss some special cases of Theorem 2.4 as follows.
Corollary 2.7. Let n=1. Then Theorem 2.4 reduces to
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(ρ1+ρ22)ρ2∫ρ1V(ϱ)dϱ| |
≤(ρ2−ρ1)2[max{|eθρ1Y′(ρ1)|,|eθ(ρ1+ρ22)Y′(ρ1+ρ22)|} |
+max{|eθρ2Y′(ρ2)|,|eθ(ρ1+ρ22)Y′(ρ1+ρ22)|}]1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ. |
Corollary 2.8. Let θ=0. Then Theorem 2.4 leads to
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
≤(ρ2−ρ1)n+1[max{|Y′(ρ1)|,|Y′(nρ1+ρ2n+1)|} |
+max{|Y′(ρ2)|,|Y′(ρ1+nρ2n+1)|}]1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ. |
Corollary 2.9. Let V(x)=1. Then Theorem 2.4 becomes
|Y(nρ1+ρ2n+1)−1ρ2−ρ1ρ2∫ρ1Y(x)dx| |
≤(ρ2−ρ1)2(n+1)[max{|Y′(ρ1)|,|Y′(nρ1+ρ2(n+1))|} |
+max{|Y′(ρ2)|,|Y′(ρ1+nρ2n+1)|}]. |
Remark 2.3. If |Y′| is increasing in Theorem 2.4, then
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| | (2.15) |
≤(ρ2−ρ1)n+1[|eθρ2Y′(ρ2)|+|eθ(ρ1+nρ2n+1)Y′(ρ1+nρ2n+1)|]1∫0∫L.(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ |
If |Y′| is decreasing in Theorem 2.4, then
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| | (2.16) |
≤(ρ2−ρ1)n+1[|eθρ1Y′(ρ1)|+|eθ(nρ1+ρ2n+1)Y′(nρ1+ρ2n+1)|]1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ. |
Remark 2.4. From Theorem 2.4 we clearly see that
(1) Let n=1 and θ=0. Then Theorem 2.4 and Remark 2.3 lead to Theorem 2.8 and Remark 2.9 of [72], respectively.
(2). Let n=V(ϱ)=1 and θ=0. Then we get Corollary 2.10 and Remark 2.11 of [72].
Theorem 2.5. Suppose that all the hypothesis of Theorem 2.2 are satisfied, θ∈R and λ≥1. If |Y′|λ is θ-exponentially quasi-convex on I, then we have
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| | (2.17) |
≤(ρ2−ρ1)n+1[(max{|eθρ1Y′(ρ1)|λ,|eθ(nρ1+ρ2n+1)Y′(nρ1+ρ2n+1)|λ})1λ |
+(max{|eθρ2Y′(ρ2)|λ,|eθ(ρ1+nρ2n+1)Y′(ρ1+nρ2n+1)|λ})1λ]1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ |
for all n∈N.
Proof. It follows from the exponentially quasi-convexity of |Y′|λ and (2.6) that
|Y′(n+τn+1ρ1+1−τn+1ρ2)|λ≤max{|eθρ1Y′(ρ1)|λ,|eθ(nρ1+ρ2n+1)Y′(nρ1+ρ2n+1)|λ} | (2.18) |
and
|Y′(1−τn+1ρ1+n+τn+1ρ2)|λ≤max{|eθρ2Y′(ρ2)|λ,|eθ(ρ1+nρ2n+1)Y′(ρ1+nρ2n+1)|λ}. | (2.19) |
A combination of (2.6), (2.18) and (2.19) lead to the required inequality (2.17).
Corollary 2.10. Let n=1. Then Theorem 2.5 reduces to
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(ρ1+ρ22)ρ2∫ρ1V(ϱ)dϱ| |
≤(ρ2−ρ1)2[(max{|eθρ1Y′(ρ1)|λ,|eθ(ρ1+ρ22)Y′(ρ1+ρ22)|λ})1λ |
+(max{|eθρ2Y′(ρ2)|λ,|eθ(ρ1+1ρ22)Y′(ρ1+ρ22)|λ})1λ]1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ. |
Corollary 2.11. If θ=0, then Theorem 2.5 leads to the conclusion that
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
≤(ρ2−ρ1)n+1[max{|Y′(ρ1)|,|Y′(nρ1+ρ2n+1)|} |
+max{|Y′(ρ2)|,|Y′(ρ1+nρ2n+1)|}]1∫0∫L(ρ1,ρ2,τ)ρ1V(ϱ)dϱdτ. |
In this section, we support our main results by presenting two examples.
Example 3.1. Let ρ1=0, ρ2=π, θ=2, n=1, Y(ϱ)=sinϱ and V(ϱ)=cosϱ. Then all the assumptions in Theorem 2.2 are satisfied. Note that
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
=|π∫0sinϱcosϱdϱ−sinπ2π∫0cosϱdϱ|=1 | (3.1) |
and
ρ2−ρ1n+1[|eθρ1Y′(ρ1)|+|eθρ2Y′(ρ2)|]1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱdτ |
=π2[|e0cos0)|+|e2πcosπ|]1∫0L(0,π,τ)∫0cosϱdϱdτ |
=536.50π21∫0(1−τ)π2∫0cosϱdϱdτ≈536.5. | (3.2) |
From (3.1) and (3.2) we clearly Example 3.1 supports the conclusion of Theorem 2.2.
Example 3.2. Let ρ1=0, ρ2=2, θ=0.5, n=2, Y(ϱ)=√ϱ+2 and V(ϱ)=ϱ. Then all the assumptions in Theorem 2.2 are satisfied. Note that
|ρ2∫ρ1Y(ϱ)V(ϱ)dϱ−Y(nρ1+ρ2n+1)ρ2∫ρ1V(ϱ)dϱ| |
=|2∫0ϱ√ϱ+2dϱ−√832∫0ϱdϱ|≈0.3758 | (3.3) |
and
ρ2−ρ1n+1[|eθρ1Y′(ρ1)|+|eθρ2Y′(ρ2)|]1∫0L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱdτ |
=23[|e0.5(0)12√2)|+|e0.5(2)14|]1∫0L(0,2,τ)∫0ϱdϱdτ |
=0.68871∫02(1−τ)3∫0ϱdϱdτ≈1.0332. | (3.4) |
From (3.3) and (3.4) we clearly see that Example 3.2 supports the conclusion of Theorem 2.2.
Let Δ be a partition: ρ1=ϱ0<ϱ2<⋯<ϱn−1<ϱn=ρ2 of the interval [ρ1,ρ2] and consider the quadrature formula
ρ2∫ρ1Y(ϱ)V(ϱ)dϱ=T(Y,V,p)+E(Y,V,p), | (4.1) |
where
T(Y,V,p)=κ−1∑j=0Y(nϱj+ϱj+1n+1)ϱj+1∫ϱjV(ϱ)dϱ |
is weighted mean and E(Y,V,p) is the related approximation error.
The aim of this subsection is to provide several new bounds for E(Y,V,p).
Theorem 4.1. Let λ≥1, θ∈R, and |Y′|λ be θ-exponentially convex on I. Then the inequality
|E(Y,V,p)|≤κ−1∑j=0(ϱj+1−ϱj)(|eθϱjY′(ϱj)|λ+|eθϱj+1Y′(ϱj+1)|λ2)1λ1∫0L(ϱj,ϱj+1,τ)∫ϱjV(ϱ)dϱdτ |
holds for any p∈I if all the conditions of Theorem 2.2 are satisfied.
Proof. Applying Theorem 2.3 to the interval [ϱj,ϱj+1] (j=0,1,...,κ−1) of the partition Δ, we get
|Y(nϱj+ϱj+1n+1)ϱj+1∫ϱjV(ϱ)dϱ−ϱj+1∫ϱjY(ϱ)V(ϱ)dϱ| |
≤(ϱj+1−ϱj)(|eθϱjY′(ϱj)|λ+|eθϱj+1Y′(ϱj+1)|λ2)1λ1∫0L(ϱj,ϱj+1,τ)∫ϱjV(ϱ)dϱdτ. |
Summing the above inequality on j from 0 to κ−1 and making use of the triangle inequality together with the exponential convexity of |Y′|λ lead to
|T(Y,V,p)−ρ2∫ρ1Y(ϱ)V(ϱ)dϱ| |
≤κ−1∑j=0(ϱj+1−ϱj)(|eθϱjY′(ϱj)|λ+|eθϱj+1Y′(ϱj+1)|λ2)1λ1∫0L(ϱj,ϱj+1,τ)∫ϱjV(ϱ)dϱdτ, |
this completes the proof of Theorem 4.1.
Theorem 4.2. Let λ≥1, θ∈R, and |Y′|λ be θ-exponentially convex on I. Then the inequality
|E(Y,V,p)| |
≤1n+1κ−1∑j=0(ϱj+1−ϱj)[[max{|eθϱjY′(ϱj)|λ,|eθ(nϱj+ϱj+1n+1)Y′(nϱj+ϱj+1n+1)|λ}]1λ |
+[max{|eθϱj+1Y′(ϱj+1)|λ,|eθ(ϱj+nϱj+1n+1)τY′(ϱj+nϱj+1n+1)|λ}]1λ]1∫0L(ϱj,ϱj+1,τ)∫ϱjV(ϱ)dϱdτ |
holds for every partition Δ of I if all the hypothesis of Theorem 2.2 are satisfied.
Proof. Making use of Theorem 2.5 on the interval [ϱj,ϱj+1] (j=0,1,⋯,κ−1) of the partition △, we get
|Y(nϱj+ϱj+1n+1)ϱj+1∫ϱjV(ϱ)dϱ−ϱj+1∫ϱjY(ϱ)V(ϱ)dϱ| |
≤(ϱj+1−ϱj)n+1[[max{|eθϱjY′(ϱj)|λ,|eθ(nϱj+ϱj+1n+1)Y′(nϱj+ϱj+1n+1)|λ}]1λ |
+[max{|eθϱj+1Y′(ϱj+1)|λ,|eθ(ϱj+nϱj+1n+1)Y′(ϱj+nϱj+1n+1)|λ}]1λ]1∫0L(ϱj,ϱj+1,τ)∫ϱjV(ϱ)dϱdτ. |
Summing the above inequality on j from 0 to κ−1 and making use the triangle inequality together with the exponential convexity of |Y′|λ lead to the conclusion that
|T(Y,V,p)−ρ2∫ρ1Y(ϱ)V(ϱ)dϱ| |
≤1n+1κ−1∑j=0(ϱj+1−ϱj)[[max{|eθϱjY′(ϱj)|λ,|eθ(nϱj+ϱj+1n+1)Y′(nϱj+ϱj+1n+1)|λ}]1λ |
+[max{|eθϱj+1Y′(ϱj+1)|λ,|eθ(ϱj+nϱj+1n+1)Y′(ϱj+nϱj+1n+1)|λ}]1λ]1∫0L(ϱj,ϱj+1,τ)∫ϱjV(ϱ)dϱdτ, |
this completes the proof of Theorem 4.2.
Let 0<ρ1<ρ2, r∈R, V:[ρ1,ρ2]→[0,∞] be continuous on [ρ1,ρ2] and symmetric with respect to nρ1+ρ2n+1 and X be a continuous random variable having probability density function V. Then the rth-moment Er(X) of X is given by
Er(X)=ρ2∫ρ1τrV(τ)dτ |
if it is finite.
Theorem 4.3. The inequality
|Er(X)−(nρ1+ρ2n+1)r|≤r(ρ2−ρ1)(n+1)2[|eθρ1ρr−11|+|eθρ2ρr−12|] |
holds for 0<ρ1<ρ2 and r≥2.
Proof. Let Y(τ)=τr. Then |Y′(τ)|=rτr−1 is exponentially convex function. Note that
ρ2∫ρ1Y(ϱ)V(ϱ)dϱ=Er(X),L(ρ1,ρ2,τ)∫ρ1V(ϱ)dϱ≤nρ1+ρ2n+1∫ρ1V(ϱ)dϱ=1n+1(τ∈[0,1]), |
Y(nρ1+ρ2n+1)=(nρ1+ρ2n+1)r,|eθρ1Y′(ρ1)|+|eθρ2Y′(ρ2)|=r(eθρ1ρr−11+eθρ2ρr−12). |
Therefore, the desired result follows from inequality (2.2) immediately.
Theorem 4.4. The inequality
|Er(X)−(nρ1+ρ2n+1)r|≤r(ρ2−ρ1)(n+1)2[|eθρ2ρr−12|+|eθ(nρ1+ρ2n+1)(nρ1+ρ2n+1)r−1|] |
holds for and .
Proof. Let . Then is increasing and exponentially quasi-convex, and the desired result can be obtained by use of inequality (2.15) and the similar arguments of Theorem 4.3.
A real-valued function is said to be a bivariate mean if for all . Recently, the properties and applications for the bivariate means and their related special functions have attracted the attention of many researchers [73,74,75,76,77,78,79,80,81,82,83,84,85,86]. In particular, many remarkable inequalities for the bivariate means can be found in the literature [87,88,89,90,91,92,93,94,95,96].
In this subsection, we use the results obtained in Section 2 to give some applications to the special bivariate means.
Let with . Then the arithmetic mean , weighted arithmetic mean and -th generalized logarithmic mean are defined by
and
Let , , and be a differentiable mapping such that it is symmetric with respect to . Then Theorem 2.2 implies that
which can be rewritten as
(4.2) |
Let . Then inequality (4.2) leads to Corollary 4.1 immediately.
Corollary 4.1. Let , and . Then one has
We conducted a preliminary attempt to develop a novel formulation presumably for new Hermite-Hadamard type for proposing two new classes of exponentially convex and exponentially quasi-convex functions and presented their analogues. An auxiliary result was chosen because of its success in leading to the well-known Hermite-Hadamard type inequalities. An intriguing feature of an auxiliary is that this simple formulation has significant importance while studying the error bounds of different numerical quadrature rules. Such a potential the connection needs further investigation. We conclude that the results derived in this paper are general in character and give some contributions to inequality theory and fractional calculus as an application for establishing the uniqueness of solutions in boundary value problems, fractional differential equations, and special relativity theory. This interesting aspect of time is worth further investigation. Finally, the innovative concept of exponentially convex functions has potential application in th-moments and special bivariate mean to show the reported result. Our findings are the refinements and generalizations of the existing results that stimulate futuristic research.
The authors would like to thank the anonymous referees for their valuable comments and suggestions, which led to considerable improvement of the article.
The research is supported by the Natural Science Foundation of China (Grant Nos. Grant Nos. 11701176, 61673169, 11301127, 11626101, 11601485).
The authors declare that they have no competing interests.
[1] | M. Ali, Pooling problem: Modeling, global optimization and computational studies survey, J. Comput. Appl. Math., (2021), 478. |
[2] |
C. A. Haverly, Studies of the behavior of recursion for the pooling problem, Acm Sigmap Bull., 25 (1978), 19–28. https://doi.org/10.1145/1111237.1111238 doi: 10.1145/1111237.1111238
![]() |
[3] |
A. Ben-tal, G. Eiger, V. Gershovitz, Global minimization by reducing the duality gap, Math. Program., 63 (1994), 193–212. https://doi.org/10.1007/BF01582066 doi: 10.1007/BF01582066
![]() |
[4] |
I. Quesada, I. E. Grossmann, Global optimization of bilinear process networks with multicomponent flows, Comput. Chem. Eng., 19 (1995), 1219–1242. https://doi.org/10.1016/0098-1354(94)00123-5 doi: 10.1016/0098-1354(94)00123-5
![]() |
[5] | M. Tawarmalani, N. V. Sahindis, Convexification and global optimization in continuous and mixed-integer nonlinear programming, 2022, Boston, MA: Springer US. https://doi.org/10.1007/978-1-4757-3532-1 |
[6] |
T. Kuno, T. Utsunomiya, A Lagrangian based branch-and-bound algorithm for production-transportation problems, J. Global Optim., 18 (2000), 59–73. https://doi.org/10.1023/A:1008373329033 doi: 10.1023/A:1008373329033
![]() |
[7] |
J. M. Zamora, I. E. Grossmann, A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms, J. Global Optim., 14 (1999), 217–249. https://doi.org/10.1023/A:1008312714792 doi: 10.1023/A:1008312714792
![]() |
[8] |
J. P. Ruiz, I. E. Grossmann, Strengthening of lower bounds in the global optimization of Bilinear and Concave Generalized Disjunctive Programs, Comput. Chem. Eng., 34 (2010), 914–930. https://doi.org/10.1016/j.compchemeng.2009.10.016 doi: 10.1016/j.compchemeng.2009.10.016
![]() |
[9] |
C. A. Meyer, C. A. Floudas, Global optimization of a combinatorially complex generalized pooling problem, AIChE J., 52 (2006), 1027–1037. https://doi.org/10.1002/aic.10717 doi: 10.1002/aic.10717
![]() |
[10] |
M. L. Bergamini, P. Aguirre, I. Grossmann, Logic-based outer approximation for globally optimal synthesis of process networks, Comput. Chem. Eng., 29 (2005), 1914–1933. https://doi.org/10.1016/j.compchemeng.2005.04.003 doi: 10.1016/j.compchemeng.2005.04.003
![]() |
[11] |
R. E. Griffith, R. A. Stewart, A nonlinear programming technique for the optimization of continuous processing systems, Manage. Sci., 7 (1961), 379–392. https://doi.org/10.1287/mnsc.7.4.379 doi: 10.1287/mnsc.7.4.379
![]() |
[12] |
F. Palacios-Gomez, L. Lasdon, M. Engquist, Nonlinear optimization by successive linear programming, Manage. Sci., 28 (1982), 1106–1120. https://doi.org/10.1287/mnsc.28.10.1106 doi: 10.1287/mnsc.28.10.1106
![]() |
[13] |
T. E. Baker, L. S. Lasdon, Successive linear programming at Exxon, Manage. Sci., 31 (1985), 264–274. https://doi.org/10.1287/mnsc.31.3.264 doi: 10.1287/mnsc.31.3.264
![]() |
[14] |
L. S. Lasdon, A. D. Waren, S. Sarkar, Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms, ACM Sigmap Bull., 27 (1979), 9–15. https://doi.org/10.1145/1111246.1111247 doi: 10.1145/1111246.1111247
![]() |
[15] |
Y. H. Dai, R. Diao, K. Fu, Complexity analysis and algorithm design of pooling problem, J. Oper. Res. Soc. China, 6 (2018), 249–266. https://doi.org/10.1007/s40305-018-0193-7 doi: 10.1007/s40305-018-0193-7
![]() |
[16] |
V. Pham, C. Laird, M. El-Halwagi, Convex hull discretization approach to the global optimization of pooling problems, Ind. Eng. Chem. Res., 48 (2009), 1973. https://doi.org/10.1021/ie8003573 doi: 10.1021/ie8003573
![]() |
[17] |
A. Gupte, S. Ahmed, S. S. Dey, Relaxations and discretizations for the pooling problem, J. Global Optim., 67 (2017), 631–669. https://doi.org/10.1007/s10898-016-0434-4 doi: 10.1007/s10898-016-0434-4
![]() |
[18] | M. Alfaki, D. Haugland, Comparison of discrete and continuous models for the pooling problem. in 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, 2011. https://doi.org/10.4230/OASIcs.ATMOS.2011.112 |
[19] |
C. A. Floudas, A. Aggarwal, A decomposition strategy for global optimum search in the pooling problem, ORSA J. Comput., 2 (1990), 225–235. https://doi.org/10.1287/ijoc.2.3.225 doi: 10.1287/ijoc.2.3.225
![]() |
[20] | How Distributed Recursion Solves the Pooling Problem, 2022. Available from: https://www.haverly.com/kathy-blog/578-blog-4-howdrsolvespooling. |
[21] | Y. R. He, H. Zhang, Solution of pooling problem in planning model with distributed recursive method, Pet. Process. Petrochem., 27 (1996), 4. |
[22] | Y. R. He, J. Z. Xie, Application cases of refinery's production and operation plan optimization, Beijing: China Petrochemical Press, 2018. |
[23] |
A. Wachter, L. T. Biegler, Failure of global convergence for a class of interior point methods for nonlinear programming, Math. Program., 88 (2000), 565–574. https://doi.org/10.1007/PL00011386 doi: 10.1007/PL00011386
![]() |
[24] |
A. Wachter, L. T. Biegler, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Math. Program., 106 (2006), 25–57. https://doi.org/10.1007/s10107-004-0559-y doi: 10.1007/s10107-004-0559-y
![]() |
[25] | J. B. Guo, M. S. Yang, Chemical industry's production planning and scheduling optimization, Beijing: Chemical Industry Press, 2006. |
[26] | J. B. Guo, Linear programming technique in petroleum sector: a review, Comput. Appl. Chem., 21 (2004), 1–5. |
[27] |
R. H. Byrd, M. E. Hribar, J. Nocedal, An interior point algorithm for large-scale nonlinear programming, SIAM J. Optim., 9 (1999), 877–900. https://doi.org/10.1137/S1052623497325107 doi: 10.1137/S1052623497325107
![]() |
[28] |
O, Güler, Barrier functions in interior point methods, Math. Oper. Res., 21 (1996), 860–885. https://doi.org/10.1287/moor.21.4.860 doi: 10.1287/moor.21.4.860
![]() |
[29] |
G. D. Pillo, L. Grippo, Exact penalty functions in constrained optimization, SIAM J. Control Optim., 27 (1989), 1333–1360. https://doi.org/10.1137/0327068 doi: 10.1137/0327068
![]() |
1. | G. Muhiuddin, K. Porselvi, B. Elavarasan, D. Al-Kadi, Neutrosophic κ-Structures in Ordered Semigroups, 2022, 131, 1526-1506, 979, 10.32604/cmes.2022.018615 | |
2. | Mohammad Hamidi , Extended BCK-Ideal Based on Single-Valued Neutrosophic Hyper BCK-Ideals, 2023, 52, 2449-836X, 411, 10.18778/0138-0680.2023.20 | |
3. | Mahmood Bakhshi, Sun Shin Ahn, Young Bae Jun, Rajab Ali Borzooei, RETRACTED: Some types of pseudo valuations on hyper BCK-algebras, 2024, 10641246, 1, 10.3233/JIFS-233898 |