Skip to Content
AxiomsAxioms
  • Article
  • Open Access

11 September 2026

22 Pages

Numerical Interpretation and Graphical Visualization of Generalized Fuzzy Fractional Inequalities Through Different Convexities

,
,
and
1
Department of Mathematics and Statistics, University of Lahore, Sargodha Campus, Sargodha 40100, Pakistan
2
Department of Mathematics, College of Science, Qassim University, Burydah 52571, Saudi Arabia
*
Authors to whom correspondence should be addressed.

Abstract

The generalization of convexities and fractional operators is a significant approach that not only refines the fractional inequalities but has also resolved many problems that are facing the non-integer family of calculus. In this paper, we introduce the class of modified exponential–trigonometric functions, (p,s)-convex functions, and (s)-convex functions, and include them in a single framework of modified exponential trigonometric ( p , s ) -convex (MET- ( p , s ) -convex) functions. The present concept is generalized to the fuzzy-interval-valued case by means of Prabhakar fuzzy fractional integral operators. We obtain new Hermite–Hadamard- and trapezoid-type inequalities and their Hölder and power mean refinements. Lower and upper endpoint functions are utilized to prove the obtained results, and the results are also unified by fuzzy-order relation. The proposed class is a strict generalization of several convexity classes and fits some non-convex mappings not covered by the classical Hermite–Hadamard inequality. Moreover, the obtained inequalities offer computable upper and lower bounds to the uncertainty of Prabhakar fractional means. Theoretical results are illustrated by numerical examples and graphical illustrations, which show that the main advantage of the proposed framework is a wider class of admissible mappings rather than sharper numerical bounds. The classical Hermite–Hadamard inequality and several existing convexity-based inequalities are recovered as special cases of the results obtained here.

1. Introduction

Convexity is a central concept in pure and applied analysis, and it is the basis of the following classical inequalities (and their applications in optimization and approximation theory) [1,2]. Fractional integral operators, in turn, offer a natural extension of such inequalities. They are not restricted to the local setting, and have been widely applied in physics, engineering, control theory and differential equations [3,4].
The Hermite–Hadamard inequality is one of the most fundamental of the classical results of convex analysis. For a convex function g : I ⊆ R → R , defined on an interval, as follows: [ k 1 , k 2 ]
g k 1 + k 2 2 ≤ 1 k 2 − k 1 ∫ k 1 k 2 g ( x ) d x ≤ g ( k 1 ) + g ( k 2 ) 2 ,
This provides two-sided bounds for the mean value of g. Due to its significance, many authors have derived improvements and generalizations of the Hermite–Hadamard type for various convex classes and fractional integral operators [5,6,7], with a notable example being a full account of generalized preinvex functions [8].
Since then, a number of generalizations of convexity have been introduced and studied, such as s-convex functions [9] and harmonically exponential-type convex functions [10] and preinvex functions [11]. For these classes, new upper and lower bounds of Hermite–Hadamard, Fejér, Simpson and Bullen types continue to be calculated [12,13,14], along with the refinements that use s-type and strongly convex mappings [15,16,17].
Preinvexity generalizes convexity via the concept of an invex set and has been explored by a number of authors [18,19,20], who have also made connections with the variational-like inequalities field [21,22]. In a parallel direction, Kadakal [23] introduced trigonometrically convex functions, upon which the Exponential Trigonometric Convex Functions (ETCF) are based. Fractional integral inequalities of Hermite–Hadamard type have also been introduced into the fuzzy-interval setting, using fuzzy-interval Godunova–Levin- and fuzzy-interval Prabhakar-type operators to extend the inequality to h-convex and Godunova–Levin fuzzy-interval-valued functions [24].
More recently, the fuzzy-interval-valued direction of this theory has continued to develop. Nayab et al. [25] built Prabhakar fuzzy fractional operators and used them to derive Hermite–Hadamard and trapezoid-type inequalities for h-Godunova–Levin convex and h-Godunova preinvex fuzzy interval-valued functions. Fuzzy Hermite–Hadamard inequalities have also been obtained very recently for h-Godunova–Levin convex functions through Riemann–Liouville fractional q-integrals [26], and for general Hadamard-type fuzzy-number-valued operators in one and two variables [27]. On the convexity side, Demir Budak and Gürbüz [28] introduced a modified exponential trigonometric convex function using the same weight structure adopted in Definition 9. None of these recent studies, however, combine a modified exponential trigonometric weight with a ( p , s ) -type domain and range structure together with the Prabhakar fuzzy fractional setting. But the modified exponential trigonometric convexity has not yet been conjugated with p-convexity and s-convexity nor investigated using Prabhakar fuzzy fractional operators. To address this gap, we define the class of MET- ( p , s ) -convex functions and, using the Prabhakar fuzzy fractional integral operators, obtain some new results for this class. The advantage of this framework is generality rather than sharper numerical bounds: the class admits mappings, such as f ( x ) = x , that are outside the reach of the classical Hermite–Hadamard inequality (see Section 5.7), and this broader applicability, not tighter constants, is the main contribution of the present work. Hermite–Hadamard and trapezoid-type inequalities of fuzzy-interval-valued functions and refinements of these inequalities by the Hölder and power-mean types. The general results recover several known inequalities as special cases and are complemented by numerical examples and drawings to verify the limits. This way, the application of Hermite–Hadamard type inequalities for fractional integral operators is extended to the framework of MET- ( p , s ) -convexity.

2. Fundamental Concepts

