This paper proposes an outer space branching search method, which is used to globally solve the generalized affine fractional optimization problem (GAFOP). First, we will convert the GAFOP into an equivalent problem (EP). Next, we structure the linear relaxation problem (LRP) of the EP by using the linearization technique. By subsequently partitioning the initial outer space rectangle and successively solving a series of LRPs, the proposed algorithm globally converges to the optimum solution of the GAFOP. Finally, comparisons of numerical results are reported to show the superiority and the effectiveness of the presented algorithm.
Citation: Junqiao Ma, Hongwei Jiao, Jingben Yin, Youlin Shang. Outer space branching search method for solving generalized affine fractional optimization problem[J]. AIMS Mathematics, 2023, 8(1): 1959-1974. doi: 10.3934/math.2023101
[1] | Khaled M. Saad, Manal Alqhtani . Numerical simulation of the fractal-fractional reaction diffusion equations with general nonlinear. AIMS Mathematics, 2021, 6(4): 3788-3804. doi: 10.3934/math.2021225 |
[2] | Abdon Atangana, Ali Akgül . Analysis of a derivative with two variable orders. AIMS Mathematics, 2022, 7(5): 7274-7293. doi: 10.3934/math.2022406 |
[3] | Abdon Atangana, Seda İğret Araz . Extension of Chaplygin's existence and uniqueness method for fractal-fractional nonlinear differential equations. AIMS Mathematics, 2024, 9(3): 5763-5793. doi: 10.3934/math.2024280 |
[4] | Manal Alqhtani, Khaled M. Saad . Numerical solutions of space-fractional diffusion equations via the exponential decay kernel. AIMS Mathematics, 2022, 7(4): 6535-6549. doi: 10.3934/math.2022364 |
[5] | Amir Ali, Abid Ullah Khan, Obaid Algahtani, Sayed Saifullah . Semi-analytical and numerical computation of fractal-fractional sine-Gordon equation with non-singular kernels. AIMS Mathematics, 2022, 7(8): 14975-14990. doi: 10.3934/math.2022820 |
[6] | Hasib Khan, Jehad Alzabut, Anwar Shah, Sina Etemad, Shahram Rezapour, Choonkil Park . A study on the fractal-fractional tobacco smoking model. AIMS Mathematics, 2022, 7(8): 13887-13909. doi: 10.3934/math.2022767 |
[7] | Rahat Zarin, Amir Khan, Pushpendra Kumar, Usa Wannasingha Humphries . Fractional-order dynamics of Chagas-HIV epidemic model with different fractional operators. AIMS Mathematics, 2022, 7(10): 18897-18924. doi: 10.3934/math.20221041 |
[8] | Muhammad Farman, Ali Akgül, Sameh Askar, Thongchai Botmart, Aqeel Ahmad, Hijaz Ahmad . Modeling and analysis of fractional order Zika model. AIMS Mathematics, 2022, 7(3): 3912-3938. doi: 10.3934/math.2022216 |
[9] | Muhammad Aslam, Muhammad Farman, Hijaz Ahmad, Tuan Nguyen Gia, Aqeel Ahmad, Sameh Askar . Fractal fractional derivative on chemistry kinetics hires problem. AIMS Mathematics, 2022, 7(1): 1155-1184. doi: 10.3934/math.2022068 |
[10] | Asif Khan, Tayyaba Akram, Arshad Khan, Shabir Ahmad, Kamsing Nonlaopon . Investigation of time fractional nonlinear KdV-Burgers equation under fractional operators with nonsingular kernels. AIMS Mathematics, 2023, 8(1): 1251-1268. doi: 10.3934/math.2023063 |
This paper proposes an outer space branching search method, which is used to globally solve the generalized affine fractional optimization problem (GAFOP). First, we will convert the GAFOP into an equivalent problem (EP). Next, we structure the linear relaxation problem (LRP) of the EP by using the linearization technique. By subsequently partitioning the initial outer space rectangle and successively solving a series of LRPs, the proposed algorithm globally converges to the optimum solution of the GAFOP. Finally, comparisons of numerical results are reported to show the superiority and the effectiveness of the presented algorithm.
Fractional calculus has come out as one of the most applicable subjects of mathematics [1]. Its importance is evident from the fact that many real-world phenomena can be best interpreted and modeled using this theory. It is also a fact that many disciplines of engineering and science have been influenced by the tools and techniques of fractional calculus. Its emergence can easily be traced and linked with the famous correspondence between the two mathematicians, L'Hospital and Leibnitz, which was made on 30th September 1695. After that, many researchers tried to explore the concept of fractional calculus, which is based on the generalization of nth order derivatives or n-fold integration [2,3,4].
Recently, Khan and Khan [5] have discovered novel definitions of fractional integral and derivative operators. These operators enjoy interesting properties such as continuity, boundedeness, linearity etc. The integral operators, they presented, are stated as under:
Definition 1 ([5]). Let h∈Lθ[s,t](conformable integrable on [s,t]⊆[0,∞)). The left-sided and right-sided generalized conformable fractional integrals τθKνs+ and τθKνt− of order ν>0 with θ∈(0,1], τ∈R, θ+τ≠0 are defined by:
τθKνs+h(r)=1Γ(ν)r∫s(rτ+θ−wτ+θτ+θ)ν−1h(w)wτdθw,r>s, | (1.1) |
and
τθKνt−h(r)=1Γ(ν)t∫r(wτ+θ−rτ+θτ+θ)ν−1h(w)wτdθw,t>r, | (1.2) |
respectively, and τθK0s+h(r)=τθK0t−h(r)=h(r). Here Γ denotes the well-known Gamma function.
Here the integral t∫sdθw represents the conformable integration, defined as:
t∫sh(w)dθw=t∫sh(w)wθ−1dw. | (1.3) |
The operators defined in Definition 1 are in generalized form and contain few important operators in themselves. Here, only the left-sided operators are presented, the corresponding right-sided operators may be deduced in the similar way. Moreover, to understand the theory of conformable fractional calculus, one can see [5,6,7]. Also, the basic theory of fractional calculus can be found in the books [1,8,9] and for the latest research in this field one can see [3,4,10,11,12] and the references there in.
Remark 1. 1) For θ=1 in the Definition 1, the following Katugampula fractional integral operator is obtained [13]:
τ1Kνs+h(r)=1Γ(ν)r∫s(rτ+1−wτ+1τ+1)ν−1h(w)dw,r>s. | (1.4) |
2) For τ=0 in the Definition 1, the New Riemann Liouville type conformable fractional integral operator is obtained as given below:
0θKνs+h(r)=1Γ(ν)r∫s(rθ−wθθ)ν−1h(w)dθw,r>s. | (1.5) |
3) Using the definition of conformable integral given in (1.3) and L'Hospital rule, it is straightforward that when θ→0 in (1.5), we get the Hadamard fractional integral operator as follows:
00+Kνs+h(r)=1Γ(ν)r∫s(logrw)ν−1h(w)dww,r>s. | (1.6) |
4) For θ=1 in (1.5), the well-known Riemann-Liouville fractional integral operator is obtained as follows:
01Kνs+h(r)=1Γ(ν)r∫s(r−w)ν−1h(w)dw,r>s. | (1.7) |
5) For the case ν=1,τ=0 in Definition 1, we get the conformable fractional integrals. And when θ=ν=1, τ=0, we get the classical Riemann integrals.
This subsection is devoted to start with the definition of convex function, which plays a very important role in establishment of various kinds of inequalities [14]. This definition is given as follows [15]:
Definition 2. A function h:I⊆R→R is said to be convex on I if the inequality
h(ηs+(1−η)t)≤ηh(s)+(1−η)h(t) | (1.8) |
holds for all s,t∈I and 0≤η≤1. The function h is said to be concave on I if the inequality given in (1.8) holds in the reverse direction.
Associated with the Definition 2 of convex functions the following double inequality is well-known and it has been playing a key role in various fields of science and engineering [15].
Theorem 1. Let h:I⊆R→R be a convex function and s,t∈I with s<t. Then we have the following Hermite-Hadamard inequality:
h(s+t2)≤1t−st∫sh(τ)dτ≤h(s)+h(t)2. | (1.9) |
This inequality (1.9) appears in a reversed order if the function h is supposed to be concave. Also, the relation (1.9) provides upper and lower estimates for the integral mean of the convex function h. The inequality (1.9) has various versions (extensions or generalizations) corresponding to different integral operators [16,17,18,19,20,21,22,23,24,25] each version has further forms with respect to various kinds of convexities [26,27,28,29,30,31,32] or with respect to different bounds obtained for the absolute difference of the two leftmost or rightmost terms in the Hermite-Hadamard inequality.
By using the Riemann-Liouville fractional integral operators, Sirikaye et al. have proved the following Hermite-Hadamard inequality [33].
Theorem 2. ([33]). Let h:[s,t]→R be a function such that 0≤s<t and h∈L[s,t]. If h is convex on [s,t], then the following double inequality holds:
h(s+t2)≤Γ(ν+1)2(t−s)ν[01Kνs+h(t)+01Kνt−h(s)]≤h(s)+h(t)2. | (1.10) |
For more recent research related to generalized Hermite-Hadamard inequality one can see [34,35,36,37,38,39,40,41,42] and the references therein.
Motivated from the Riemann-Liouville version of Hermite-Hadamard inequality (given above in (1.10)), we prove the same inequality for newly introduced generalized conformable fractional operators. As a result we get a more generalized inequality, containing different versions of Hermite-Hadamard inequality in single form. We also prove an identity for generalized conformable fractional operators and establish a bound for the absolute difference of two rightmost terms in the newly obtained Hermite-Hadamard inequality. We point out some relations of our results with those of other results from the past. At the end we present conclusion, where directions for future research are also mentioned.
In the following theorem the well-known Hermite-Hadamard inequality for the newly defined integral operators is proved.
Theorem 3. Let ν>0 and τ∈R,θ∈(0,1] such that τ+θ>0. Let h:[s,t]⊆[0,∞)→R be a function such that h∈Lθ[s,t](conformal integrable on [s, t]). If h is also a convex function on [s,t], then the following Hermite-Hadamard inequality for generalized conformable fractional Integrals τθKνs+ and τθKνt− holds:
h(s+t2)≤(τ+θ)νΓ(ν+1)4(tτ+θ−sτ+θ)ν[τθKνs+H(t)+τθKνt−H(s)]≤h(s)+h(t)2, | (2.1) |
where H(x)=h(x)+˜h(x), ˜h(x)=h(s+t−x).
Proof. Let η∈[0,1]. Consider x,y∈[s,t], defined by x=ηs+(1−η)t,y=(1−η)s+ηt. Since h is a convex function on [s,t], we have
h(s+t2)=h(x+y2)≤h(x)+h(y)2=h(ηs+(1−η)t)+h((1−η)s+ηt)2. | (2.2) |
Multiplying both sides of (2.2) by
(t−s)(τ+θ)1−ν((1−η)s+ηt)τ+θ−1Γ(ν)[tτ+θ−((1−η)s+ηt)τ+θ]1−ν, |
and integrating with respect to η, we get
(t−s)(τ+θ)1−νΓ(ν)h(s+t2)1∫0((1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νdη≤(t−s)(τ+θ)1−νΓ(ν)12{1∫0((1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νh(ηs+(1−η)t)dη+1∫0(1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νh((1−η)s+ηt)dη}. | (2.3) |
Note that we have
1∫0((1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νdη=1ν(τ+θ)(t−s)(tτ+θ−sτ+θ)ν. |
Also, by using the identity ˜h((1−η)s+ηt)=h(ηs+(1−η)t), and making substitution (1−η)s+ηt=w, we get
(t−s)(τ+θ)1−νΓ(ν)1∫0((1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νh(ηs+(1−η)t)dη=(τ+θ)1−νΓ(ν)t∫swτ+θ−1[tτ+θ−wτ+θ]1−ν˜h(w)dw=(τ+θ)1−νΓ(ν)t∫swτ[tτ+θ−wτ+θ]1−ν˜h(w)dθw=τθKνs+˜h(t). | (2.4) |
Similarly
(t−s)(τ+θ)1−νΓ(ν)1∫0((1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νh(ηt+(1−η)s)dη=τθKνs+h(t). | (2.5) |
By substituting these values in (2.3), we get
(tτ+θ−sτ+θ)νΓ(ν+1)(τ+θ)νh(s+t2)≤τθKνs+H(t)2. | (2.6) |
Again, by multiplying both sides of (2.2) by
(t−s)(τ+θ)1−ν((1−η)s+ηt)τ+θ−1Γ(ν)[((1−η)s+ηt)τ+θ−sτ+θ]1−ν, |
and then integrating with respect to η and by using the same techniques used above, we can obtain:
(tτ+θ−sτ+θ)νΓ(ν+1)(τ+θ)νh(s+t2)≤τθKνt−H(s)2. | (2.7) |
Adding (2.7) and (2.6), we get:
h(s+t2)≤Γ(ν+1)(τ+θ)ν4(tτ+θ−sτ+θ)ν[τθKνs+H(t)+τθKνt−H(s)]. | (2.8) |
Hence the left-hand side of the inequality (2.1) is established.
Also since h is convex, we have:
h(ηs+(1−η)t)+h((1−η)s+ηt)≤h(s)+h(t). | (2.9) |
Multiplying both sides
(t−s)(τ+θ)1−ν((1−η)s+ηt)τ+θ−1Γ(ν)[tτ+θ−((1−η)s+ηt)τ+θ]1−ν, |
and integrating with respect to η we get
(t−s)(τ+θ)1−νΓ(ν)1∫0((1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νh(ηs+(1−η)t)dη+(t−s)(τ+θ)1−νΓ(ν)1∫0((1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νh(ηt+(1−η)s)dη≤(t−s)(τ+θ)1−νΓ(ν)[h(s)+h(t)]1∫0(1−η)s+ηt)τ+θ−1[tτ+θ−((1−η)s+ηt)τ+θ]1−νdη, | (2.10) |
that is,
τθKνs+H(t)≤(tτ+θ−sτ+θ)νΓ(ν+1)(τ+θ)ν[h(s)+h(t)]. | (2.11) |
Similarly multiplying both sides of (2.9) by
(t−s)(τ+θ)1−ν((1−η)s+ηt)τ+θ−1Γ(ν)[((1−η)s+ηt)τ+θ−sτ+θ]1−ν, |
and integrating with respect to η, we can obtain
τθKνt−H(s)≤(tτ+θ−sτ+θ)νΓ(ν+1)(τ+θ)ν[h(s)+h(t)]. | (2.12) |
Adding the inequalities (2.11) and (2.12), we get:
Γ(ν+1)(τ+θ)ν4(tτ+θ−sτ+θ)ν[τθKνt−H(s)+τθKνs+H(t)]≤h(s)+h(t)2. | (2.13) |
Combining (2.8) and (2.13), we get the required result.
The inequality in (2.1) is in compact form containing few inequalities for different integrals in it. The following remark tells us about that fact.
Remark 2. 1) For θ=1 in (2.1), we get Hermite-Hadamard inequality for Katugampola fractional integral operators, as follows [38]:
h(s+t2)≤(τ+1)νΓ(ν+1)4(tτ+1−sτ+1)ν[τ1Kνs+H(t)+τ1Kνt−H(s)]≤h(s)+h(t)2, | (2.14) |
where H(x)=h(x)+˜h(x), ˜h(x)=h(s+t−x).
2) For τ=0 in (2.1), we get Hermite-Hadamard inequality for newly obtained Riemann Liouville type conformable fractional integral operators, as follows:
h(s+t2)≤θνΓ(ν+1)4(tθ−sθ)ν[0θKνs+H(t)+0θKνt−H(s)]≤h(s)+h(t)2, | (2.15) |
where H(x)=h(x)+˜h(x), ˜h(x)=h(s+t−x).
3) For τ+θ→0, in (2.1), applying L'Hospital rule and the relation (1.3), we get Hermite-Hadamard inequality for Hadamard fractional integral operators, as follows:
h(s+t2)≤Γ(ν+1)2(lnts)ν[00+Kνs+h(t)+00+Kνt−h(s)]≤h(s)+h(t)2. | (2.16) |
4) For τ+θ=1 in (2.1), the Hermite-Hadamard inequality is obtained for Riemann-Liouville fractional integrals [33]:
h(s+t2)≤Γ(ν+1)2(t−s)ν[01Kνs+h(t)+01Kνt−h(s)]≤h(s)+h(t)2. | (2.17) |
5) For the case ν=1,τ=0 in (2.1), the Hermite-Hadamard inequality is obtained for the conformable fractional integrals as follows:
h(s+t2)≤θ2(tθ−sθ)t∫sH(w)dθw≤h(s)+h(t)2. | (2.18) |
6) When θ=ν=1, τ=0 the Hermite-Hadamard inequality is obtained for classical Riemann integrals [15]:
h(s+t2)≤1t−st∫sh(w)dw≤h(s)+h(t)2. | (2.19) |
To bound the difference of two rightmost terms in the main inequality (2.1), we need to establish the following Lemma.
Lemma 1. Let τ+θ>0 and ν>0. If h∈Lθ[s,t], then
h(s)+h(t)2−(τ+θ)νΓ(ν+1)4(tτ+θ−sτ+θ)ν[τθKνs+H(t)+τθKνt−H(s)]=t−s4(tτ+θ−sτ+θ)ν1∫0Δντ+θ(η)h′(ηs+(1−η)t)dη, | (2.20) |
where
Δντ+θ(η)=[(ηs+(1−η)t)τ+θ−sτ+θ]ν−[(ηt+(1−η)s)τ+θ−sτ+θ]ν+[tτ+θ−((1−η)s+ηt)τ+θ]ν−[tτ+θ−((1−η)t+ηs)τ+θ]ν. |
Proof. With the help of integration by parts, we have
τθKνs+H(t)=(tτ+θ−sτ+θ)ν(τ+θ)νΓ(ν+1)H(s)+(t−s)ν(τ+θ)νΓ(ν+1)1∫0[tτ+θ−((1−η)s+ηt)τ+θ]νH′(ηt+(1−η)s)dη. | (2.21) |
Similarly, we have
τθKνt−H(s)=(tτ+θ−sτ+θ)ν(τ+θ)νΓ(ν+1)H(t)−(t−s)ν(τ+θ)νΓ(ν+1)1∫0[((1−η)s+ηt)τ+θ−sτ+θ]νH′(ηt+(1−η)s)dη. | (2.22) |
Using (2.21) and (2.22) we have
4(tτ+θ−sτ+θ)νt−s(h(s)+h(t)2−(τ+θ)νΓ(ν+1)4(tτ+θ−sτ+θ)ν[τθKνt−H(s)+τθKνs+H(t)])=1∫0([((1−η)s+ηt)τ+θ−sτ+θ]ν−[(tτ+θ−((1−η)s+ηt)τ+θ]ν)H′(ηt+(1−η)s)dη. | (2.23) |
Also, we have
H′(ηt+(1−η)s)=h′(ηt+(1−η)s)−h′(ηs+(1−η)t),η∈[0,1]. | (2.24) |
And
1∫0[((1−η)s+ηt)τ+θ−sτ+θ]νH′(ηt+(1−η)s)dη=1∫0[((1−η)t+ηs)τ+θ−sτ+θ]νh′(ηs+(1−η)t)dη−1∫0[((1−η)s+ηt)τ+θ−sτ+θ]νh′(ηs+(1−η)t)dη. | (2.25) |
Also, we have
1∫0[tτ+θ−((1−η)s+ηt)τ+θ]νH′(ηt+(1−η)s)dη=1∫0[tτ+θ−((1−η)t+ηs)τ+θ]νh′(ηs+(1−η)t)dη−1∫0[tτ+θ−((1−η)s+ηt)τ+θ]νh′(ηs+(1−η)t)dη. | (2.26) |
Using (2.23), (2.25) and (2.26) we get the required result.
Remark 3. When τ+θ=1 in Lemma 1, we get the Lemma 2 in [33].
Definition 3. For ν>0, we define the operators
Ων1(x,y,τ+θ)=s+t2∫s|x−w||yτ+θ−wτ+θ|νdw−t∫s+t2|x−w||yτ+θ−wτ+θ|νdw, | (2.27) |
and
Ων2(x,y,τ+θ)=s+t2∫s|x−w||wτ+θ−yτ+θ|νdw−t∫s+t2|x−w||wτ+θ−yτ+θ|νdw, | (2.28) |
where x,y∈[s,t]⊆[0,∞) and τ+θ>0.
Theorem 4. Let h be a conformable integrable function over [s,t] such that |h′| is convex function. Then for ν>0 and τ+θ>0 we have:
|h(s)+h(t)2−(τ+θ)νΓ(ν+1)4(tτ+θ−sτ+θ)ν[τθKνs+H(t)+τθKνt−H(s)]|≤Kντ+θ(s,t)4(t−s)(tτ+θ−sτ+θ)ν(|h′(s)|+|h′(t)|), | (2.29) |
where Kντ+θ(s,t)=Ων1(t,t,τ+θ)+Ων2(s,s,τ+θ)−Ων2(t,s,τ+θ)−Ων1(s,t,τ+θ).
Proof. Using Lemma 1 and convexity of |h′|, we have:
|h(s)+h(t)2−(τ+θ)νΓ(ν+1)4(tτ+θ−sτ+θ)ν[τθKνs+H(t)+τθKνt−H(s)]|≤t−s4(tτ+θ−sτ+θ)ν1∫0|Δντ+θ(η)||h′(ηs+(1−η)t)|dη≤t−s4(tτ+θ−sτ+θ)ν(|h′(s)|1∫0η|Δντ+θ(η)|dη+|h′(t)|1∫0(1−η)|Δντ+θ(η)|dη). | (2.30) |
Here 1∫0η|Δντ+θ(η)|dη=1(t−s)2t∫s|ψ(u)|(t−u)du,
and ψ(u)=(uτ+θ−sτ+θ)ν−((t+s−u)τ+θ−sτ+θ)ν+(tτ+θ−(s+t−u)τ+θ)ν−(tτ+θ−uτ+θ)ν.
We observe that ψ is a nondecreasing function on [s,t]. Moreover, we have:
ψ(s)=−2(tτ+θ−sτ+θ)ν<0, |
and also ψ(s+t2)=0. As a consequence, we have
{ψ(u)≤0,if s≤u≤s+t2,ψ(u)>0,if s+t2<u≤t. |
Thus we get
1∫0η|Δντ+θ(η)|dη=1(t−s)2t∫s|ψ(u)|(t−u)du=1(t−s)2[−s+t2∫sψ(u)(t−u)du+t∫s+t2ψ(u)(t−u)du]=1(t−s)2[K1+K2+K3+K4], | (2.31) |
where
K1=−s+t2∫s(t−u)(uτ+θ−sτ+θ)νdu+t∫s+t2(t−u)(uτ+θ−sτ+θ)νdu, | (2.32) |
K2=s+t2∫s(t−u)((t+s−u)τ+θ−sτ+θ)νdu−t∫s+t2(t−u)((t+s−u)τ+θ−sτ+θ)νdu, | (2.33) |
K3=−s+t2∫s(t−u)(tτ+θ−(s+t−u)τ+θ)νdu+t∫s+t2(t−u)(tτ+θ−(s+t−u)τ+θ)νdu, | (2.34) |
and
K4=s+t2∫s(t−u)(tτ+θ−uτ+θ)νdu−t∫s+t2(t−u)(tτ+θ−uτ+θ)νdu. | (2.35) |
We can see here that K1=−Ων2(t,s,τ+θ), K4=Ων1(t,t,τ+θ).
Also, by using of change of the variables v=s+t−u, we get
K2=Ων2(s,s,τ+θ),K3=−Ων1(s,t,τ+θ). | (2.36) |
By substituting these values in (2.31), we get
1∫0ηΔντ+θ(η)dη=−Ων2(t,s,τ+θ)+Ων1(t,t,τ+θ)+Ων2(s,s,τ+θ)−Ων1(s,t,τ+θ)(t−s)2. | (2.37) |
Similarly, we can find
1∫0(1−η)Δντ+θ(η)dη=Ων2(s,s,τ+θ)−Ων2(t,s,τ+θ)+Ων1(t,t,τ+θ)−Ων1(s,t,τ+θ)(t−s)2. | (2.38) |
Finally, by using (2.30), (2.37) and (2.38) we get the required result.
Remark 4. when τ+θ=1 in (2.29), we obtain
|h(s)+h(t)2−Γ(ν+1)2(t−s)ν[01Kνt−h(s)+01Kνs+h(t)]|≤(t−s)2(ν+1)(1−12ν)[h′(s)+h′(t)], |
which is Theorem 3 in [33].
A generalized version of Hermite-Hadamard inequality via newly introduced GC fractional operators has been acquired successfully. This result combines several versions (new and old) of the Hermite-Hadamard inequality into a single form, each one has been discussed by fixing parameters in the newly established version of the Hermite-Hadamard inequality. Moreover, an identity containing the GC fractional integral operators has been proved. By using this identity, a bound for the absolute of the difference between the two rightmost terms in the newly established Hermite-Hadamard inequality has been presented. Also, some relations of our results with those of already existing results have been pointed out. Since this is a fact that there exist more than one definitions for fractional derivatives [2] which makes it difficult to choose a convenient operator for solving a given problem. Thus, in the present paper, the GC fractional operators (containing various previously defined fractional operators into a single form) have been used in order to overcome the problem of choosing a suitable fractional operator and to provide a unique platform for researchers working with different operators in this field. Also, by making use of GC fractional operators one can follow the research work which has been performed for the two versions (1.9) and (1.10) of Hermite-Hadamard inequality.
This work was supported by the Natural Science Foundation of China (Grant Nos. 61673169, 11301127, 11701176, 11626101, 11601485).
The authors declare that there are no conflicts of interest regarding the publication of this paper.
[1] |
C. D. Maranas, I. P. Androulakis, C. A. Floudas, A. J. Bergerb, J. M. Mulvey, Solving long-term financial planning problems via global optimization, J. Econ. Dyn. Contr., 21 (1997), 1405–1425. https://doi.org/10.1016/S0165-1889(97)00032-8 doi: 10.1016/S0165-1889(97)00032-8
![]() |
[2] |
H. W. Jiao, J. Q. Ma, P. P. Shen, Y. J. Qiu, Effective algorithm and computational complexity for solving sum of linear ratios problem, J. Ind. Manag. Optim., 2022. http://dx.doi.org/10.3934/jimo.2022135 doi: 10.3934/jimo.2022135
![]() |
[3] |
H. W. Jiao, S. Y. Liu, An efficient algorithm for quadratic Sum-of-Ratios fractional programs problem, Numer. Func. Anal. Opt., 38 (2017), 1426–1445. https://doi.org/10.1080/01630563.2017.1327869 doi: 10.1080/01630563.2017.1327869
![]() |
[4] | J. E. Falk, S. W. Palocsay, Optimizing the sum of linear fractional functions, recent advances in global optimization, New Jersey: Princeton University Press, 1992. |
[5] |
H. W. Jiao, J. Q. Ma, An efficient algorithm and complexity result for solving the sum of general ratios problem, Chaos Soliton. Fract., 164 (2022), 112701. https://doi.org/10.1016/j.chaos.2022.112701 doi: 10.1016/j.chaos.2022.112701
![]() |
[6] |
C. Bajona-Xandri, J. E. Martinez-Legaz, Lower subdifferentiability in minimax fractional programming, Optimization, 45 (1999), 1–12. https://doi.org/10.1080/02331939908844423 doi: 10.1080/02331939908844423
![]() |
[7] |
F. Ding, Two-stage least squares based iterative estimation algorithm for CARARMA system modeling, Appl. Math.Model., 37 (2013), 4798–4808. https://doi.org/10.1016/j.apm.2012.10.014 doi: 10.1016/j.apm.2012.10.014
![]() |
[8] |
F. Ding, Decomposition based fast least squares algorithm for output error systems, Signal Process., 93 (2013), 1235–1242. https://doi.org/10.1016/j.sigpro.2012.12.013 doi: 10.1016/j.sigpro.2012.12.013
![]() |
[9] |
H. W. Jiao, S. Y. Liu, Range division and compression algorithm for quadratically constrained sum of quadratic ratios, Comp. Appl. Math., 36 (2017), 225–247. https://doi.org/10.1007/s40314-015-0224-5 doi: 10.1007/s40314-015-0224-5
![]() |
[10] |
H. W. Jiao, S. Y. Liu, W. J. Wang, Solving generalized polynomial problem by using new affine relaxed technique, Int. J. Comput. Math., 99 (2022), 309–331. https://doi.org/10.1080/00207160.2021.1909727 doi: 10.1080/00207160.2021.1909727
![]() |
[11] |
H. W. Jiao, W. J. Wang, R. J. Chen, Y. L. Shang, J. B. Yin, An efficient outer space algorithm for generalized linear multiplicative programming problem, IEEE Access, 8 (2020), 80629–80637. https://doi.org/10.1109/ACCESS.2020.2990677 doi: 10.1109/ACCESS.2020.2990677
![]() |
[12] |
H. W. Jiao, Y. L. Shang, R. J. Chen, A potential practical algorithm for minimizing the sum of affine fractional functions, Optimization, 2022. https://doi.org/10.1080/02331934.2022.2032051 doi: 10.1080/02331934.2022.2032051
![]() |
[13] |
Y. Y. Ding, Y. H. Xiao, J. W. Li, A class of conjugate gradient methods for convex constrained monotone equations, Optimization, 66 (2017), 2309–2328. https://doi.org/10.1080/02331934.2017.1372438 doi: 10.1080/02331934.2017.1372438
![]() |
[14] |
Y. H. Xiao, L. Chen, D. H. Li, A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming, Math. Program. Comput., 10 (2018), 533–555. https://doi.org/10.1007/s12532-018-0134-9 doi: 10.1007/s12532-018-0134-9
![]() |
[15] |
H. W. Jiao, W. J. Wang, J. B. Yin, Y. L. Shang, Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems, Rairo-Oper. Res., 56 (2022), 1533–1552. https://doi.org/10.1051/ro/2022061 doi: 10.1051/ro/2022061
![]() |
[16] |
H. W. Jiao, Y. L. Shang, Two-level linear relaxation method for generalized linear fractional programming, J. Oper. Res. Soc., 2022. https://doi.org/10.1007/s40305-021-00375-4 doi: 10.1007/s40305-021-00375-4
![]() |
[17] |
H. W. Jiao, W. J. Wang, Y. L. Shang, Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problem, J. Comput. Appl. Math., 419 (2023), 114784. https://doi.org/10.1016/j.cam.2022.114784 doi: 10.1016/j.cam.2022.114784
![]() |
[18] |
A. I. Barros, J. B. G. Frenk, Generalized fractional programming and cutting plane algorithms, J. Optim. Theory Appl., 87 (1995), 103–120. https://doi.org/10.1007/BF02192043 doi: 10.1007/BF02192043
![]() |
[19] |
Q. G. Feng, H. P. Mao, H. W. Jiao, A feasible method for a class of mathematical problems in manufacturing system, Key Eng. Mater., 460 (2011), 806–809. https://doi.org/10.4028/www.scientific.net/KEM.460-461.806 doi: 10.4028/www.scientific.net/KEM.460-461.806
![]() |
[20] |
Q. G. Feng, H. W. Jiao, H. P. Mao, Y. Q. Chen, A deterministic algorithm for min-max and max-min linear fractional programming problems, Int. J. Comput. Int. Sys., 4 (2011), 134–141. http://dx.doi.org/10.1080/18756891.2011.9727770 doi: 10.1080/18756891.2011.9727770
![]() |
[21] |
R.W. Freund, F. Jarre, An interior-point method for fractional programs with convex constraints, Math. Program., 67 (1994), 407–440. https://doi.org/10.1007/BF01582229 doi: 10.1007/BF01582229
![]() |
[22] |
Y. Benadada, J. A. Fedand, Partial linearization for generalized fractional programming, Zeitschrift Für Oper. Res., 32 (1988), 101–106. https://doi.org/10.1007/BF01919185 doi: 10.1007/BF01919185
![]() |
[23] |
N. T. H. Phuong, H. Tuy, A unified monotonic approach to generalized linear fractional programming, J. Global Optim., 26 (2003), 229–259. https://doi.org/10.1023/A:1023274721632 doi: 10.1023/A:1023274721632
![]() |
[24] |
A. Roubi, Method of centers for generalized fractional programming, J. Optim. Theory Appl., 107 (2000), 123–143. https://doi.org/10.1023/A:1004660917684 doi: 10.1023/A:1004660917684
![]() |
[25] |
M. Gugat, Prox-regularization methods for generalized fractional programming, J. Optim. Theory Appl., 99 (1998), 691–722. https://doi.org/10.1023/A:1021759318653 doi: 10.1023/A:1021759318653
![]() |
[26] |
A. Ghazi, A. Roubi, A DC approach for minimax fractional optimization programs with ratios of convex functions, Optim. Methods Softw., 2020. https://doi.org/10.1080/10556788.2020.1818234 doi: 10.1080/10556788.2020.1818234
![]() |
[27] |
H. Boualam, A. Roubi, Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs, J. Ind. Manag. Optim., 15 (2019), 1897–1920. https://doi.org/10.3934/jimo.2018128 doi: 10.3934/jimo.2018128
![]() |
[28] | H. W. Jiao, J. Q. Ma, Y. Shang, Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem, Pac. J. Optim., 18 (2022), 195–212. |
[29] |
M. E. Haffari, A. Roubi, Prox-dual regularization algorithm for generalized fractional programs, J. Ind. Manag. Optim., 13 (2017). https://doi.org/10.3934/jimo.2017028 doi: 10.3934/jimo.2017028
![]() |
[30] |
H. W. Jiao, B. B. Li, Solving min-max linear fractional programs based on image space branch-and-bound scheme, Chaos Soliton. Fract., 164 (2022), 112682. https://doi.org/10.1016/j.chaos.2022.112682 doi: 10.1016/j.chaos.2022.112682
![]() |
[31] |
I. Ahmad, Z. Husain, Duality in nondifferentiable minimax fractional programming with generalized convexity, Appl. Math. Comput., 176 (2006), 545–551. https://doi.org/10.1016/j.amc.2005.10.002 doi: 10.1016/j.amc.2005.10.002
![]() |
[32] |
W. E. Schmitendorf, Necessary conditions and sufficient conditions for static minimax problems, J. Math. Anal. Appl., 57 (1977), 683–693. https://doi.org/10.1016/0022-247X(77)90255-4 doi: 10.1016/0022-247X(77)90255-4
![]() |
[33] |
S. Tanimoto, Duality for a class of nondifferentiable mathematical programming problems, J. Math. Anal. Appl., 79 (1981), 286–294. https://doi.org/10.1016/0022-247X(81)90025-1 doi: 10.1016/0022-247X(81)90025-1
![]() |
[34] |
S. R. Yadav, R. N. Mukherjee, Duality for fractional minimax programming problems, ANZIAM J., 31 (1990), 484–492. https://doi.org/10.1017/S0334270000006809 doi: 10.1017/S0334270000006809
![]() |
[35] |
V. Jeyakumar, G. Y. Li, S. Srisatkunarajah, Strong duality for robust minimax fractional programming problems, Eur. J. Oper. Res., 228 (2013), 331–336. https://doi.org/10.1016/j.ejor.2013.02.015 doi: 10.1016/j.ejor.2013.02.015
![]() |
[36] |
H. C. Lai, J. C. Liu, K. Tanaka, Duality without a constraint qualification for minimax fractional programming, J. Math. Anal. Appl., 101 (1999), 109–125. https://doi.org/10.1023/A:1021771011210 doi: 10.1023/A:1021771011210
![]() |
[37] |
I. M. Stancu-Minasian, A ninth bibliography of fractional programming, Optimization, 68 (2019) 2125–2169. https://doi.org/10.1080/02331934.2019.1632250 doi: 10.1080/02331934.2019.1632250
![]() |
[38] |
I. M. Stancu-Minasian, A eighth bibliography of fractional programming, Optimization, 66 (2017) 439–470. https://doi.org/10.1080/02331934.2016.1276179 doi: 10.1080/02331934.2016.1276179
![]() |
[39] | C. F. Wang, Y. Jiang, P. P. Shen, A new branch-and-bound algorithm for solving minimax linear fractional programming, J. Math., 38 (2018), 113–123. |
[40] |
H. W. Jiao, S. Y. Liu, A new linearization technique for minimax linear fractional programming, Int. J. Comput. Math., 91 (2014), 1730–1743. https://doi.org/10.1080/00207160.2013.860449 doi: 10.1080/00207160.2013.860449
![]() |
1. | Rania Saadeh, Laith Hamdi, Ahmad Qazza, 2024, Chapter 18, 978-981-97-4875-4, 259, 10.1007/978-981-97-4876-1_18 | |
2. | Saad Ihsan Butt, Ahmad Khan, Sanja Tipurić-Spužević, New fractal–fractional Simpson estimates for twice differentiable functions with applications, 2024, 51, 23074108, 100205, 10.1016/j.kjs.2024.100205 | |
3. | Rania Saadeh, Motasem Mustafa, Aliaa Burqan, 2024, Chapter 17, 978-981-97-4875-4, 239, 10.1007/978-981-97-4876-1_17 |