This section presents the basic definitions on which this paper is based.
Definition 1
([2]). A function f : I ⊆ R → R is said to be convex if
f t a 1 + ( 1 − t ) b 1 ≤ t f ( a 1 ) + ( 1 − t ) f ( b 1 )
for all a 1 , b 1 ∈ I and t ∈ [ 0 , 1 ] .
Definition 2
([9]). For a fixed s ∈ ( 0 , 1 ] , a function f : [ 0 , ∞ ) → R is said to be s-convex in the second sense if
f t a 1 + ( 1 − t ) b 1 ≤ t s f ( a 1 ) + ( 1 − t ) s f ( b 1 )
for all a 1 , b 1 ∈ [ 0 , ∞ ) and t ∈ [ 0 , 1 ] .
Definition 3
([29]). Let J ⊂ ( 0 , ∞ ) be a real interval and p ∈ R ∖ { 0 } . Then, J is a p-convex set if
t a 1 p + ( 1 − t ) b 1 p 1 / p ∈ J
for all a 1 , b 1 ∈ J and t ∈ [ 0 , 1 ] .
Definition 4
([29]). Let J ⊂ ( 0 , ∞ ) be a real interval and p ∈ R ∖ { 0 } . A function f : J → R is p-convex if
f t a 1 p + ( 1 − t ) b 1 p 1 / p ≤ t f ( a 1 ) + ( 1 − t ) f ( b 1 )
for all a 1 , b 1 ∈ J and t ∈ [ 0 , 1 ] ; if the inequality is reversed, f is p-concave. Related generalizations of p-convexity and their inequalities may be found in [30,31,32].
Definition 5
([11,18]). A set L ⊆ R is an invex set with respect to the bifunction ζ : L × L → R if
a 1 + t ζ ( b 1 , a 1 ) ∈ L
for all a 1 , b 1 ∈ K and t ∈ [ 0 , 1 ] . Every convex set is invex with respect to ζ ( b 1 , a 1 ) = b 1 − a 1 , but the converse does not hold.
Definition 6
([11,18]). Let L ⊆ R be an invex set with respect to ζ. A function f : K → R is preinvex with respect to ζ if
f a 1 + t ζ ( b 1 , a 1 ) ≤ ( 1 − t ) f ( a 1 ) + t f ( b 1 )
for all a 1 , b 1 ∈ K and t ∈ [ 0 , 1 ] . Such classes have been widely studied, including ( α , m ) - and ( s , m ) -preinvex extensions [33,34,35].
Definition 7
([23]). A nonnegative function f : I ⊆ R → R is trigonometrically convex on I if, for all a 1 , b 1 ∈ I and t ∈ [ 0 , 1 ] ,
f t a 1 + ( 1 − t ) b 1 ≤ sin ( 2 π t ) f ( a 1 ) + cos ( 2 π t ) f ( b 1 ) .
Definition 8
([36]). A function f : I ⊆ R → R is an exponential trigonometric convex function if
f t a 1 + ( 1 − t ) b 1 ≤ sin π t 2 e 1 − t f ( a 1 ) + cos π t 2 e t f ( b 1 )
for all a 1 , b 1 ∈ I and t ∈ [ 0 , 1 ] .
Definition 9.
Let f : I ⊆ R → R 0 + be a function. Motivated by the exponential trigonometric convex functions of [36], we say that f is a modified exponential trigonometric convex function, a class already introduced by Demir Budak and Gürbüz [28], if, for all a 1 , b 1 ∈ I and t ∈ [ 0 , 1 ] ,
f t a 1 + ( 1 − t ) b 1 ≤ sin π t 2 e 1 − t f ( a 1 ) + cos π t 2 e t f ( b 1 ) .
Remark 1.
Definitions 8 and 9 are genuinely different classes, not the same inequality restated: in Definition 8, the exponential factors e 1 − t , e t are in the denominator (weights) sin π t 2 e t − 1 , cos π t 2 e − t ), whereas in Definition 9 they are present in the numerator (weights). sin π t 2 e 1 − t , cos π t 2 e t ). These two weight functions of t are identical only at the endpoints t ∈ { 0 , 1 } ; for instance, at t = 1 2 the sine-weight is (under Definition 8) sin π 4 e − 1 / 2 ≈ 0.429 while the sine-weight under Definition 9 is sin π 4 e 1 / 2 ≈ 1.166 . Definition 8 records Kadakal’s original class for context and is not used elsewhere in the paper; the weights actually used in Definitions 10 and 12 and in Theorems 1–4 are those of Definition 9, restricted to R 0 + -valued functions as required for the fuzzy and Prabhakar constructions below.
Definition 10.
Let J ⊂ ( 0 , ∞ ) be a p-convex set, p ∈ R ∖ { 0 } and s ∈ ( 0 , 1 ] . A function f : J → R 0 + is a modified exponential trigonometric ( p , s ) -convex function, briefly a MET- ( p , s ) -convex function if
f t a 1 p + ( 1 − t ) b 1 p 1 / p ≤ sin π t 2 e 1 − t s f ( a 1 ) + cos π t 2 e t s f ( b 1 )
for all a 1 , b 1 ∈ J and t ∈ [ 0 , 1 ] ; if the inequality is reversed, f is MET- ( p , s ) -concave. Although p ∈ R ∖ { 0 } is allowed in this definition, every theorem of the paper (Theorems 1–4) is stated only for p > 0 ; the case p < 0 is not used and is left open for future work.
Remark 2.
Definition 10 unifies several known classes: (i) for p = 1 , s = 1 it reduces to the modified exponential trigonometric convex function of Definition [9]; (ii) for s = 1 it gives the modified exponential trigonometric p-convex function; (iii) for p = 1 it gives the modified exponential trigonometric s-convex function. Moreover, since x ↦ x s is concave on ( 0 , 1 ] and sin π t 2 e 1 − t + cos π t 2 e t ≤ 2 e 1 / 2 on [ 0 , 1 ] ,
sin π t 2 e 1 − t s + cos π t 2 e t s ≤ 2 1 − s 2 e s 2 = 2 e 2 s / 2 ,
which is the estimate used in Section 3.
Remark 3.
The weights ω 1 ( t ) = [ sin π t 2 e 1 − t ] s and ω 2 ( t ) = [ cos π t 2 e t ] s are chosen because they satisfy: (i) endpoint consistency with classical convexity, ω 1 ( 0 ) = ω 2 ( 1 ) = 0 , ω 1 ( 1 ) = ω 2 ( 0 ) = 1 ; (ii) reflection symmetry t ↦ 1 − t , needed to combine the two applications in the proof of Theorem 1; (iii) interior surplus ω 1 ( t ) + ω 2 ( t ) ≤ 2 1 − s / 2 e s / 2 (equality at t = 1 2 , s = 1 , where the value is 2 e 1 / 2 ), which is strictly greater than 1 on ( 0 , 1 ) . This excess is what admits non-convex mappings; the parameter s controls its size and p controls the geometry of the domain.
Definition 11.
Let L ⊆ R be an invex set with respect to ζ : K × K → R . A function f : K → R 0 + is a modified exponential trigonometric preconvex function with respect to ζ if, for all a 1 , b 1 ∈ K and t ∈ [ 0 , 1 ] ,
f a 1 + t ζ ( b 1 , a 1 ) ≤ sin π t 2 e 1 − t f ( a 1 ) + cos π t 2 e t f ( b 1 ) .
Definition 12.
Let p ∈ R ∖ { 0 } (as in Definition 10), let ζ : K × K → R be such that ζ ( ν , μ ) = ν p − μ p > 0 for μ , ν ∈ K with μ < ν , so that L = μ p , μ p + ζ ( ν , μ ) is an invex set in the p-power domain, and let s ∈ ( 0 , 1 ] . A function f : K → R 0 + is a MET- ( p , s ) -preinvex function with respect to ζ if
f μ p + t ζ ( ν , μ ) 1 / p ≤ cos π t 2 e t s f ( μ ) + sin π t 2 e 1 − t s f ( ν )
for all μ , ν ∈ K and t ∈ [ 0 , 1 ] . At t = 0 we have an equality: the argument is equal to μ and the right-hand side reduces to f ( μ ) (weight 1 at t = 0 on f ( μ ) ), and at t = 1 we have an equality as well: the argument is equal to ν (since μ p + ζ ( ν , μ ) = ν p ) , and the right-hand side reduces to f ( ν ) (weight 1 at t = 1 on f ( ν ) ). definition (which tied the two weights as the opposite way round, and caused the inequalities f ( a 1 ) ≤ f ( b 1 ) and f ( b 1 ) ≤ f ( a 1 ) to hold up for all admissible pairs). With a 1 = ν , b 1 = μ , the argument ( ( 1 − t ) μ p + t ν p ) 1 / p and the weight assignment (cosine-term on f ( μ ) , sine-term on f ( ν ) ) match Definition 10 term for term under a 1 ↔ ν , b 1 ↔ μ : Definition 12 is an exact preinvex restatement of With the same weights and the same p and this is the definition in the following Theorems 2–4 below.
Although the preceding classes are real-valued, many applications of Prabhakar operators involve imprecise data (e.g., fitted parameters in the Havriliak–Negami model [37]). To incorporate this uncertainty we work with fuzzy numbers, represented as nested families of intervals indexed by the confidence level ℓ ∈ ( 0 , 1 ] . Since all concepts are introduced level-wise, every fuzzy statement corresponds to a pair of real statements on the endpoint functions f ∗ ( · , ℓ ) and f ∗ ( · , ℓ ) .
Definition 13
([38,39]). A mapping Λ : R → [ 0 , 1 ] is called a fuzzy number, written Λ ∈ F 0 , if it is normal, upper semicontinuous, fuzzy convex (i.e., Λ ( t x + ( 1 − t ) y ) ≥ min { Λ ( x ) , Λ ( y ) } ), and the closure of { x : Λ ( x ) > 0 } is compact.
Definition 14
([38,39]). Let Λ ∈ F 0 . For ℓ ∈ ( 0 , 1 ] the ℓ-level set (or ℓ-cut) of Λ is
Λ ℓ = { x ∈ R : Λ ( x ) ≥ ℓ } = [ Λ ∗ ( ℓ ) , Λ ∗ ( ℓ ) ] ,
a closed bounded interval; Λ ∗ ( ℓ ) and Λ ∗ ( ℓ ) are the left and right end-point functions.
Definition 15
([39,40]). Let Λ , Υ ∈ F 0 with ℓ-cuts Λ ℓ = [ Λ ∗ , Λ ∗ ] , Υ ℓ = [ Υ ∗ , Υ ∗ ] and κ ∈ R . The fuzzy sum + ˜ and scalar multiplication are defined level-wise by
Λ + ˜ Υ ℓ = Λ ∗ + Υ ∗ , Λ ∗ + Υ ∗ , ( κ Λ ) ℓ = [ κ Λ ∗ , κ Λ ∗ ] , κ ≥ 0 , [ κ Λ ∗ , κ Λ ∗ ] , κ < 0 ,
so that the endpoints are reordered, and not simply rescaled, when κ < 0 ; this matches the usual level-wise definition of scalar multiplication for interval-valued and fuzzy numbers [39,40]. The fuzzy order relation ⪯ is defined by Λ ⪯ Υ iff Λ ∗ ( ℓ ) ≤ Υ ∗ ( ℓ ) and Λ ∗ ( ℓ ) ≤ Υ ∗ ( ℓ ) for all ℓ ∈ ( 0 , 1 ] ; it is a partial order on F 0 .
Definition 16
([24,40]). A mapping f : [ μ , ν ] → F 0 is a fuzzy-interval-valued function (F-I-V-F). For each ℓ ∈ ( 0 , 1 ] its ℓ-cut is f ℓ ( x ) = [ f ∗ ( x , ℓ ) , f ∗ ( x , ℓ ) ] . The F-I-V-F f is fuzzy Riemann integrable on [ μ , ν ] if f ∗ ( · , ℓ ) and f ∗ ( · , ℓ ) are Riemann integrable for every ℓ, and then
∫ μ ν f ( x ) d x ℓ = ∫ μ ν f ∗ ( x , ℓ ) d x , ∫ μ ν f ∗ ( x , ℓ ) d x .
Definition 17.
Let J ⊂ ( 0 , ∞ ) be a p-convex set and s ∈ ( 0 , 1 ] . A F-I-V-F f : J → F 0 is a MET- ( p , s ) -convex F-I-V-F if
f t a 1 p + ( 1 − t ) b 1 p 1 / p ⪯ sin π t 2 e 1 − t s f ( a 1 ) + ˜ cos π t 2 e t s f ( b 1 )
for all a 1 , b 1 ∈ J and t ∈ [ 0 , 1 ] . Equivalently, by Definition 15, f is a MET- ( p , s ) -convex F-I-V-F if and only if, for every ℓ ∈ ( 0 , 1 ] , both end-point functions f ∗ ( · , ℓ ) and f ∗ ( · , ℓ ) are MET- ( p , s ) -convex in the sense of Definition 10.
Definition 18
([3,24,41]). Let α > 0 , β > 0 , [ ρ > 0 , λ ≥ 0 ] and let f : [ a , b ] → F 0 be a F-I-V-F whose end-point functions are Lebesgue integrable for every ℓ ∈ ( 0 , 1 ] . The left- and right-sided Prabhakar fuzzy fractional integral operators are defined level-wise by
M ρ , λ , a + α , β f ( x ) ℓ = M ρ , λ , a + α , β f ∗ ( x , ℓ ) , M ρ , λ , a + α , β f ∗ ( x , ℓ ) , x ∈ ( a , b ] ,
where
M ρ , λ , a + α , β f ∗ ( x , ℓ ) = ∫ a x ( x − t ) β − 1 E α , β ρ λ ( x − t ) α f ∗ ( t , ℓ ) d t ,
and analogously for the right-sided operator on [ a , b ) and for f ∗ ( · , ℓ ) . [Throughout the paper we restrict to ρ > 0 and λ ≥ 0 (together with the standing assumptions α > 0 , β > 0 ). Under this restriction every term of the series E α , β ρ ( λ w α ) = ∑ n = 0 ∞ ( ρ ) n λ n Γ ( α n + β ) n ! w α n is nonnegative for w ≥ 0 , since ( ρ ) n > 0 for ρ > 0 ; this elementary termwise argument is a special case of the wider complete-monotonicity theory for the Prabhakar function, see e.g., [42]. Under this restriction, ] Since ( x − t ) β − 1 E α , β ρ ( λ ( x − t ) α ) ≥ 0 and f ∗ ≤ f ∗ , both operators map F-I-V-Fs to F-I-V-Fs.
Remark 4.
Throughout Section 3 and Section 4 the primed parameter λ ′ in the Prabhakar fuzzy fractional integral operators is the value after rescaling
λ ′ = λ h α ,
This is because it is an interval of length h > 0 that changes as the variable is applied on the following line: h = ν p − μ p , in Theorem 1, h = ζ ( ν , μ ) in Lemma 1, and in Theorems 2–4. The term “rescaling” has been introduced because the proofs use the substitution w = ( x − t ) / h that transforms the kernel w β − 1 E α , β ρ ( λ w α ) into h − ( β − 1 ) ( x − t ) β − 1 E α , β ρ λ ( x − t ) α / h α , which coincides with Definition 18 exactly when λ is replaced by λ / h α .

3. On the (H-H)-Type Inequalities Using the Prabhakar FIV-Functions Presented with MET- ( p , s ) -Convexity

A new class of Prabhakar FIV-functions with the convexity property consistent with the MET- ( p , s ) -convexity is defined in this section. We derive (H-H)-type inequalities and discuss their applications using these specific Prabkakar FIV-functions.
Theorem 1.
Let p > 0 , s ∈ ( 0 , 1 ] , α > 0 , β > 0 and ρ > 0 , λ ≥ 0 . Let J ⊂ ( 0 , ∞ ) be a p-convex set and let μ , ν ∈ J with 0 < μ < ν . Suppose that f : J → F 0 is a MET- ( p , s ) -convex F-I-V-F in the sense of Definition 17, and that
f p : [ μ p , ν p ] → F 0 , f p ( u ) : = f u 1 / p ,
is fuzzy integrable on [ μ p , ν p ] . Then, for every ℓ ∈ ( 0 , 1 ] ,
1 2 f μ p + ν p 2 1 / p E α , β + 1 ρ ( λ ) ⪯ e 2 s / 2 2 ( ν p − μ p ) β M ρ , λ ′ , ( μ p ) + α , β f p ( ν p , ℓ ) + ˜ M ρ , λ ′ , ( ν p ) − α , β f p ( μ p , ℓ ) ⪯ e 2 s f ( μ ) + ˜ f ( ν ) E α , β + 1 ρ ( λ ) .
Proof. 
Throughout, ζ : = ν p − μ p > 0 .Fix ℓ ∈ ( 0 , 1 ] and prove (22) for the lower end-point function f ∗ : = f ∗ ( · , ℓ ) ; the computed value for f ∗ ( · , ℓ ) is word for word the same, and by Definition 17 both end-point functions are MET- ( p , s ) -convex in the sense of Definition 10. The fuzzy statement (22) then follows from Definition 15, since the order relation ⪯ is defined level-wise. We write f p , ∗ ( u ) = f ∗ ( u 1 / p ) .
(a) Integrating the defining series termwise (it converges uniformly on [ 0 , 1 ] ) and using Γ ( α n + β + 1 ) = ( α n + β ) Γ ( α n + β ) ,
∫ 0 1 w β − 1 E α , β ρ ( λ w α ) d w = ∑ n = 0 ∞ ( ρ ) n λ n Γ ( α n + β ) n ! · 1 α n + β = ∑ n = 0 ∞ ( ρ ) n λ n Γ ( α n + β + 1 ) n ! = E α , β + 1 ρ ( λ ) .
(b) Since x ↦ x s is concave on ( 0 , 1 ] , for every A , B ≥ 0 one has A s + B s ≤ 2 1 − s ( A + B ) s . Applying this with A = sin π w 2 e 1 − w , B = cos π w 2 e w and using A + B ≤ 2 e 1 / 2 on [ 0 , 1 ] gives, for every w ∈ [ 0 , 1 ] and s ∈ ( 0 , 1 ] ,
sin π w 2 e 1 − w s + cos π w 2 e w s ≤ 2 1 − s 2 e s 2 = 2 e 2 s / 2 ,
with equality at s = 1 , w = 1 2 (where the value is 2 e 1 / 2 ).
Fix w ∈ [ 0 , 1 ] and set
a 1 = w μ p + ( 1 − w ) ν p 1 / p , b 1 = ( 1 − w ) μ p + w ν p 1 / p ,
which belong to J because J is a p-convex set. Since 1 2 a 1 p + 1 2 b 1 p = 1 2 ( μ p + ν p ) , Definition 10 applied with t = 1 2 gives (recall sin π 4 = cos π 4 = 2 − 1 / 2 )
f ∗ μ p + ν p 2 1 / p ≤ 2 − 1 / 2 e 1 / 2 s f ∗ ( a 1 ) + f ∗ ( b 1 ) = e 2 s / 2 f ∗ ( a 1 ) + f ∗ ( b 1 ) ,
that is,
f ∗ μ p + ν p 2 1 / p ≤ e 2 s / 2 f p , ∗ w μ p + ( 1 − w ) ν p + f p , ∗ ( 1 − w ) μ p + w ν p .
Multiplying (26) by w β − 1 E α , β ρ ( λ w α ) ≥ 0 and integrating over w ∈ [ 0 , 1 ] , the left-hand side becomes f ∗ ( ( μ p + ν p 2 ) 1 / p ) E α , β + 1 ρ ( λ ) by (23). For the right-hand side, the substitution u = w μ p + ( 1 − w ) ν p , i.e., w = ( ν p − u ) / ζ , d w = − d u / ζ , gives
∫ 0 1 w β − 1 E α , β ρ ( λ w α ) f p , ∗ w μ p + ( 1 − w ) ν p d w = 1 ζ β M ρ , λ ′ , ( μ p ) + α , β f p , ∗ ( ν p , ℓ ) ,
while the substitution u = ( 1 − w ) μ p + w ν p , i.e., w = ( u − μ p ) / ζ , d w = d u / ζ , gives
∫ 0 1 w β − 1 E α , β ρ ( λ w α ) f p , ∗ ( 1 − w ) μ p + w ν p d w = 1 ζ β M ρ , λ ′ , ( ν p ) − α , β f p , ∗ ( μ p , ℓ ) ,
both by Definition 18 and the Remark following it. Therefore
f ∗ μ p + ν p 2 1 / p E α , β + 1 ρ ( λ ) ≤ ( e / 2 ) s / 2 ζ β M ρ , λ ′ , ( μ p ) + α , β f p , ∗ ( ν p , ℓ ) + M ρ , λ ′ , ( ν p ) − α , β f p , ∗ ( μ p , ℓ ) ,
and dividing by 2 yields the first inequality of (22) for f ∗ .
(c) Applying Definition 10 with a 1 = μ , b 1 = ν and t = w ,
f p , ∗ w μ p + ( 1 − w ) ν p ≤ sin π w 2 e 1 − w s f ∗ ( μ ) + cos π w 2 e w s f ∗ ( ν ) ,
and with a 1 = ν , b 1 = μ and t = w ,
f p , ∗ ( 1 − w ) μ p + w ν p ≤ sin π w 2 e 1 − w s f ∗ ( ν ) + cos π w 2 e w s f ∗ ( μ ) .
Adding (30) and (31) and using (24),
f p , ∗ w μ p + ( 1 − w ) ν p + f p , ∗ ( 1 − w ) μ p + w ν p ≤ 2 e 2 s / 2 f ∗ ( μ ) + f ∗ ( ν ) .
Multiplying (32) by w β − 1 E α , β ρ ( λ w α ) , integrating over w ∈ [ 0 , 1 ] and using (23), (27) and (28),
1 ζ β M ρ , λ ′ , ( μ p ) + α , β f p , ∗ ( ν p , ℓ ) + M ρ , λ ′ , ( ν p ) − α , β f p , ∗ ( μ p , ℓ ) ≤ 2 e 2 s / 2 f ∗ ( μ ) + f ∗ ( ν ) E α , β + 1 ρ ( λ ) .
Multiplying both sides of (33) by the middle-term coefficient 1 2 ( e / 2 ) s / 2 > 0 and using 1 2 ( e / 2 ) s / 2 · 2 ( e / 2 ) s / 2 = ( e / 2 ) s ,
( e / 2 ) s / 2 2 ζ β M ρ , λ ′ , ( μ p ) + α , β f p , ∗ ( ν p , ℓ ) + M ρ , λ ′ , ( ν p ) − α , β f p , ∗ ( μ p , ℓ ) ≤ e 2 s f ∗ ( μ ) + f ∗ ( ν ) E α , β + 1 ρ ( λ ) ,
which is the second inequality of (22) for f ∗ . Repeating steps (b) and (c) for f ∗ ( · , ℓ ) and combining the two end-points by means of Definition 15 gives (22). □
Remark 5.
The pointwise estimate (24) is attained at s = 1 , w = 1 2 ; this shows that the constant 2 ( e / 2 ) s / 2 used in step(b)of the proof cannot be lowered for every s ∈ ( 0 , 1 ] , but it does not by itself establish that the resulting integral bound ( e / 2 ) s in (22) is globally sharp, since equality would also require f ∗ ( a 1 ) = f ∗ ( b 1 ) at every w. The pointwise weight estimate is therefore sharp at s = 1 , but global sharpness of the integral inequality is not claimed.] For s ∈ ( 0 , 1 ) the midpoint constant ( e / 2 ) s / 2 is used exactly, so both inequalities of (22) are valid for every s ∈ ( 0 , 1 ] .
At p = 1 and s = 1 , Definition 10 keeps the weights sin π t 2 e 1 − t and cos π t 2 e t , which do not reduce to the classical weights t and 1 − t ; consequently (22) does not collapse to the unweighted classical Hermite–Hadamard inequality even at p = s = 1 . What is recovered, from (25)–(34) with p = 1 , s = 1 , is the classical two-sided structure in E α , β + 1 ρ ( λ ) -weighted form,
1 2 f μ + ν 2 E α , β + 1 ρ ( λ ) ⪯ ( e / 2 ) 1 / 2 2 ζ β M ρ , λ ′ , μ + α , β f ( ν , ℓ ) + ˜ M ρ , λ ′ , ν − α , β f ( μ , ℓ ) ⪯ e 2 f ( μ ) + ˜ f ( ν ) E α , β + 1 ρ ( λ ) ,
in which the exponential-trigonometric constants ( e / 2 ) 1 / 2 and e / 2 remain, because the weights sin π t 2 e 1 − t , cos π t 2 e t never equal the classical weights t, 1 − t for any t ∈ ( 0 , 1 ) . The exact unweighted classical Hermite–Hadamard inequality (1) is therefore not literally recovered as a special case p = s = 1 of (22): what is recovered is the weighted structure displayed above, together with the convexity class of Definition 9 at the level of Remark 2(i).

4. On the Trapezoid-Type Inequalities Using Prabhakar FIV-Functions Characterized by the MET- ( p , s ) -Preinvexity Property

Throughout this section p ∈ R ∖ { 0 } is as in Definition 10, L = [ μ p , μ p + ζ ( ν , μ ) ] is an invex set with respect to ζ : K × K → R with ζ ( ν , μ ) = ν p − μ p > 0 , and we abbreviate ζ : = ζ ( ν , μ ) , so that μ p + ζ = ν p . We also write g ( u ) : = f ( u 1 / p ) (as in (21)) for the auxiliary function on the p-power domain, and λ ′ : = λ / ζ α as in Remark 4.
Remark 6.
A F-I-V-F f : K → F 0 is called differentiable, with derivative f ′ , if for every ℓ ∈ ( 0 , 1 ] the end-point functions f ∗ ( · , ℓ ) and f ∗ ( · , ℓ ) are differentiable and [ f ′ ( x ) ] ℓ = [ f ∗ ′ ( x , ℓ ) , f ∗ ′ ( x , ℓ ) ] is the ℓ-cut of a fuzzy number. The absolute value of a fuzzy interval [ a , b ] is defined, as usual, as the ℓ-cut image | [ a , b ] | = { | x | : x ∈ [ a , b ] } , which equals [ a , b ] when a ≥ 0 , equals [ − b , − a ] when b ≤ 0 , and equals [ 0 , max ( − a , b ) ] when a < 0 < b . Throughout the paper, it is assumed that the derivative f ′ satisfies f ∗ ′ ( x , ℓ ) ≥ 0 for all ℓ ∈ ( 0 , 1 ] (or equivalently the interval [ f ′ ( x ) ] ℓ is non-negative for all ℓ ∈ ( 0 , 1 ] ), which is a standing hypothesis in Theorems 2–4. Under it, the general definition above reduces to the level-wise formula | f ′ ( x ) | ℓ = [ | f ∗ ′ ( x , ℓ ) | , | f ∗ ′ ( x , ℓ ) | ] and its q-th power ( q ≥ 1 ), consistent with Definition 15. For instance, under the general definition, the cut [ − 2 , − 1 ] (all negative) yields the cut [ 1 , 2 ] , whereas the cut [ − 1 , 2 ] (crossing zero) yields the cut [ 0 , 2 ] ; the simple level-wise formula above is used only when the cut is already non-negative. Throughout the paper we distinguish four situations precisely: a result recovers exactly an earlier inequality when the constants and weights coincide after substitution; it contains it as a special case when the earlier inequality is obtained by fixing parameter values, possibly with different but explicitly stated constants; it generalizes the admissible function class when it applies to mappings, such as f ( x ) = x on [ 1 , 2 ] , that the earlier theory does not cover; and it provides a different but valid bound when both theories apply to the same mapping, but the constants are not comparable in general. As shown in Remark 5 and Section 5.7, Theorem 1 contains as a special case the Riemann–Liouville and crisp limits summarized in Section 5.7 (see the parameter-reduction table there), generalizes the admissible function class relative to the classical Hermite–Hadamard inequality, and, on mappings where both theories apply, gives a different (weaker) but valid bound; it does not claim to recover exactly or to improve the classical inequality.
Lemma 1.
Let f : K → F 0 be such that g : = f p is a differentiable F-I-V-F whose derivative g ′ is fuzzy integrable on [ μ p , ν p ] . Let α > 0 , ρ > 0 , λ ≥ 0 and β > 1 . The identity below is interpreted level-wise: for any ℓ ∈ ( 0 , 1 ] , the second identity is a real number identity, the fourth is a real number identity, and the two real number identities are interpreted level-wise as a fuzzy statement in the sense of Definition 17 (no fuzzy subtraction of F 0 quantities is used). Then, for every ℓ ∈ ( 0 , 1 ] ,
f ( μ ) + ˜ f ( ν ) 2 E α , β ρ ( λ ) − M ρ , λ ′ , ( ν p ) − α , β − 1 g ( μ p , ℓ ) + ˜ M ρ , λ ′ , ( μ p ) + α , β − 1 g ( ν p , ℓ ) 2 ζ β − 1 = ζ 2 I ,
where
I = ∫ 0 1 w β − 1 E α , β ρ ( λ w α ) − ( 1 − w ) β − 1 E α , β ρ λ ( 1 − w ) α g ′ ( μ p + w ζ ) d w .
Proof. 
Fix ℓ ∈ ( 0 , 1 ] and prove the identity for g : = g ∗ ( · , ℓ ) (the endpoint function of f p , ∗ ); the computation for g ∗ ( · , ℓ ) is the same, and (35) then follows by Definition 17, using g ( μ p ) = f ( μ ) and g ( ν p ) = f ( ν ) . Differentiating the defining series termwise and using Γ ( α n + β ) = ( α n + β − 1 ) Γ ( α n + β − 1 ) gives the key relation
d d w w β − 1 E α , β ρ ( λ w α ) = ∑ n = 0 ∞ ( ρ ) n λ n ( α n + β − 1 ) Γ ( α n + β ) n ! w α n + β − 2 = w β − 2 E α , β − 1 ρ ( λ w α ) ,
and, since β > 1 ,
lim w → 0 + w β − 1 E α , β ρ ( λ w α ) = 0 .
Integrating by parts and using (37), (38) and the substitution t = μ p + w ζ ,
∫ 0 1 w β − 1 E α , β ρ ( λ w α ) g ′ ( μ p + w ζ ) d w = w β − 1 E α , β ρ ( λ w α ) ζ g ( μ p + w ζ ) 0 1 − 1 ζ ∫ 0 1 w β − 2 E α , β − 1 ρ ( λ w α ) g ( μ p + w ζ ) d w = f ( ν ) ζ E α , β ρ ( λ ) − ζ − β M ρ , λ ′ , ( ν p ) − α , β − 1 g ( μ p , ℓ ) .
Replacing w by 1 − w in (37) and (38) gives, in the same way,
∫ 0 1 ( 1 − w ) β − 1 E α , β ρ λ ( 1 − w ) α g ′ ( μ p + w ζ ) d w = − f ( μ ) ζ E α , β ρ ( λ ) + ζ − β M ρ , λ ′ , ( μ p ) + α , β − 1 g ( ν p , ℓ ) .
Subtracting the two identities and multiplying by ζ / 2 gives (35). □
Remark 7.
The hypothesis β > 1 is essential: it is exactly the condition (38) under which the boundary terms of the two integrations by parts vanish. For β ≤ 1 these terms are unbounded and the identity (35) fails; consequently the estimates of Theorems 2–4 below, which all follow from Lemma 1, hold only for β > 1 .
Throughout the rest of the section we abbreviate the kernel difference by
K ( w ) : = w β − 1 E α , β ρ ( λ w α ) − ( 1 − w ) β − 1 E α , β ρ λ ( 1 − w ) α , w ∈ [ 0 , 1 ] ,
and we record the elementary estimate on which the three theorems rest.
Lemma 2.
For every w ∈ [ 0 , 1 ] and every s ∈ ( 0 , 1 ] ,
max sin π w 2 e ( 1 − w ) s , cos π w 2 e ( w ) s ≤ sin π w 2 + cos π w 2 e w .
Proof. 
Since 0 ≤ cos π w 2 ≤ sin π w 2 + cos π w 2 and e w ≥ 1 on [ 0 , 1 ] , the quantity cos π w 2 e w is at most ( sin π w 2 + cos π w 2 ) e w , and the same holds for sin π w 2 e ( 1 − w ) because sin π w 2 e 1 − 2 w ≤ sin π w 2 + cos π w 2 on [ 0 , 1 ] . Both majorants are ≥ 1 at w = 0 and the map x ↦ x s is increasing with x s ≤ max { 1 , x } for s ∈ ( 0 , 1 ] , which gives (42). □
Remark 8.
Estimate (42) replaces the step “ e 1 − w ≤ e w ”, which is false on [ 0 , 1 2 ) (at w = 0 it reads e ≤ 1 ). The correct comparison is the one above, which holds on the whole of [ 0 , 1 ] and for every s ∈ ( 0 , 1 ] ; it is what produces the factor ( sin π w 2 + cos π w 2 ) e w in Theorems 2–4.
Theorem 2.
Let f : K → F 0 be such that g : = f p is a differentiable F-I-V-F and | g ′ | is MET- ( s ) -preinvex on [ μ p , ν p ] in the sense of Definition 12 with p = 1 (i.e., | g ′ ( μ p + t ζ ) | ≤ [ cos π t 2 e t ] s | g ′ ( μ p ) | + [ sin π t 2 e 1 − t ] s | g ′ ( ν p ) | for every t ∈ [ 0 , 1 ] ), f ∗ ′ ( x , ℓ ) ≥ 0 for every ℓ ∈ ( 0 , 1 ] (Remark 6), and let α > 0 , β > 1 , s ∈ ( 0 , 1 ] . Then
f ( μ ) + ˜ f ( ν ) 2 E α , β ρ ( λ ) − M ρ , λ ′ , ( ν p ) − α , β − 1 g ( μ p , ℓ ) + ˜ M ρ , λ ′ , ( μ p ) + α , β − 1 g ( ν p , ℓ ) 2 ζ β − 1 ⪯ ζ 2 1 p μ 1 − p | f ′ ( μ ) | + ˜ 1 p ν 1 − p | f ′ ( ν ) | ∫ 0 1 | K ( w ) | sin π w 2 + cos π w 2 e w d w .
Proof. 
Fix ℓ ∈ ( 0 , 1 ] and argue for g ∗ : = g ∗ ( · , ℓ ) , the lower endpoint function of g = f p . By Lemma 1 and the triangle inequality,
ζ 2 ∫ 0 1 K ( w ) g ∗ ′ ( μ p + w ζ ) d w ≤ ζ 2 ∫ 0 1 | K ( w ) | | g ∗ ′ ( μ p + w ζ ) | d w .
The MET- ( s ) -preinvexity of | g ∗ ′ | gives, for every w ∈ [ 0 , 1 ] ,
| g ∗ ′ ( μ p + w ζ ) | ≤ cos π w 2 e ( w ) s | g ∗ ′ ( μ p ) | + sin π w 2 e ( 1 − w ) s | g ∗ ′ ( ν p ) | ,
and by Lemma 2 both coefficients are bounded by ( sin π w 2 + cos π w 2 ) e w , so that
| g ∗ ′ ( μ p + w ζ ) | ≤ sin π w 2 + cos π w 2 e w | g ∗ ′ ( μ p ) | + | g ∗ ′ ( ν p ) | .
By the chain rule, g ∗ ′ ( μ p ) = 1 p μ 1 − p f ∗ ′ ( μ ) and g ∗ ′ ( ν p ) = 1 p ν 1 − p f ∗ ′ ( ν ) , so (46) reads | g ∗ ′ ( μ p + w ζ ) | ≤ ( sin π w 2 + cos π w 2 ) e w 1 p μ 1 − p | f ∗ ′ ( μ ) | + 1 p ν 1 − p | f ∗ ′ ( ν ) | . Substituting into (44) gives (43) for g ∗ (equivalently f ∗ , since g ∗ ( μ p ) = f ∗ ( μ ) , g ∗ ( ν p ) = f ∗ ( ν ) ). The same computation for g ∗ ( · , ℓ ) , combined by Definition 17, completes the proof. □
Theorem 3.
Under the hypotheses of Theorem 2, let q > 1 and let r = q / ( q − 1 ) be its conjugate exponent, so that 1 r + 1 q = 1 . If | g ′ | q is MET- ( s ) -preinvex on [ μ p , ν p ] (with p = 1 as in Theorem 2), then
f ( μ ) + ˜ f ( ν ) 2 E α , β ρ ( λ ) − M ρ , λ ′ , ( ν p ) − α , β − 1 g ( μ p , ℓ ) + ˜ M ρ , λ ′ , ( μ p ) + α , β − 1 g ( ν p , ℓ ) 2 ζ β − 1 ⪯ ζ 2 1 p μ 1 − p q | f ′ ( μ ) | q + ˜ 1 p ν 1 − p q | f ′ ( ν ) | q 1 q ( ∫ 0 1 | K ( w ) | r d w ) 1 r ( ∫ 0 1 sin π w 2 + cos π w 2 e w d w ) 1 q .
Proof. 
Fix ℓ ∈ ( 0 , 1 ] and argue for g ∗ . Starting from (44) and applying Hölder’s inequality with the pair ( r , q ) ,
ζ 2 ∫ 0 1 | K ( w ) | | g ∗ ′ ( μ p + w ζ ) | d w ≤ ζ 2 ∫ 0 1 | K ( w ) | r d w 1 r ∫ 0 1 | g ∗ ′ ( μ p + w ζ ) | q d w 1 q .
The MET- ( s ) -preinvexity of | g ∗ ′ | q together with Lemma 2 gives
∫ 0 1 | g ∗ ′ ( μ p + w ζ ) | q d w ≤ | g ∗ ′ ( μ p ) | q + | g ∗ ′ ( ν p ) | q ∫ 0 1 sin π w 2 + cos π w 2 e w d w ,
and, as in Theorem 2, | g ∗ ′ ( μ p ) | q = ( 1 p μ 1 − p ) q | f ∗ ′ ( μ ) | q and | g ∗ ′ ( ν p ) | q = ( 1 p ν 1 − p ) q | f ∗ ′ ( ν ) | q , and substituting this into the previous display yields (47) for g ∗ . Combining the two levels as before completes the proof. □
Theorem 4.
Under the hypotheses of Theorem 2, let q ≥ 1 and suppose that | g ′ | q is MET- ( s ) -preinvex on [ μ p , ν p ] . Then
f ( μ ) + ˜ f ( ν ) 2 E α , β ρ ( λ ) − M ρ , λ ′ , ( ν p ) − α , β − 1 g ( μ p , ℓ ) + ˜ M ρ , λ ′ , ( μ p ) + α , β − 1 g ( ν p , ℓ ) 2 ζ β − 1 ⪯ ζ 2 1 p μ 1 − p q | f ′ ( μ ) | q + ˜ 1 p ν 1 − p q | f ′ ( ν ) | q 1 q θ 1 − 1 q ∫ 0 1 | K ( w ) | sin π w 2 + cos π w 2 e w d w 1 q ,
where
θ : = ∫ 0 1 | K ( w ) | d w = 2 E α , β + 1 ρ ( λ ) − 1 2 β − 1 E α , β + 1 ρ λ 1 2 α .
Proof. 
Fix ℓ ∈ ( 0 , 1 ] and argue for g ∗ . Starting from (44) and applying the power-mean inequality,
ζ 2 ∫ 0 1 | K ( w ) | | g ∗ ′ ( μ p + w ζ ) | d w ≤ ζ 2 ∫ 0 1 | K ( w ) | d w 1 − 1 q ∫ 0 1 | K ( w ) | | g ∗ ′ ( μ p + w ζ ) | q d w 1 q .
The MET- ( s ) -preinvexity of | g ∗ ′ | q together with Lemma 2 bounds the second integral by
| g ∗ ′ ( μ p ) | q + | g ∗ ′ ( ν p ) | q ∫ 0 1 | K ( w ) | sin π w 2 + cos π w 2 e w d w ,
and, as before, | g ∗ ′ ( μ p ) | q = ( 1 p μ 1 − p ) q | f ∗ ′ ( μ ) | q , | g ∗ ′ ( ν p ) | q = ( 1 p ν 1 − p ) q | f ∗ ′ ( ν ) | q . It remains to evaluate θ . Since β > 1 , the map w ↦ w β − 1 E α , β ρ ( λ w α ) is nondecreasing on [ 0 , 1 ] by (37), so K ( w ) ≤ 0 on [ 0 , 1 2 ] and K ( w ) ≥ 0 on [ 1 2 , 1 ] ; moreover K ( 1 − w ) = − K ( w ) , whence θ = 2 ∫ 1 / 2 1 K ( w ) d w . By (37), w β E α , β + 1 ρ ( λ w α ) is an antiderivative of w β − 1 E α , β ρ ( λ w α ) , so
∫ 1 / 2 1 w β − 1 E α , β ρ ( λ w α ) d w = E α , β + 1 ρ ( λ ) − 1 2 β E α , β + 1 ρ λ 1 2 α , ∫ 1 / 2 1 ( 1 − w ) β − 1 E α , β ρ λ ( 1 − w ) α d w = ∫ 0 1 / 2 v β − 1 E α , β ρ ( λ v α ) d v = 1 2 β E α , β + 1 ρ λ 1 2 α .
Subtracting and multiplying by 2 gives (51), and the proof is completed as before. □
Remark 9.
For q = 1 the bound of Theorem 4 coincides with that of Theorem 2, and by the power-mean inequality the estimate (50) is never worse than (43). This is confirmed numerically in Section 5, where B 4.3 ≤ B 4.2 ≤ B 4.1 is observed uniformly on the parameter region considered.

5. Numerical Examples and Graphical Illustrations

Here we illustrate Theorems 1–3 using a sequence of numerical experiments. These experiments are illustrations and consistency checks for the specific parameter values reported below; the validity of the theorems rests on the analytic proofs of Section 3 and Section 4. It is logical to consider a F-I-V-F whose ℓ-cuts are non-degenerate, and then examine the impact of the parameters on the representatives in the crisp level sets, because by Definition 17 a F-I-V-F is MET- ( p , s ) -convex when both of its end-point functions are ℓ-cut. The generalized (Prabhakar) Mittag–Leffler kernel
E α , β ρ ( z ) = ∑ n = 0 ∞ ( ρ ) n Γ ( α n + β ) z n n ! , ( ρ ) n = Γ ( ρ + n ) Γ ( ρ ) ,
is evaluated by direct summation of its defining series, and the Prabhakar fractional integrals appearing in the theorem statements are calculated by adaptive Gauss–Kronrod quadrature. The defining series is truncated once the added term falls below 10 − 12 in absolute value (never more than 80 terms in any example reported below); the quadrature routine uses a relative tolerance of 10 − 10 and an absolute tolerance of 10 − 12 . As an independent cross-check, all the values reported in the table of test-mapping chains later in this section were recomputed at 30-digit working precision with series summed to a term-wise precision of 10 − 35 , and integrals computed by adaptive quadrature to the same working precision, and were found to agree to the four significant figures reported with those in that table. Unless stated otherwise, we fix ρ = 1 , λ = 0.5 and [ μ , ν ] = [ 1 , 2 ] ; here f p ( u ) = f ( u 1 / p ) as in (21). We use the family of convex, non-negative test mappings
f 1 ( x ) = x 2 , f 2 ( x ) = x 3 , f 3 ( x ) = e x , f 4 ( x ) = x 4 , f 5 ( x ) = cosh x .

5.1. A Fuzzy-Interval-Valued Example

Let f : [ 1 , 2 ] → F 0 be the F-I-V-F whose ℓ-cuts are
f ℓ ( x ) = f ∗ ( x , ℓ ) , f ∗ ( x , ℓ ) = ℓ x 2 , ( 2 − ℓ ) x 3 , ℓ ∈ ( 0 , 1 ] .
This is a well-defined F-I-V-F in the sense of Definition 16: for each x ∈ [ 1 , 2 ] the sets (57) are compact intervals, they are nested, since ℓ ↦ ℓ x 2 is increasing and ℓ ↦ ( 2 − ℓ ) x 3 is decreasing, and f ∗ ( x , 1 ) = x 2 ≤ x 3 = f ∗ ( x , 1 ) on [ 1 , 2 ] . Furthermore, f is a MET- ( p , s ) -convex F-I-V-F for p ∈ ( 0 , 5 ] and s ∈ ( 0 , 1 ] (verified numerically below; the property need not hold for much larger p, see Remark 10): by Definition 17 it suffices that both end-point functions be MET- ( p , s ) -convex, which was checked directly for x 2 and x 3 on [ 1 , 2 ] over this p-range since ℓ x 2 and ( 2 − ℓ ) x 3 are positive multiples of x 2 and x 3 .
Remark 10.
Definition 10 is universally quantified over t ∈ [ 0 , 1 ] and over both orderings of a 1 , b 1 , and this can fail for large p. For instance, with f ( x ) = x 2 , s = 1 , a 1 = 2 , b 1 = 1 , t = 0.02 , and p = 10 , direct computation gives left-hand side ≈ 1.8464 against right-hand side ≈ 1.3545 in (10), so the inequality fails. All five test mappings f 1 , … , f 5 above were found to satisfy Definition 10 for all p ∈ ( 0 , 5 ] and to fail for some p ∈ ( 6 , 10 ) (the threshold value for each mapping is given nearer to 6 than to 10, e.g., numerically close to p ≈ 6 for x 2 and p ≈ 6.9 for x 4 ). The numerical examples in this section are based only on p = 1 or p = 2 which are well inside the range that is verified, but a general analytic bound on the admissible p-range as a function of f remains for future work.
Implementing Theorem 1 on each level with p = 1 , α = 0.5 , β = 0.6 , s = 0.5 , ρ = 1 and λ = 0.5 gives the ℓ-cuts of the three terms of (22) specified in Table 1. Because the order relation ⪯ of Definition 17 compares the two end-point functions separately, the chain LHS ⪯ MID ⪯ RHS holds if and only if it holds for the lower and for the upper end-points; both hold in every row.
Table 1. The ℓ-cuts of the three terms of the Hermite–Hadamard chain (22) for the F-I-V-F on [ μ , ν ] = [ 1 , 2 ] , with p = 1 , α = 0.5 , β = 0.6 , s = 0.5 , ρ = 1 , λ = 0.5 .
Two features of Table 1 and Figure 1 are worth noting. The cuts are nested, that is, as ℓ is increased from 0.2 to 1 each, [ MID ] ℓ → interval shrinks, e.g., [ MID ] ℓ = [ H ] ℓ , where H is a smaller interval. [ 0.9381 , 13.7019 ] to [ 4.6905 , 7.6121 ] , in accordance with Definition 14. The width of the three cuts is not proportional, that is, at ℓ = 0.2 the width of [ RHS ] ℓ is about 32.8 against about 5.2 for [ LHS ] ℓ , Thus, the uncertainty at each stage gets compounded along the chain when it is represented by fuzzy data. It can’t be seen on a crisp depiction for which all three are genuinely fuzzy effects; it cannot be seen on a crisp representation since the cuts are points that are isolated.
Figure 1. The ℓ-cuts of the three terms of the Hermite–Hadamard chain. (a) The membership functions of LHS, MID, and RHS as fuzzy numbers, with their supports shaded; the shaded regions overlap where the three fuzzy numbers share values, which is a genuine feature of the data (each curve is distinctly colored and outlined) rather than a rendering artifact, and does not impair legibility. The dashed horizontal line marks the ℓ = 0.4 cut used elsewhere in the discussion. (b) The width of the ℓ-cut of each term at five confidence levels ℓ ∈ { 0.2 , 0.4 , 0.6 , 0.8 , 1.0 } , on a logarithmic vertical scale.

5.2. Numerical Illustration of the Hermite–Hadamard Chain (Theorem 1)

We first check the three-term chain LHS ⪯ MID ⪯ RHS of (22), where
LHS = 1 2 f ( μ p + ν p 2 1 / p ) E α , β + 1 ρ ( λ ) , MID = e 2 s / 2 2 ( ν p − μ p ) β M ρ , λ ′ , ( μ p ) + α , β f p ( ν p , ℓ ) + M ρ , λ ′ , ( ν p ) − α , β f p ( μ p , ℓ ) , RHS = e 2 s f ( μ ) + f ( ν ) E α , β + 1 ρ ( λ ) .
We independently recomputed E α , β + 1 ρ ( λ ) by direct summation of its defining series at α = 0.5 , β = 0.6 , ρ = 1 , λ = 0.5 and confirmed LHS = 2.0831 and RHS = 10.7934 for f ( x ) = x 2 on [ μ , ν ] = [ 1 , 2 ] , in agreement with the first row of Table 2.
Table 2. Hermite–Hadamard chain of Theorem 1 for f ( x ) = x 2 under a joint variation of ( α , β , s ) , with p = 1 , ρ = 1 , λ = 0.5 and [ μ , ν ] = [ 1 , 2 ] .
Table 2 reports the chain for f 1 ( x ) = x 2 a joint variation of ( α , β , s ) . In every row the ordering is preserved, and the gap RHS − LHS contracts monotonically as the parameters increase towards unity.
Table 2 only checks four isolated parameter triples. Figure 2 extends the verification to the whole admissible region.
Figure 2. The Hermite–Hadamard chain of Theorem 1 for f ( x ) = x 2 ( p = 1 , ρ = 1 , λ = 0.5 , [ μ , ν ] = [ 1 , 2 ] ). (a) A range plot for the four parameter triples ( α , β , s ) of Table 2: for each triple, markers show LHS (∘), MID (⋄), and RHS (□), and the light pink bar spans the interval from LHS to RHS , with its numerical width labeled as the gap. (b) The three quantities as surfaces over the ( ϕ , s ) -grid (with ϕ : = α = β ); the LHS and MID surfaces lie close together near the bottom of the plot and the RHS surface is clearly separated above, which is a genuine feature of the data rather than a rendering overlap, since the three surfaces remain distinctly colored throughout.
Figure 2a shows the chain at the four parameter triples of Table 2: each range goes from LHS (∘) to As MID (⋄) to RHS (□), the gap narrows. ( α , β , s ) approach ( 1 , 1 , 1 ) . The ordering LHS ≤ MID ≤ RHS is a global property and not a local property. For isolated parameters, the plot of Figure 2b shows the coincidence at, The same three quantities as surfaces throughout the ( s , α ) domain ( β = 0.6 ): they never intersect.
The chain for all five test functions at reference parameters α = 0.5 and β = 0.6 and s = 0.5 is given in Table 3 and the same data is plotted in Figure 3 to show that the result is independent of mapping.
Table 3. Hermite–Hadamard chain of Theorem 1 for five convex, non-negative test mappings, with p = 1 , α = 0.5 , β = 0.6 , s = 0.5 .
Figure 3. The Hermite–Hadamard chain of Theorem 1 for the five test mappings ( p = 1 , α = 0.5 , β = 0.6 , s = 0.5 ). (a) A range plot, one row per mapping, with markers for LHS (∘), MID (⋄), and RHS (□) joined by a bar whose color varies by row for visual distinction only, labeled with the numerical gap RHS − LHS . (b) The same three quantities as a grouped 3-D bar chart, one group of bars per mapping; the bars are shown in a 3-D perspective view, which is legible throughout since each of LHS , MID , RHS keeps its own color.
In Figure 3a, for each mapping, the range runs from LHS (∘) through MID (⋄) to RHS (□), the printed value being the gap RHS − LHS ; and Figure 3b shows the same values as grouped columns. The ordering holds for polynomial, exponential, and hyperbolic growth alike.

5.3. Effect of the p-Convexity Parameter

An exceptional aspect of the present framework is the replacement of the classical midpoint by the MET- ( p , s ) midpoint ( μ p + ν p 2 ) 1 / p of Definition 10. Table 4 compares p = 1 with p = 2 for the mappings x 2 and e x .
Table 4. Influence of the p-convexity parameter on the chain of Theorem 1 ( α = 0.5 , β = 0.6 , s = 0.5 ). The right-hand side depends only on the end-point values and is therefore independent of p.
The term on the left-hand side increases, p whereas the right-hand side does not depend on p and hence the gap is decreasing and we get a tighter approximation. This is shown in Figure 4. So the option p provides us with a meaningful extra control over the sharpness of the restriction, as opposed to just recovering the convex case p = 1 .
Figure 4. Effect of the p-convexity parameter on the chain of Theorem 1 for f ( x ) = x 2 and f ( x ) = e x ( β = 0.6 , s = 0.5 ). (a) A range plot as in Figure 3a, with one row for each mapping at p = 1 and p = 2 ; the dashed vertical line marks the (fixed-in-p) RHS position for each mapping, so that the leftward shift of LHS and the narrowing gap as p increases from 1 to 2 can be read off directly. (b) The LHS and RHS surfaces over ( p , ϕ ) (with ϕ : = α = β ), confirming that RHS is flat in p while LHS increases with p throughout the domain shown.
In Figure 4a the right-hand side (dashed line) is constant in p at α = 0.5 and increasing p from 1 to 2 increases the left-hand side (arrow) and decreases the gap. The left- and right-hand surfaces over ( p , α ) in Figure 4b are such that the right-hand surfaces are flat in p, and the left-hand ones rise with p over the whole domain.

5.4. Numerical Illustration of the Trapezoid-Type Error Bounds (Theorems 2–4)

In the present and the next two subsections we assume that the parameter β is bigger than one, as required by the hypothesis of Lemma 1; see Remark 7. We compare the real deviation of
D = | ζ ( ν , μ ) 2 ∫ 0 1 K ( w ) f ′ μ + w ζ ( ν , μ ) d w | ,
obtained from the identity of Lemma 1, with K the kernel difference (41), against the three upper bounds B 4.1 , B 4.2 and B 4.3 furnished by Theorems 2, 3 and 4, respectively. Here we take p = 1 , so that ζ ( ν , μ ) = ν 1 − μ 1 = ν − μ the general definitions use ζ ( ν , μ ) = ν p − μ p , and f p = f at p = 1 , under which the invex domain [ μ , μ + ζ ( ν , μ ) ] collapses to [ μ , ν ] = [ 1 , 2 ] .
Table 5 gives the actual deviation D against the three trapezoid-type upper bounds B 4.1 (basic), B 4.2 (Hölder) and B 4.3 (power-mean) of Theorems 2–4, with μ = 1 , ν = 2 , ρ = 1 , λ = 0.5 and ζ ( ν , μ ) = ν − μ . In accordance with Lemma 1, all configurations satisfy β > 1 . Table 5 and Figure 5 show that in every configuration the deviation is comfortably dominated by each of the three bounds, and that the power-mean bound B 4.3 is the tightest of the three.
Table 5. Actual deviation D against the three trapezoid-type upper bounds.
Figure 5. Actual deviation D against the three trapezoid-type upper bounds of Theorems 2–4. (a) A range plot for four parameter configurations ( α , β , q ) : D (★) sits far to the left of B 4.3 (⋄), B 4.2 (▵), and B 4.1 (∘) in each row, with the numerical value of D labeled. (b) The same four quantities as surfaces over α ∈ ( 0.15 , 1.5 ] and β ∈ ( 1 , 2 ] for f ( x ) = x 2 with q = 2 ; the D surface (black, flat near zero) lies below all three bound surfaces throughout.
Figure 5a Table 5 has four configurations: D (★) is located far to the left of B 4.1 (∘), B 4.2 (▵), and B 4.3 (⋄) in each row. Figure 5b The deviation surface sits below all three bound surfaces throughout, and B 4.3 ≤ B 4.2 ≤ B 4.1 everywhere. These four quantities are the same as surfaces over α ∈ ( 0.15 , 1.5 ] and β ∈ ( 1 , 2 ] for f ( x ) = x 2 with q = 2 .

5.5. Behaviour of the Three Bounds

Figure 6 shows the bound B 4.1 of Theorem 2 for f ( x ) = x 2 with α ∈ ( 0.15 , 1.5 ] and β ∈ ( 1 , 2 ] . The bound decreases monotonically with increase of fractional order α . At β = 1.5 it decreases from about 5.86 at α = 0.15 to about 3.61 at α = 1.5 . Its dependence on β is non-monotonic, rising with the deviation of β from 1, reaching its greatest values near β ≈ 1.75 (∼6.23 for α = 0.15 ) and then falling again as β approaches 2. The bound is only of the order of about 1.50 to 6.23 in the region.
Figure 6. The trapezoid-type upper bound B 4.1 of Theorem 2 for f ( x ) = x 2 with α ∈ ( 0.15 , 1.5 ] and β ∈ ( 1 , 2 ] . (a) B 4.1 against α for five fixed values of β . (b) B 4.1 as a surface over ( α , β ) , colored by its value on the same scale as the surface; the shaded panel beneath is a contour projection of the same surface, shown for orientation.
For f ( x ) = x 2 , with ρ = 1 , λ = 0.5 and [ μ , ν ] = [ 1 , 2 ] . Figure 6a Sections at five values of β , showing the decay in α . and Figure 6b displays the corresponding surface over α ∈ ( 0.15 , 1.5 ] and β ∈ ( 1 , 2 ] ,with its floor-projected contour map. The Holder-type bound B 4.2 in Theorem 3 is shown in Figure 7 as a function of the exponent q ∈ ( 1.3 , 4 ] and of β ∈ ( 1 , 2 ] , for α = 0.5 fixed. The bound decreases monotonically in q; at β = 1.5 , it decreases from around 5.53 at q = 1.3 to about 2.18 at q = 4 . As the kernel difference K of (41) is bounded on [ 0 , 1 ] for β > 1 , in Theorem 3 the quantity ∫ 0 1 | K ( w ) | r d w 1 / r is finite for high values of the conjugate exponent r = q / ( q − 1 ) , that is, when q goes to 1. Thus there is no practical need to restrict q, as the Hölder-type estimate is stable across the complete permissible range.
Figure 7. The Hölder-type bound B 4.2 of Theorem 3. (a) B 4.2 against q for five fixed values of β . (b) B 4.2 as a surface over ( q , β ) , colored by its value on the same scale as the surface; the shaded panel beneath is a contour projection of the same surface, shown for orientation.
For f ( x ) = x 2 , with α = 0.5 , ρ = 1 , λ = 0.5 and [ μ , ν ] = [ 1 , 2 ] , Figure 7a sections are plotted at five values of β , illustrating the monotone decrease of q. The power-mean bound B 4.3 of Theorem 4 reduces as both α and q increase: at β = 1.5 , it drops from around 4.28 at α = 0.15 , q = 1.3 to roughly 1.40 at α = 1.5 , q = 4 . It is smooth all over. This illustrates the fact that this numerically well-behaved approximation is obtained by the power-mean inequality used in the proof of Theorem 4.

5.6. Comparison of Three Bounds of Trapezoid Type

In Figure 8, all three bounds are compared with the actual deviation D at α = 0.5 and q = 2 . Three observations stand out. First, the deviation D stays well within all three bounds throughout, ranging only between about 0.15 and 0.29 . Second, the ordering B 4.3 ≤ B 4.2 ≤ B 4.1 holds throughout; at β = 1.6 , for instance, the three bounds never drop below about 1.44 and take the values approximately 2.75 , 3.26 , and 5.34 , respectively. Third, the deviation follows the same qualitative pattern in β as the three bounds: all four quantities decrease as β moves away from 1 toward 2.
Figure 8. Comparison of the three trapezoid-type bounds against the actual deviation D, for f ( x ) = x 2 with q = 2 , ρ = 1 , λ = 0.5 . (a) Against β ∈ ( 1 , 2 ] at α = 0.5 : the deviation (dashed) stays far below all three bounds, and B 4.3 is uniformly the tightest; the shaded bands between curves and the inset zoom on D are for visual clarity only and do not affect legibility. (b) The same four quantities as surfaces over ( α , β ) illustrating that the ordering holds over the plotted region; the surfaces are shown with partial transparency so that all four remain visible where they overlap.

5.7. Comparison with Existing Results

We close this section by finding the results of the paper with respect to the available literature, first structurally and then numerically as well.
Special cases. Since ( ρ ) 0 = 1 , the defining series of the generalized Mittag–Leffler kernel gives E α , β ρ ( 0 ) = 1 / Γ ( β ) , so that for λ = 0 the Prabhakar operators of Definition 18 collapse to the Riemann–Liouville fractional integrals,
M ρ , 0 , a + α , β f ( x ) = Γ ( β ) J a + β f ( x ) , M ρ , 0 , b − α , β f ( x ) = Γ ( β ) J b − β f ( x ) .
Table 6 records the classes and operators recovered from Definition 10 and Theorem 1 for particular values of the parameters. In this Riemann–Liouville limit the chain of Theorem 1 is directly comparable with the fractional Hermite–Hadamard inequalities obtained for generalized preinvex classes [43,44,45].
Table 6. Classes and operators recovered from Definition 10 and Theorem 1 for particular values of the parameters.
The advantage of MET- ( p , s ) -convexity is generality rather than sharpness, and this can be illustrated precisely. Consider f ( x ) = x on [ μ , ν ] = [ 1 , 2 ] : this function is concave, so the classical Hermite–Hadamard inequality does not apply to it, and the three quantities run in the wrong order,
f μ + ν 2 = 1.2247 ≥ 1 ν − μ ∫ μ ν f = 1.2190 ≥ f ( μ ) + f ( ν ) 2 = 1.2071 .
Nevertheless x is MET- ( 1 , 1 ) -convex on [ 1 , 2 ] , so Theorem 1 does apply, and it returns valid bounds: at λ = 0 , β = 1 , p = 1 , s = 1 the chain (22) reads 0.6124 ≤ 1.4211 ≤ 3.2813 , and at the reference parameters α = 0.5 , β = 0.6 , s = 0.5 , λ = 0.5 it reads 1.1339 ≤ 2.4352 ≤ 5.2115 .
Price of the generality. On a mapping to which both theories apply, the classical inequality is of course the sharper one. For f ( x ) = x 2 on [ μ , ν ] = [ 1 , 2 ] , the classical Hermite–Hadamard chain gives 1.1250 ≤ 1.1667 ≤ 1.2500 , whereas Theorem 1 with λ = 0 , β = 1 , p = 1 , s = 1 gives 1.1250 ≤ 2.7203 ≤ 6.7957 . The left-hand sides agree (since E α , 2 ρ ( 0 ) = 1 ), while the middle and right-hand terms of (22) are larger: this is the price paid for generality, since the weights [ sin π t 2 e 1 − t ] s and [ cos π t 2 e t ] s of Definition 10 sum to more than one. In short, the class of admissible mappings was enlarged to include non-convex functions such as x at the cost of looser constants; Theorem 1 should therefore be read as extending the range of applicability of the Hermite–Hadamard-type chain, not as improving the classical bound on the convex mappings for which the classical inequality already applies.

6. Conclusions

In this paper, we refined the Hermite-Hadamard and trapezoid type inequalities with the newly described MET- ( p , s ) -fuzzy convex function and implementation of Prabhakar fuzzy fractional operators. The proposed framework extends and generalizes several existing convexity models, widening the class of admissible mappings beyond ordinary convexity. The inequalities derived here provide computable lower and upper bounds for Prabhakar fractional means in applications involving fractional models with an uncertain modeling domain expressed in fuzzy intervals. They are useful because they only require the model data at the endpoints. Moreover, we presented numerical illustrations of our main results and also checked the behavior for different values of parameters. We conclude that most of these inequalities can be further extended to other fuzzy-interval-valued mappings and fuzzy fractional operators, together with a discussion of their physical interpretations and applications. In future work, the study of Ostrowski, Simpson, Fej’er, and Chebyshev-type inequalities will consider the midpoint parametric values of s < 1 , the extension case for β ≤ 1 , and also promote the multi-index fractional operators.
The results are established under ρ > 0 , λ ≥ 0 , which guarantees a nonnegative Prabhakar kernel but excludes sign-changing kernels; the main chain (22) is a generalization in the sense of admitting a wider class of mappings, not a numerically sharper bound on the classical convex class (Section 5.7); and the trapezoid-type bounds of Theorems 2–4 require β > 1 . Extending the theory to λ < 0 , to p < 0 , and to 0 < β ≤ 1 is left for future work, together with a systematic theorem-by-theorem numerical comparison against the closest existing exponential-trigonometric, p-convex, and Prabhakar fuzzy fractional inequalities.

Author Contributions

Conceptualization, M.S. and R.S.A.; methodology, M.S. and R.S.A.; software, M.S.; validation, M.S., H.N. and D.A.; formal analysis, M.S. and R.S.A.; investigation, M.S. and H.N.; writing—original draft preparation, M.S.; writing—review and editing, R.S.A., H.N. and D.A.; supervision, R.S.A.; funding acquisition, D.A. All authors have read and agreed to the published version of the manuscript.

Funding

The APC was funded by the Deanship of Graduate Studies and Scientific Research at Qassim University (grant number: QU-APC-2026).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding authors.

Acknowledgments

The authors would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for their support.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Hardy, G.H.; Littlewood, J.E.; Pólya, G. Inequalities; Cambridge University Press: Cambridge, UK, 1952. [Google Scholar]
  2. Niculescu, C.; Persson, L.E. Convex Functions and Their Applications; Springer: New York, NY, USA, 2006; Volume 23. [Google Scholar]
  3. Mubeen, S.; Ali, R.S.; Nayab, I.; Rahman, G.; Nisar, K.S.; Baleanu, D. Some generalized fractional integral inequalities with nonsingular function as a kernel. AIMS Math. 2021, 6, 3352–3377. [Google Scholar] [CrossRef] [Scilit]
  4. Meftah, B.; Boulares, H.; Shafqat, R.; Ben Makhlouf, A.; Benaicha, R. Some new fractional weighted Simpson type inequalities for functions whose first derivatives are convex. Math. Probl. Eng. 2023, 2023, 9945588. [Google Scholar] [CrossRef] [Scilit]
  5. Butt, S.I.; Bakula, K.; Pečarić, M.; Pečarić, J. Jensen–Grüss inequality and its applications for the Zipf–Mandelbrot law. Math. Methods Appl. Sci. 2021, 44, 1664–1673. [Google Scholar] [CrossRef] [Scilit]
  6. Butt, S.I.; Nadeem, M.; Qaisar, S.; Akdemir, A.O.; Abdeljawad, T. Hermite–Jensen–Mercer type inequalities for conformable integrals and related results. Adv. Differ. Equ. 2020, 2020, 501. [Google Scholar] [CrossRef] [Scilit]
  7. Nwaeze, E.R.; Khan, M.A.; Chu, Y.M. Fractional inclusions of the Hermite–Hadamard type for m-polynomial convex interval-valued functions. Adv. Differ. Equ. 2020, 2020, 507. [Google Scholar] [CrossRef] [Scilit]
  8. Tariq, M.; Ahmad, H.; Budak, H.; Sahoo, S.K.; Sitthiwirattham, T.; Reunsumrit, J. A comprehensive analysis of Hermite–Hadamard type inequalities via generalized preinvex functions. Axioms 2021, 10, 328. [Google Scholar] [CrossRef] [Scilit]
  9. Hudzik, H.; Maligranda, L. Some remarks on s-convex functions. Aequ. Math. 1994, 48, 100–111. [Google Scholar] [CrossRef] [Scilit]
  10. Gao, W.; Kashuri, A.; Butt, S.I.; Tariq, M.; Aslam, A.; Nadeem, M. New inequalities via n-polynomial harmonically exponential type convex functions. AIMS Math. 2020, 5, 6856–6873. [Google Scholar] [CrossRef] [Scilit]
  11. Mohan, S.R.; Neogy, S.K. On invex sets and preinvex functions. J. Math. Anal. Appl. 1995, 189, 901–908. [Google Scholar] [CrossRef] [Scilit]
  12. Kadakal, M.; İşcan, İ.; Kadakal, H.; Bekar, K. On improvements of some integral inequalities. Honam Math. J. 2021, 43, 441–452. [Google Scholar]
  13. Moumen, A.; Boulares, H.; Meftah, B.; Shafqat, R.; Alraqad, T.; Ali, E.E.; Khaled, Z. Multiplicatively Simpson type inequalities via fractional integral. Symmetry 2023, 15, 460. [Google Scholar] [CrossRef] [Scilit]
  14. Boulares, H.; Meftah, B.; Moumen, A.; Shafqat, R.; Saber, H.; Alraqad, T.; Ali, E.E. Fractional multiplicative Bullen-type inequalities for multiplicative differentiable functions. Symmetry 2023, 15, 451. [Google Scholar] [CrossRef] [Scilit]
  15. Rashid, S.; İşcan, İ.; Baleanu, D.; Chu, Y.M. Generation of new fractional inequalities via n-polynomials s-type convexity with applications. Adv. Differ. Equ. 2020, 2020, 1–20. [Google Scholar] [CrossRef] [Scilit]
  16. Zahra, M.; Chu, Y.M.; Farid, G. Refinements of some integral inequalities for convex functions. J. Math. 2020, 2020, 8878342. [Google Scholar] [CrossRef] [Scilit]
  17. Saleem, M.S.; Chu, Y.M.; Jahangir, N.; Akhtar, H.; Jung, C.Y. On generalized strongly convex functions of higher order. J. Math. 2020, 2020, 8381431. [Google Scholar] [CrossRef] [Scilit]
  18. Hanson, M.A. On sufficiency of the Kuhn–Tucker conditions. J. Math. Anal. Appl. 1981, 80, 545–550. [Google Scholar] [CrossRef] [Scilit]
  19. Ben-Israel, A.; Mond, B. What is invexity? ANZIAM J. 1986, 28, 1–9. [Google Scholar] [CrossRef] [Scilit]
  20. Antczak, T. Mean value in invexity analysis. Nonlinear Anal. Theory Methods Appl. 2005, 60, 1473–1484. [Google Scholar] [CrossRef] [Scilit]
  21. Noor, M.A. Variational-like inequalities. Optimization 1994, 30, 323–330. [Google Scholar] [CrossRef] [Scilit]
  22. Farajzadeh, A.; Noor, M.A.; Noor, K.I. Vector nonsmooth variational-like inequalities and optimization problems. Nonlinear Anal. Theory Methods Appl. 2009, 71, 3471–3476. [Google Scholar] [CrossRef] [Scilit]
  23. Kadakal, H. Hermite–Hadamard type inequalities for trigonometrically convex functions. Sci. Stud. Res. Ser. Math. Inform. 2018, 28, 19–28. [Google Scholar]
  24. Khan, M.B.; Mohammed, P.O.; Noor, M.A.; Hamed, Y.S. New Hermite–Hadamard inequalities in fuzzy-interval fractional calculus and related inequalities. Symmetry 2021, 13, 673. [Google Scholar] [CrossRef] [Scilit]
  25. Nayab, I.; Mubeen, S.; Ali, R.S.; Zahoor, F.; Awadalla, M.; Elamin, A.E.A.M.A. Novel fractional inequalities measured by Prabhakar fuzzy fractional operators pertaining to fuzzy convexities and preinvexities. AIMS Math. 2024, 9, 17696–17715. [Google Scholar] [CrossRef] [Scilit]
  26. Hermite–Hadamard-type inequalities for h-Godunova–Levin convex fuzzy interval-valued functions via Riemann–Liouville fractional q-integrals. Fractal Fract. 2025, 9, 578. [CrossRef] [Scilit]
  27. The Hadamard and generalized fractional integral fuzzy-number-valued operators for mappings of one and two variables, and their related fuzzy number inequalities. Fractal Fract. 2026, 10, 228. [CrossRef] [Scilit]
  28. Demir Budak, K.; Gürbüz, M. Modified exponential trigonometric convex functions and some integral inequalities. Turk. J. Inequal. 2024, 8, 60–72. [Google Scholar]
  29. Zhang, K.S.; Wan, J.P. p-convex functions and their properties. Pure Appl. Math. 2007, 23, 130–133. [Google Scholar] [CrossRef] [Scilit]
  30. Park, C.; Chu, Y.M.; Saleem, M.S.; Jahangir, N.; Rehman, N. On n-polynomial p-convex functions and some related inequalities. Adv. Differ. Equ. 2020, 2020, 666. [Google Scholar] [CrossRef] [Scilit]
  31. Butt, S.I.; Budak, H.; Tariq, M.; Nadeem, M. Integral inequalities for n-polynomial s-type preinvex functions with applications. Math. Methods Appl. Sci. 2021, 44, 11006–11021. [Google Scholar] [CrossRef] [Scilit]
  32. Toader, G.H. Some generalizations of the convexity. In Proceedings of the Colloquium on Approximation and Optimization, Cluj-Napoca, Romania, 25–27 October 1984; Volume 329, pp. 1–338. [Google Scholar]
  33. Latif, M.A.; Shoaib, M. Hermite–Hadamard type integral inequalities for differentiable m-preinvex and (α,m)-preinvex functions. J. Egypt. Math. Soc. 2015, 23, 236–241. [Google Scholar] [CrossRef] [Scilit]
  34. Deng, Y.; Kalsoom, H.; Wu, S. Some new quantum Hermite–Hadamard-type estimates within a class of generalized (s,m)-preinvex functions. Symmetry 2019, 11, 1283. [Google Scholar] [CrossRef] [Scilit]
  35. Toplu, T.; Kadakal, M.; İşcan, İ. On n-polynomial convexity and some related inequalities. AIMS Math. 2020, 5, 1304–1318. [Google Scholar] [CrossRef] [Scilit]
  36. Kadakal, M.; İşcan, İ.; Agarwal, P.; Jleli, M. Exponential trigonometric convex functions and Hermite–Hadamard type inequalities. Math. Slovaca 2021, 71, 43–56. [Google Scholar] [CrossRef] [Scilit]
  37. Garrappa, R.; Mainardi, F.; Maione, G. Models of dielectric relaxation based on completely monotone functions. Fract. Calc. Appl. Anal. 2016, 19, 1105–1160. [Google Scholar] [CrossRef] [Scilit]
  38. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
  39. Goetschel, R.; Voxman, W. Elementary fuzzy calculus. Fuzzy Sets Syst. 1986, 18, 31–43. [Google Scholar] [CrossRef] [Scilit]
  40. Kaleva, O. Fuzzy differential equations. Fuzzy Sets Syst. 1987, 24, 301–317. [Google Scholar] [CrossRef] [Scilit]
  41. Giusti, A.; Colombaro, I.; Garra, R.; Garrappa, R.; Polito, F.; Popolizio, M.; Mainardi, F. A practical guide to Prabhakar fractional calculus. Fract. Calc. Appl. Anal. 2020, 23, 9–54. [Google Scholar] [CrossRef] [Scilit]
  42. Górska, K.; Horzela, A.; Lattanzi, A.; Pogány, T.K. On the complete monotonicity of the three parameter generalized Mittag–Leffler function E α , β γ (−x). arXiv 2018, arXiv:1811.10441. [Google Scholar]
  43. Barani, A.; Ghazanfari, A.G.; Dragomir, S.S. Hermite–Hadamard inequality for functions whose derivatives absolute values are preinvex. J. Inequal. Appl. 2012, 2012, 247. [Google Scholar] [CrossRef] [Scilit]
  44. Du, T.S.; Liao, J.G.; Li, Y.J. Properties and integral inequalities of Hadamard–Simpson type for the generalized (s,m)-preinvex functions. J. Nonlinear Sci. Appl. 2016, 9, 3112–3126. [Google Scholar] [CrossRef] [Scilit]
  45. Du, T.S.; Liao, J.; Chen, L.; Awan, M.U. Properties and Riemann–Liouville fractional Hermite–Hadamard inequalities for the generalized (α,m)-preinvex functions. J. Inequal. Appl. 2016, 2016, 306. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.