[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Next Article in Journal
Applying Set Theory
Previous Article in Journal
Advanced Proportional-Integral-Derivative Control Compensation Based on a Grey Estimated Model in Dynamic Balance of Single-Wheeled Robot
Previous Article in Special Issue
A Simple Frequency Formulation for the Tangent Oscillator
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Comprehensive Analysis of Hermite–Hadamard Type Inequalities via Generalized Preinvex Functions

by
Muhammad Tariq
1,
Hijaz Ahmad
2,3,
Hüseyin Budak
4,
Soubhagya Kumar Sahoo
5,
Thanin Sitthiwirattham
6,* and
Jiraporn Reunsumrit
7
1
Department of Basic Sciences and Related Studies, Mehran University of Engineering and Technology, Jamshoro 76062, Pakistan
2
Department of Computer Engineering, Biruni University, Istanbul 34025, Turkey
3
Section of Mathematics, International Telematic University Uninettuno, Corso Vittorio Emanuele II, 39, 00186 Roma, Italy
4
Department of Mathematics, Faculty of Science and Arts, Düzce University, Düzce 81620, Turkey
5
Department of Mathematics, Institute of Technical Education and Research, Siksha ‘O’ Anusandhan University, Bhubaneswar 751030, India
6
Department of Mathematics, Faculty of Science and Technology, Suan Dusit University, Bangkok 10300, Thailand
7
Department of Mathematics, Faculty of Applied Science, King Mongkut’s University of Technology North Bangkok, Bangkok 10800, Thailand
*
Author to whom correspondence should be addressed.
Axioms 2021, 10(4), 328; https://doi.org/10.3390/axioms10040328
Submission received: 5 September 2021 / Revised: 22 November 2021 / Accepted: 25 November 2021 / Published: 30 November 2021

Abstract

:
The principal objective of this article is to introduce the idea of a new class of n-polynomial convex functions which we call n-polynomial s-type m-preinvex function. We establish a new variant of the well-known Hermite–Hadamard inequality in the mode of the newly introduced concept. To add more insight into the newly introduced concept, we have discussed some algebraic properties and examples as well. Besides, we discuss a few new exceptional cases for the derived results, which make us realize that the results of this paper are the speculations and expansions of some recently known outcomes. The immeasurable concepts and chasmic tools of this paper may invigorate and revitalize additional research in this mesmerizing and absorbing field.

1. Introduction

The term convexity is one of the most elegant, natural and fundamental notations in mathematics, and for the first time in the year 1934, it was used widely in the classical and tremendous book Inequalities, which is written by great mathematicians Hardy, Littlewood and Pólya [1]. The theory of convexity presents a very impressive, remarkable and mesmerizing field of research activities. This theory has a large number of potential applications in many absorbing and worthy fields of research. Furthermore, this theory also plays a magnificent role in many different areas, such as information theory, coding theory, optimization, engineering and inequality theory. Mathematicians have proposed several new notions of classical convexity in the literature (see [2,3,4,5,6,7,8]) and focused on the concept of convex functions, generalizing its variant forms in different ways using innovative ideas and fruitful techniques. In this aspect, integral inequalities have performed a vital role in defining real-world problems. In this setting, Hermite–Hadamard [9] type inequalities are influential in convexity theory.
Theories of inequality along with convexity properties play an essential part in the present-day mathematical investigation. In literature there exists several well-known mathematical inequalities, but the Hermite–Hadamard inequality is considered the most and holds a special place in the subject of convex analysis. This inequality asserts that the mean value of the integral of the convex function on an interval, say [a,b], interpolates between the mapping of the arithmetic means of the limit points of the interval and the arithmetic mean of the mappings of the limits of the interval [a,b]. This inequality uncovers the connection among the integral mean of a convex function, mean of mappings and mapping of the arithmetic mean of limits of the integration. A large number of research articles have been written during the last decade by several mathematicians who give new proof, generalizations, extensions and refinements of this inequality. The subject inequalities have a lot of investigations and applications in the variability of applied science, for example, coding theory, geometric function theory, impulsive diffusion equations, numerical analysis and fractional calculus. For the attention of the readers, see the references [10,11,12].
In 1985, G. Toader [13] for the first time explored the new family of convex functions, namely m–convex functions. After the contribution of Toader, Latif [14] and Kalsoom [15] polished the idea of preinvexity and explored the new notion of preinvexity namely m–preinvexity. Recently, Toplu [16] investigated an n–polynomial convexity and established a new version of Hermite–Hadamard type inequality for the newly introduced function. Noor and his team then generalized the concept of n–polynomial convexity to n–polynomial harmonic convexity. Moreover, some refinements of this class of convexity are being widely studied by Tariq and his collaborators for n–polynomial exponentially convex function. Now, we list some of their work on n–polynomial convexity for references, where they introduced n–polynomial exponentially convex function [17], generalized harmonic exponential convex function [18], generalized exponential type convex function [19], studied some of algebraic properties and presented a few new kinds of Hermite–Hadamard type inequalities. Very recently, İşcan [20] in his paper introduced a new function, namely an n–polynomial s–type convex function. Park et al. [21] and Chen et al. [22] investigated n–polynomial p-convexity and established some related integral inequalities. Awan et al. [23] generalized the harmonic convex function to n–polynomial harmonically convex function and presented related Hermite–Hadamard inequalities.
The aim of this paper is to introduce a new class of n-polynomial preinvex function called n–polynomial s-type m-preinvex function. We elaborate on some algebraic properties and examples in the manner of the newly introduced definition. The new version of Hermite–Hadamard and its refinements in the support of this newly introduced concept are investigated.

2. Preliminaries

Now, we present some known concepts which have helped us extensively throughout the paper to establish our main results.
Definition 1
([24]). A set X R n is said to be m–invex w.r.t η : X × X × ( 0 , 1 ] R n , if
m μ 2 + θ η ( μ 1 , μ 2 , m ) X ,
holds for every μ 1 , μ 2 X , m ( 0 , 1 ] and θ [ 0 , 1 ] .
Example 1
([24]). Let m = 1 4 and X = [ π 2 , 0 ) ( 0 , 1 2 ]
η ( μ 2 , μ 1 , m ) = m cos ( μ 2 μ 1 ) i f μ 1 ( 0 , π 2 ] , μ 2 ( 0 , π 2 ] ; m cos ( μ 2 μ 1 ) i f μ 1 [ π 2 , 0 ) , μ 2 [ π 2 , 0 ) ; m cos ( μ 1 ) i f μ 1 ( 0 , π 2 ] , μ 2 [ π 2 , 0 ) ; m cos ( μ 1 ) i f μ 1 [ π 2 , 0 ) , μ 2 ( 0 , π 2 ] .
Then, the above set X for all the mentioned conditions θ [ 0 , 1 ] is an m–invex set but not convex set.
In the year 1988, mathematicians Weir and Mond [25] used the idea of invex set and explored the idea of preinvexity.
Definition 2
([25]). Suppose X R be an invex set w.r.t ψ : X × X R . Then, ψ : X R is known as preinvex w.r.t η if
ψ μ 2 + θ η μ 1 , μ 2 θ ψ μ 1 + ( 1 θ ) ψ μ 2 , μ 1 , μ 2 X , θ 0 , 1 .
Later on, several mathematicians studied and collaborated their thoughts on the concept of preinvexity. For some related works, we refer the readers to see the published articles [26,27,28,29].
From the last current decade, several mathematicians improved and worked on the concept of preinvex function in variant ways. Recently, Kalsoom [15] investigated and explored a generalized version of preinvexity i.e., generalized m–preinvex function, which is stated as:
Definition 3.
Suppose ψ : X R ψ is said to be a generalized m–preinvex with respect to η : X × X × ( 0 , 1 ] R n for fixed m ( 0 , 1 ] , if
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) θ ψ μ 1 + m 1 θ ψ μ 2 ,
holds for every μ 1 , μ 2 X , θ [ 0 , 1 ] .
Definition 4
([20]). A non-negative function ψ : X R is said to be s–type convex function if ∀ μ 1 , μ 2 I , n N , s [ 0 , 1 ] and θ [ 0 , 1 ] , if
ψ θ μ 1 + 1 θ μ 2 1 ( s ( 1 θ ) ) ψ μ 1 + 1 s θ ψ μ 2 .
Definition 5
([16]). A non-negative real-valued function ψ : X R is known as n–polynomial convex function, if
ψ θ μ 1 + 1 θ μ 2 1 n i = 1 n [ 1 ( 1 θ ) i ] ψ μ 1 + 1 n i = 1 n [ 1 θ i ] ψ μ 2 ,
holds for every μ 1 , μ 2 X , θ [ 0 , 1 ] , s [ 0 , 1 ] and n N .
Mohan and Neogy [30] gave the following hypothesis which is widely used in the concept of preinvexity.
Condition-C: Let X R n be an open invex subset with respect to η : X × X R . For any μ 1 , μ 2 X and θ [ 0 , 1 ] ,
η μ 2 , μ 2 + θ η μ 1 , μ 2 = θ η μ 1 , μ 2 . η μ 1 , μ 2 + θ η μ 1 , μ 2 = 1 θ η μ 1 , μ 2 .
For any μ 1 , μ 2 X and θ 1 , θ 2 [ 0 , 1 ] from Condition C, we have
η μ 2 + θ 2 η μ 1 , μ 2 , μ 2 + θ 1 η μ 1 , μ 2 = θ 2 θ 1 η μ 1 , μ 2 .
The above Condition C is also presented by the name of extended Condition C in the sense of m–preinvexity by Ting Song Du [31].
Extended Condition-C: Let X R n be an open m–invex subset with respect to η : X × X × ( 0 , 1 ] R , for any μ 1 , μ 2 X , θ [ 0 , 1 ] . We then have
η μ 2 , m μ 2 + θ η μ 1 , μ 2 , m , m = θ η μ 1 , μ 2 , m η μ 1 , m μ 2 + θ η μ 1 , μ 2 , m , m = 1 θ η μ 1 , μ 2 , m η μ 1 , μ 2 , m = η μ 2 , μ 1 , m .
Definition 6
([3]). Suppose ∀ μ 1 , μ 2 R , then an inequality of the form
( ψ ( μ 1 ) ψ ( μ 2 ) ) ( φ ( μ 1 ) φ ( μ 2 ) ) 0
is known as similarly ordered.
Studying the above concepts and energized by the ongoing research activities, the article is structured as follows. In Section 3, we discuss the notion of n–polynomial s–type m–preinvexity and studied related properties. Section 4 deals with establishing a new sort of Hermite–Hadamard type inequality. In Section 5, two new integral identities are established, based on these identities and with the help of the new notion of preinvexity, some refinements and estimations of Hermite–Hadamard type inequality are given. In the last Section 6, a brief conclusion and the future scopes are discussed.

3. Generalized Preinvex Function and Its Properties

Here, we are going to elaborate the new notion for convex functions which is called generalized preinvex function, i.e., n–polynomial s–type m–preinvex function, and study some of its algebraic properties and examples.
Definition 7.
Suppose X R be a nonempty m–invex set w.r.t η : X × X × ( 0 , 1 ] R . Then, ψ : X R is known as n–polynomial s–type m–preinvex if
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 ,
holds for every μ 1 , μ 2 X , m ( 0 , 1 ] , s [ 0 , 1 ] , θ [ 0 , 1 ] and n N .
Remark 1.
( i ) If n = 1 , then
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 ( s ( 1 θ ) ) ψ μ 1 + m 1 s θ ψ μ 2 .
( i i ) If n = s = m = 1 , then Definition 7 is directly reduced to the definition of preinvexity which was explored by Weir et al. [25].
( i i i ) If n = m = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 , then Definition 7 is directly reduced to the s–type convex function which was explored by İşcan et al. [20].
( i v ) If n = s = m = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 , then Definition 7 is directly reduced to definition of convex function which was investigated by Niculescu et al. [3].
Lemma 1.
Suppose θ [ 0 , 1 ] , m ( 0 , 1 ] , n N and s [ 0 , 1 ] , then the following inequalities
θ 1 n i = 1 n ( 1 ( s ( 1 θ ) ) ) i a n d m ( 1 θ ) 1 n i = 1 n m i ( 1 ( s θ ) i )
are hold.
Proof. 
The proof is obvious. □
Lemma 2.
Suppose θ [ 0 , 1 ] , m ( 0 , 1 ] , n N and s [ 0 , 1 ] , then the following inequalities
( 1 ( s ( 1 θ ) ) ) 1 n i = 1 n ( 1 ( s ( 1 θ ) ) ) i a n d m ( 1 s θ ) 1 n i = 1 n m i ( 1 ( s θ ) i )
are hold.
Proof. 
The proof is obvious. □
Proposition 1.
Suppose θ [ 0 , 1 ] , m ( 0 , 1 ] , n N and s [ 0 , 1 ] , then every non-negative m–preinvex function is an n–polynomial s–type m–preinvex function.
Proof. 
According to the property of m–preinvexity and Lemma 1, we have
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) θ ψ μ 1 + m ( 1 θ ) ψ μ 2 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 .
Proposition 2.
Suppose θ [ 0 , 1 ] , m ( 0 , 1 ] , n N and s [ 0 , 1 ] , then every non-negative s–type m–preinvex function is an n–polynomial s–type m–preinvex function.
Proof. 
According to the property of s–type m–preinvexity and Lemma 2, we have
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 ( s ( 1 θ ) ) ψ μ 1 + m 1 s θ ψ μ 2 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 .
Proposition 3.
Every non-negative n–polynomial s–type m–preinvex function for s [ 0 , 1 ] , m ( 0 , 1 ] , n N , and θ [ 0 , 1 ] is an ( h , m ) –preinvex function with h ( θ ) = 1 n i = 1 n 1 ( s ( 1 θ ) ) i .
Proof. 
Using the definition of n–polynomial s–type m–preinvexity for s [ 0 , 1 ] , m ( 0 , 1 ] , θ [ 0 , 1 ] and the condition for h ( θ ) = 1 n i = 1 n 1 ( s ( 1 θ ) ) i , we have
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 h ( θ ) ψ ( μ 1 ) + m h ( 1 θ ) ψ ( μ 2 ) .
From the above proposition, one can easily observe that the newly defined preinvexity is very large concerning the previously known functions, such as preinvex functions and convex functions. This is the most beautiful aspect of the proposed new Definition 7.
Now, we demonstrate examples in support of the new idea.
Example 2.
ψ ( μ ) = | μ | μ 0 is a non–negative convex function, but every convex is a preinvex function (see [32]). Thus, due to this reason, it is a non-negative m–preinvex function if m = 1 . By using Proposition 1, it is an n–polynomial s–type m–preinvex function.
Example 3.
ψ ( μ ) = e μ μ 0 is a non–negative convex function, but every convex is preinvex function (see [32]). For this reason, it is non-negative m-preinvex function if m = 1 . By using Proposition 1, it is an n-polynomial s-type m-preinvex function.
Now, we explore and elaborate some examples regarding the newly introduced idea. We can see that ψ ( x ) = | x | is preinvex but not convex.
Thus, next we will present some examples for the introduced n-polynomial s-type m-preinvex function w.r.t η on X , but it is a non-negative and not convex function.
Example 4.
Suppose ψ ( x ) : R + R + be defined by
ψ ( μ ) = μ ; 0 μ 1 1 ; μ > 1
and
η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 ; μ 1 0 , μ 2 0 μ 1 m μ 2 ; 0 μ 1 1 , μ 2 1 2 m μ 2 ; μ 1 0 , 0 μ 2 1 2 m μ 2 ; 0 μ 1 1 , μ 2 0 .
The non-negative function ψ ( x ) is m–preinvex but not convex. According to Proposition 1, it is an n–polynomial s–type m–preinvex function with respect to η on X if m = 1 .
Example 5.
Let ψ ( x ) : R + R + be defined by
ψ ( μ ) = μ + 1 ; 0 μ 1 1 ; μ > 1
and
η ( μ 1 , μ 2 , m ) = μ 1 + m μ 2 ; μ 1 μ 2 2 ( μ 1 + m μ 2 ) ; μ 1 > μ 2
μ 1 , μ 2 R + = [ 0 , + ) . The above non-negative function ψ ( x ) is m–preinvex but not convex. According to Proposition 1, it is an n–polynomial s–type preinvex function if m = 1 .
Theorem 1.
Let ψ , φ : X = [ μ 1 , μ 2 ] R . If ψ , φ are two n–polynomial s–type m–preinvex functions, then
( i ) ψ + φ is also an n–polynomial s–type m–preinvex function.
( i i ) c ψ is also an n–polynomial s–type m–preinvex function.
Proof. 
( i )
ψ + φ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) = ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) + φ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 + 1 n i = 1 n 1 ( s ( 1 θ ) ) i φ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i φ μ 2 = 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + φ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 + φ μ 2 = 1 n i = 1 n 1 ( s ( 1 θ ) ) i ( ψ + φ ) ( μ 1 ) + 1 n i = 1 n m i 1 ( s θ ) i ( ψ + φ ) ( μ 2 ) .
( i i )
c ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) c 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 = 1 n i = 1 n 1 ( s ( 1 θ ) ) i c ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i c ψ μ 2 = 1 n i = 1 n 1 ( s ( 1 θ ) ) i c ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i c ψ μ 2 .
This is the required proof. □
Theorem 2.
Suppose θ [ 0 , 1 ] , m ( 0 , 1 ] , n N and s [ 0 , 1 ] . Let ψ : X Y and φ : Y R be an n–polynomial s–type m–preinvex and non-decreasing function respectively. Then, φ ψ is also an n–polynomial s–type m–preinvex function w.r.t same η.
Proof. 
φ ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) = φ ( ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) ) φ 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 1 n i = 1 n 1 ( s ( 1 θ ) ) i φ ( ψ μ 1 ) + 1 n i = 1 n m i 1 ( s θ ) i φ ( ψ μ 2 ) = 1 n i = 1 n 1 ( s ( 1 θ ) ) i ( φ ψ ) μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ( φ ψ ) μ 2 .
Remark 2.
( i ) Considering n = s = 1 in the above Theorem 2, then
φ ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) θ ( φ ψ ) μ 1 + m ( 1 θ ) ( φ ψ ) μ 2 .
( i i ) Considering n = s = m = 1 in the above Theorem 2, then
φ ψ ( μ 2 + θ η ( μ 1 , μ 2 ) ) θ ( φ ψ ) μ 1 + ( 1 θ ) ( φ ψ ) μ 2 .
( i i i ) Considering n = m = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in the above Theorem 2, then
φ ψ ( θ μ 1 + ( 1 θ ) μ 2 ) [ 1 ( s ( 1 θ ) ) ] ( φ ψ ) μ 1 + [ 1 s θ ] ( φ ψ ) μ 2 .
Theorem 3.
Let 0 < μ 1 < μ 2 , ψ j : X = [ μ 1 , μ 2 ] [ 0 , + ) be a family of n–polynomial s–type m–preinvex function with respect to η and ψ ( u ) = sup j ψ j ( u ) . Then, ψ is an n–polynomial s–type m–preinvex function with respect to η for s [ 0 , 1 ] , m ( 0 , 1 ] , θ [ 0 , 1 ] , and U = { μ [ μ 1 , μ 2 ] : ψ ( μ i ) < } is an interval.
Proof. 
Let μ 1 , μ 2 U , s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , then
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) = sup j ψ j ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i sup j ψ j μ 1 + 1 n i = 1 n m i 1 ( s θ ) i sup j ψ j μ 2 = 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 < .
This is the required proof. □
Theorem 4.
If ψ i : R n R is an n–polynomial s–type m–preinvex function with respect to η for s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , then the set M = { μ R : ψ i ( μ ) 0 , i = 1 , 2 , 3 , , n } is an m–invex set.
Proof. 
Since ψ i ( μ ) , ( i = 1 , 2 , 3 , , n ) are n–polynomial s–type m–preinvex functions with respect to η for s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , then for all μ 1 , μ 2 R n ,
ψ i ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2
holds, where i = 1 , 2 , 3 , , n .
When μ 1 , μ 2 M , we know ψ i ( μ 1 ) 0 and ψ i ( μ 2 ) 0 , from the above inequality, which yields that
ψ i ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 0 , i = 1 , 2 , 3 , , n .
That is, m μ 2 + θ η ( μ 1 , μ 2 , m ) M . Hence, M is an m–invex set. □
Theorem 5.
If ψ : X R n R is an n–polynomial s–type m–preinvex function on m–invex set X w.r.t η for s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , then the function ψ is also generalized quasi m–preinvex function on m–invex set X w.r.t η.
Proof. 
Since ψ is an n–polynomial s–type m–preinvex function w.r.t η for s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , and we assume that ψ ( μ 1 ) ψ ( μ 2 ) , then for all μ 1 , μ 2 X , we have
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 1 n i = 1 n 1 ( s ( 1 θ ) ) i + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 ψ μ 2 .
In the same manner, if we let ψ ( μ 2 ) ψ ( μ 1 ) for all μ 1 , μ 2 X , we can also get
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) ψ μ 1 .
Consequently,
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) max { ψ ( μ 1 ) , ψ ( μ 2 ) } .
That is, ψ : X R n R is generalized quasi m–preinvex function on m–invex set X with respect to η . □
Theorem 6.
If ψ i : X R n R (i = 1, 2, …, n) are n–polynomial s–type m–preinvex functions on X w.r.t η : X × X × ( 0 , 1 ] R for s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , then
ψ = max { ψ i , i = 1 , 2 , , n }
is also an n–polynomial s–type m–preinvex function on X w.r.t η for s [ 0 , 1 ] and m ( 0 , 1 ] .
Proof. 
The proof is obvious. □
Theorem 7.
If ψ i : X R n R (i = 1, 2, …, n) are n–polynomial s–type m–preinvex functions on X w.r.t η : X × X × ( 0 , 1 ] R for s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , then the function
ψ = i = 1 n μ i ψ i , μ i 0 , ( i = 1 , 2 , 3 , , n )
is also an n–polynomial s–type m–preinvex function on X w.r.t η for s [ 0 , 1 ] and m ( 0 , 1 ] .
Proof. 
The proof is obvious. □
Theorem 8.
Let ψ : R R is an n–polynomial s–type m–preinvex function w.r.t η : R × R × ( 0 , 1 ] R for s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] . Assuming that ψ is monotonic decreasing, η is monotonic increasing regarding m for fixed μ 1 , μ 2 R and m 1 m 2 ( m 1 , m 2 ( 0 , 1 ] ) . If ψ is an n–polynomial s–type m 1 –preinvex function on R with respect to η, then ψ is an n–polynomial s–type m 2 –preinvex function on R with respect to η.
Proof. 
Since ψ is an n–polynomial s–type m 1 –preinvex function, for all μ 1 , μ 2 R ,
ψ ( m 1 μ 2 + θ η ( μ 1 , μ 2 , m 1 ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m 1 i 1 ( s θ ) i ψ μ 2 .
Combining the monotone decreasing of the function ψ with the monotone increasing of the mapping η regarding m for fixed μ 1 , μ 2 R and m 1 m 2 , it follows that
ψ ( m 2 μ 2 + θ η ( μ 1 , μ 2 , m 2 ) ) ψ ( m 1 μ 2 + θ η ( μ 1 , μ 2 , m 1 ) )
and
1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m 2 i 1 ( s θ ) i ψ μ 2 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m 1 i 1 ( s θ ) i ψ μ 2 .
Following the above inequalities, we have
ψ ( m 2 μ 2 + θ η ( μ 1 , μ 2 , m 2 ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m 2 i 1 ( s θ ) i ψ μ 2 .
This is the required proof. □
Theorem 9.
Let ψ , φ : X = [ μ 1 , μ 2 ] R . If both functions are n–polynomial s–type m–preinvex, similarly ordered functions and 1 ( s ( 1 θ ) ) + 1 s θ 1 , for s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , the product of these functions is an n–polynomial s–type m–preinvex function.
Proof. 
For s [ 0 , 1 ] , m ( 0 , 1 ] and θ [ 0 , 1 ] , then
ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) φ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i ψ μ 2 × 1 n i = 1 n 1 ( s ( 1 θ ) ) i φ μ 1 + 1 n i = 1 n m i 1 ( s θ ) i φ μ 2 1 n 2 i = 1 n 1 ( s ( 1 θ ) ) 2 i ψ ( μ 1 ) φ ( μ 1 ) + 1 n 2 i = 1 n m 2 i 1 ( s θ ) i 2 ψ ( μ 2 ) φ ( μ 2 ) + 1 n 2 i = 1 n m i 1 ( s ( 1 θ ) ) i 1 ( s θ ) i [ ψ ( μ 1 ) φ ( μ 2 ) + ψ ( μ 2 ) φ ( μ 1 ) ] 1 n 2 i = 1 n [ 1 ( s ( 1 θ ) ) ] 2 i ψ ( μ 1 ) φ ( μ 1 ) + 1 n 2 i = 1 n m 2 i 1 ( s θ ) i 2 ψ ( μ 2 ) φ ( μ 2 ) + 1 n 2 i = 1 n m i 1 ( s ( 1 θ ) ) i 1 ( s θ ) i [ ψ ( μ 1 ) φ ( μ 1 ) + ψ ( μ 2 ) φ ( μ 2 ) ] = 1 n i = 1 n ( 1 ( s ( 1 θ ) ) ) i ψ ( μ 1 ) φ ( μ 1 ) + 1 n i = 1 n m i 1 ( s θ ) i ψ ( μ 2 ) φ ( μ 2 ) × 1 n i = 1 n 1 ( s ( 1 θ ) ) i + 1 n i = 1 n m i 1 ( s θ ) i 1 n i = 1 n 1 ( s ( 1 θ ) ) i ψ ( μ 1 ) φ ( μ 1 ) + 1 n i = 1 n m i 1 ( s θ ) i ψ ( μ 2 ) φ ( μ 2 ) .
Remark 3.
Taking n = m = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 5, then
ψ ( θ μ 1 + ( 1 θ ) μ 2 ) φ ( θ μ 1 + ( 1 θ ) μ 2 ) [ 1 ( s ( 1 θ ) ) ] ψ μ 1 φ ( μ 1 ) + [ 1 s θ ] ψ μ 2 φ ( μ 2 ) .

4. Hermite–Hadamard Type Inequality via Generalized Preinvex Function

In this section, we present a new version of the Hermite–Hadamard type inequality in the setting of n–polynomial s–type m–preinvex functions.
Theorem 10.
Let X R be an open m–invex subset with respect to η : X × X × ( 0 , 1 ] R for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , and let μ 1 , μ 2 X , μ 1 < μ 2 with m μ 2 + η ( μ 1 , μ 2 , m ) μ 2 . Suppose ψ : [ m μ 2 + η ( μ 1 , μ 2 , m ) , μ 2 ] for all m ( 0 , 1 ] and satisfies extended Condition–C, then
ψ ( m μ 2 + 1 2 η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n ( 1 s 2 ) i η ( μ 1 , μ 2 , m ) m μ 2 m μ 2 + η ( μ 1 , μ 2 , m ) ψ ( x ) d x + m i m μ 2 + η ( μ 1 , μ 2 , m ) m μ 2 ψ ( x ) d x 1 n i = 1 n ( 2 s ) i ψ ( μ 1 ) + m i ψ ( μ 2 ) .
Proof. 
Since μ 1 , μ 2 X and X is an m–invex set with respect to η , for every m ( 0 , 1 ] and θ [ 0 , 1 ] , we have m μ 2 + θ η ( μ 1 , μ 2 , m ) X . For the remaining, putting extended condition C for η , θ = 1 2 , using Definition 7, and integrating over [ 0 , 1 ] ,
ψ ( m y + θ η ( x , y , m ) ) 1 n i = 1 n ( 1 ( s ( 1 θ ) ) ) i ψ ( x ) + 1 n i = 1 n m i ( 1 ( s θ ) i ) ψ ( y ) ψ ( m y + 1 2 η ( x , y , m ) ) 1 n i = 1 n 1 s 2 i ψ ( x ) + m i ψ ( y ) .
In the above inequality, we put x = m μ 2 + θ η ( μ 1 , μ 2 , m ) and m y = m μ 2 + ( 1 θ ) η ( μ 1 , μ 2 , m ) , so first we prove the L.H.S. of the above inequality
ψ ( m y + 1 2 η ( x , y , m ) ) = ψ ( m μ 2 + 1 2 η ( μ 1 , μ 2 , m ) ) .
Thus, after inputting the value of x and y, we obtain
ψ ( m y + 1 2 η ( x , y , m ) ) = ψ ( m μ 2 + ( 1 θ ) η ( μ 1 , μ 2 , m ) + 1 2 η ( m μ 2 + θ η ( μ 1 , μ 2 , m ) , m μ 2 + ( 1 θ ) η ( μ 1 , μ 2 , m ) , m ) ) .
Now, by using extended Condition C, we have
η ( m μ 2 + θ η ( μ 1 , μ 2 , m ) , m μ 2 + ( 1 θ ) η ( μ 1 , μ 2 , m ) ) = ( θ 1 + θ ) η ( μ 1 , μ 2 , m ) .
η ( m μ 2 + θ η ( μ 1 , μ 2 , m ) , m μ 2 + ( 1 θ ) η ( μ 1 , μ 2 , m ) ) = ( 2 θ 1 ) η ( μ 1 , μ 2 , m ) .
Now, we put the value of η in (8), then as a result, we obtain
ψ ( m y + 1 2 η ( x , y , m ) ) = ψ ( m μ 2 + ( 1 θ ) η ( μ 1 , μ 2 , m ) + 1 2 ( 2 θ 1 ) η ( μ 1 , μ 2 , m ) )
ψ ( m y + 1 2 η ( x , y , m ) ) = ψ ( m μ 2 + ( 1 θ + θ 1 2 ) η ( μ 1 , μ 2 , m ) )
ψ ( m y + 1 2 η ( x , y , m ) ) = ψ ( m μ 2 + 1 2 η ( μ 1 , μ 2 , m ) ) .
Now,
ψ ( m μ 2 + 1 2 η ( μ 1 , μ 2 , m ) ) 1 n i = 1 n 1 s 2 i 0 1 ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) d θ + m i 0 1 ψ ( μ 2 + ( 1 θ ) m η ( μ 1 , μ 2 , m ) ) d θ 1 n i = 1 n 1 s 2 i 1 η ( μ 1 , μ 2 , m ) m μ 2 m μ 2 + η ( μ 1 , μ 2 , m ) ψ ( x ) d x + m i m μ 2 + η ( μ 1 , μ 2 , m ) m μ 2 ψ ( x ) d x .
For the proof of the right side inequality, using the definition of n–polynomial s–type m–preinvexity, as a result we attain
1 η ( μ 1 , μ 2 , m ) m μ 2 m μ 2 + η ( μ 1 , μ 2 , m ) ψ ( x ) d x + m i m μ 2 + η ( μ 1 , μ 2 , m ) m μ 2 ψ ( x ) d x 0 1 ψ ( m μ 2 + θ η ( μ 1 , μ 2 , m ) ) d θ + m i 0 1 ψ ( μ 2 + ( 1 θ ) m η ( μ 1 , μ 2 , m ) ) d θ 0 1 1 n i = 1 n ( 1 ( s ( 1 θ ) ) ) i ψ ( μ 1 ) d θ + 0 1 1 n i = 1 n m i ( 1 ( s θ ) i ) ψ ( μ 2 ) d θ + 0 1 1 n i = 1 n ( 1 ( s θ ) i ) ψ ( μ 1 ) d θ + 0 1 1 n i = 1 n m i ( 1 ( s ( 1 θ ) ) ) i ψ ( μ 2 ) d θ 1 n i = 1 n 2 s 2 i ψ ( μ 1 ) + ψ ( μ 1 ) + m i ψ ( μ 2 ) + ψ ( μ 2 ) ) 1 n i = 1 n ( 2 s ) i ψ ( μ 1 ) + m i ψ ( μ 2 ) .
This completes the proof. □
Corollary 1.
If n = s = m = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 10, then we attain the simple Hermite–Hadamard inequality in [9].

5. Refinements of Hermite–Hadamard Type Inequality

First we derive two new lemmas with reference to differentiable preinvex functions. taking these two new equalities into consideration, several refinements of the Hermite–Hadamard type inequality are reviewed. The inequalities also considered some fundamental inequalities such as Hölder’s inequality, Power-mean inequality, improved power-mean integral inequality and Hölder–Íscan inequality.
Lemma 3.
Let ψ : μ 1 , m μ 1 + η ( μ 2 c , μ 1 , m ) R be a differentiable mapping on ( μ 1 , m μ 1 + η ( μ 2 c , μ 1 , m ) ) with 0 < c 1 and m μ 1 + η ( μ 2 , μ 1 , m ) > μ 1 > 0 . If ψ L ( μ 1 , m μ 1 + η ( μ 2 c , μ 1 , m ) ) and for all m ( 0 , 1 ] , then the following equality holds in the preinvex setting:
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x = η ( μ 2 , c μ 1 , m ) 2 c 0 1 ( 1 2 θ ) ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ .
Proof. 
Let μ 1 , μ 2 X . Since X is an m–invex set w.r.t η , θ [ 0 , 1 ] , μ 2 c + θ η ( μ 1 , μ 2 c ) X . Integrating by parts,
η ( μ 2 , c μ 1 , m ) 2 c 0 1 ( 1 2 θ ) ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ = η ( μ 2 , c μ 1 , m ) 2 c ( 1 2 θ ) ψ ( m μ 2 c + θ η ( μ 1 , μ 2 c ) ) η ( μ 1 , μ 2 c , m ) | 0 1 + 2 0 1 ψ ( m μ 2 c + θ η ( μ 1 , μ 2 c , m ) ) η ( μ 1 , μ 2 c , m ) d θ = η ( μ 2 , c μ 1 , m ) 2 c c ( ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) η ( μ 2 , c μ 1 ) 2 c η ( μ 2 , c μ 1 ) 0 1 ψ ( m μ 2 c + θ η ( μ 1 , μ 2 c , m ) ) d θ = ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x .
This completes the proof. □
Lemma 4.
Let ψ : μ 1 , m μ 1 + η ( μ 2 c , μ 1 , m ) R be a differentiable mapping on ( μ 1 , m μ 1 + η ( μ 2 c , μ 1 , m ) ) with 0 < c 1 and m μ 1 + η ( μ 2 , μ 1 , m ) > μ 1 > 0 . If ψ L ( μ 1 , m μ 1 + η ( μ 2 c , μ 1 , m ) ) and for all m ( 0 , 1 ] , then the following equality holds in the preinvex setting:
c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x ψ 2 m μ 1 + η ( μ 2 , μ 1 , m ) 2 c = η ( μ 2 , c μ 1 , m ) c 0 1 θ ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ 1 / 2 1 ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ .
Proof. 
Let μ 1 , μ 2 X . Since X is an m–invex set w.r.t η , θ [ 0 , 1 ] , μ 2 c + θ η ( μ 1 , μ 2 c ) X . Using integrating by parts,
η ( μ 2 , c μ 1 , m ) c 0 1 θ ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ 1 / 2 1 ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ = η ( μ 2 , c μ 1 , m ) c × θ ψ ( m μ 2 c + θ η ( μ 1 , μ 2 c , m ) ) η ( μ 1 , μ 2 c , m ) | 0 1 0 1 ψ ( m μ 2 c + θ η ( μ 1 , μ 2 c , m ) ) η ( μ 1 , μ 2 c , m ) d θ ψ ( m μ 2 c + θ η ( μ 1 , μ 2 c , m ) ) η ( μ 1 , μ 2 c , m ) d θ | 1 2 1 = η ( μ 2 , c μ 1 , m ) c c ψ ( μ 1 ) η ( c μ 1 , μ 2 , m ) c η ( c μ 1 , μ 2 , m ) 0 1 ψ ( m μ 2 c + θ η ( μ 1 , μ 2 c , m ) ) d θ c η ( c μ 1 , μ 2 , m ) ψ ( μ 1 ) ψ ( 2 m μ 1 + η ( μ 2 , μ 1 , m ) ) 2 c = c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( m μ 2 c , μ 1 , m ) ψ ( x ) d x ψ 2 m μ 1 + η ( μ 2 , μ 1 , m ) 2 c .
In this way, the proof is completed. □
Theorem 11.
Let ψ be defined as in Theorem 10. If | ψ | is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , the following inequality holds:
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 1 n i = 1 n 2 s 4 i | ψ ( μ 1 ) | + m i | ψ μ 2 c | .
Proof. 
Using Lemma 3, one has
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x = η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | d θ .
Since | ψ | is an n–polynomial s–type m–preinvex on ( μ 1 , μ 1 + η ( μ 2 , μ 1 ) ) , we have
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | 1 n i = 1 n ( 1 s ( 1 θ ) ) i | ψ ( μ 1 ) | + 1 n i = 1 n m i ( 1 ( s θ ) i ) | ψ μ 2 c | d θ η ( μ 2 , c μ 1 , m ) 2 c | ψ ( μ 1 ) | 0 1 | 1 2 θ | 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | 0 1 | 1 2 θ | 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ .
Since,
0 1 1 s 1 θ | 1 2 θ | d θ = 0 1 1 s θ | 1 2 θ | d θ = s 2 4 .
Using these computations in (11), we get the desired result. □
Corollary 2.
Considering n = s = 1 in Theorem 11, then the above theorem become
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 8 c | ψ ( μ 1 ) | + 4 m | ψ μ 2 c | .
Corollary 3.
Considering n = s = m = 1 in Theorem 11, then
ψ ( μ 1 ) + ψ ( μ 1 + η ( μ 2 c , μ 1 ) ) 2 c η ( μ 2 , c μ 1 ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x η ( μ 2 , c μ 1 ) 8 c | ψ ( μ 1 ) | + 4 | ψ μ 2 c | .
Corollary 4.
Considering n = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 11, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 c 2 s 4 | ψ ( μ 1 ) | + m | ψ μ 2 c | .
Corollary 5.
Considering n = s = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 11, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 8 c | ψ ( μ 1 ) | + 4 m | ψ μ 2 c | .
Theorem 12.
Let ψ be defined as in Theorem 10. If | ψ | is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) . If | ψ | q is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] , s [ 0 , 1 ] and for p , q > 1 , 1 q + 1 p = 1 , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) the following inequality holds:
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 1 p + 1 1 / p 1 n i = 1 n 2 s 2 i | ψ ( μ 1 ) | q + m i | ψ μ 2 c | q 1 / q .
Proof. 
From Lemma 3 and using Hölder’s inequality, we have
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x = η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | d θ η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | p d θ 1 / p 0 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q .
Since | ψ | q is an n–polynomial s–type m–preinvex on ( μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , we have
0 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ = | ψ ( μ 1 ) | q 0 1 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ .
Now, Equation (12) becomes
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 1 p + 1 1 / p × | ψ ( μ 1 ) | q 0 1 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ 1 / q .
Since,
0 1 1 s 1 θ d θ = 0 1 1 s θ d θ = s 2 2 . 0 1 | 1 2 θ | p d θ = 1 p + 1 .
Using the above computations in (13), we have the desired result. □
Corollary 6.
Considering n = s = 1 in Theorem 12, then
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 1 + q q c 1 p + 1 1 / p | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Corollary 7.
Considering n = s = m = 1 in Theorem 12, then
ψ ( μ 1 ) + ψ ( μ 1 + η ( μ 2 c , μ 1 ) ) 2 c η ( μ 2 , c μ 1 ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x η ( μ 2 , c μ 1 ) 2 1 + q q c 1 p + 1 1 / p | ψ ( μ 1 ) | q + | ψ μ 2 c | q 1 / q .
Corollary 8.
Considering n = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 12, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 c 1 p + 1 1 / p 2 s 2 | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Corollary 9.
Putting n = s = 1 and η ( μ 1 , μ 2 ) = μ 1 μ 2 in Theorem 12, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 1 + q q c 1 p + 1 1 / p | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Theorem 13.
Let ψ be defined as in Theorem 10. If | ψ | is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) . If | ψ | q is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] , s [ 0 , 1 ] and for p , q > 1 , 1 q + 1 p = 1 , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , the following inequality holds:
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) c 1 2 p + 1 p 1 n i = 1 n 2 s 4 i | ψ ( μ 1 ) | q + m i | ψ μ 2 c | q 1 / q .
Proof. 
Using Lemma 3 and Hölder’s inequality, one has
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | d θ = η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | 1 / p | 1 2 θ | 1 / q | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | d θ η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | d θ 1 / p 0 1 | 1 2 θ | | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q .
Since | ψ | q is an n–polynomial s-type m–preinvex on ( μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , we have
0 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ = | ψ ( μ 1 ) | q 0 1 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ .
Now, Equation (15) becomes
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | d θ 1 / p | ψ ( μ 1 ) | q 0 1 | 1 2 θ | 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 | 1 2 θ | 1 n i = 1 n m i ( 1 ( s k ) i ) d θ 1 / q .
Since,
0 1 | 1 2 θ | 1 s 1 θ d θ = 0 1 | 1 2 θ | 1 s θ d θ = s 2 4 . 0 1 | 1 2 θ | d θ = 1 2 .
The proof of the Theorem gets completed by using these computations in (17). □
Corollary 10.
Putting n = s = 1 in Theorem 13, then
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 ) c 1 2 2 q + 1 q | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Corollary 11.
Choosing n = s = m = 1 in Theorem 13, then
ψ ( μ 1 ) + ψ ( μ 1 + η ( μ 2 c , μ 1 ) ) 2 c η ( μ 2 , c μ 1 ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x η ( μ 2 , c μ 1 ) c 1 2 2 q + 1 q | ψ ( μ 1 ) | q + | ψ μ 2 c | q 1 / q .
Corollary 12.
Considering n = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 13, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) c 1 2 p + 1 p 2 s 4 | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Corollary 13.
Putting n = s = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 13, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) c 1 2 2 q + 1 q | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Theorem 14.
Let ψ be defined as in Theorem 10. If | ψ | is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) . If | ψ | q is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] , s [ 0 , 1 ] and for p , q > 1 , 1 q + 1 p = 1 , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , the following inequality holds:
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 1 2 ( p + 1 ) 1 / p i = 1 n 3 2 s 6 i | ψ ( μ 1 ) | q + i = 1 n 3 s 6 i m i | ψ μ 2 c | q 1 / q + 1 n i = 1 n 3 s 6 i | ψ ( μ 1 ) | q + 1 n i = 1 n 3 2 s 6 i m i | ψ μ 2 c | q 1 / q .
Proof. 
From Lemma 3 and using Hölder–Íscan inequality, we have
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 ( 1 θ ) | 1 2 θ | p d θ 1 / p 0 1 ( 1 θ ) | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q + 0 1 θ | 1 2 θ | p d θ 1 / p 0 1 θ | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q
Since | ψ | q is an n–polynomial s–type m–preinvex on ( μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , we have
0 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ = | ψ ( μ 1 ) | q 0 1 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ
Now, Equation (18) becomes
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 ( 1 θ ) | 1 2 θ | p d θ 1 / p | ψ ( μ 1 ) | q 0 1 ( 1 θ ) 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 ( 1 θ ) 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ 1 / q + 0 1 θ | 1 2 θ | p d θ 1 / p × | ψ ( μ 1 ) | q 0 1 θ 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 θ 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ 1 / q .
Since,
0 1 ( 1 θ ) 1 s 1 θ d θ = 0 1 θ 1 s θ d θ = 2 s 3 6 . 0 1 θ 1 s 1 θ d θ = 0 1 ( 1 θ ) 1 s θ d θ = s 3 6 . 0 1 θ | 1 2 θ | p d θ = 0 1 ( 1 θ ) | 1 2 θ | p d θ = 1 2 ( p + 1 ) .
Consequently, using the above computations in (20) lead us to the desired result. □
Corollary 14.
Considering n = s = 1 in Theorem 14, then
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 1 2 ( p + 1 ) 1 / p 1 6 | ψ ( μ 1 ) | q + 1 3 m | ψ μ 2 c | q 1 / q + 1 3 | ψ ( μ 1 ) | q + 1 6 m | ψ μ 2 c | q 1 / q .
Corollary 15.
Considering n = s = m = 1 in Theorem 14, then
ψ ( μ 1 ) + ψ ( μ 1 + η ( μ 2 c , μ 1 ) ) 2 c η ( μ 2 , c μ 1 ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x η ( μ 2 , c μ 1 ) 2 c 1 2 ( p + 1 ) 1 / p 1 6 | ψ ( μ 1 ) | q + 1 3 | ψ μ 2 c | q 1 / q + 1 3 | ψ ( μ 1 ) | q + 1 6 | ψ μ 2 c | q 1 / q .
Corollary 16.
Considering n = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 14, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 c 1 2 ( p + 1 ) 1 / p 3 2 s 6 | ψ ( μ 1 ) | q + 3 s 6 m | ψ μ 2 c | q 1 / q + 3 s 6 | ψ ( μ 1 ) | q + 3 2 s 6 m | ψ μ 2 c | q 1 / q .
Corollary 17.
Considering n = s = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 14, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 c 1 2 ( p + 1 ) 1 / p 1 6 | ψ ( μ 1 ) | q + 1 3 m | ψ μ 2 c | q 1 / q + 1 3 | ψ ( μ 1 ) | q + 1 6 m | ψ μ 2 c | q 1 / q .
Theorem 15.
Let ψ be defined as in Theorem 10. If | ψ | is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) . If | ψ | q is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] , s [ 0 , 1 ] and for q 1 , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , the following inequality holds:
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 1 4 1 1 / q 1 n i = 1 n 4 3 s 16 i | ψ ( μ 1 ) | q + 1 n i = 1 n 4 s 16 i m i | ψ μ 2 c | q 1 / q + 1 n i = 1 n 4 s 16 i | ψ ( μ 1 ) | q + 1 n i = 1 n 4 3 s 16 i m i | ψ μ 2 c | q 1 / q .
Proof. 
From Lemma 3 and using improved power-mean inequality, we have
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 ( 1 θ ) | 1 2 θ | d θ 1 1 / q × 0 1 ( 1 θ ) | 1 2 θ | | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q + 0 1 θ | 1 2 θ | d θ 1 1 / q 0 1 θ | 1 2 θ | | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q .
Since | ψ | q is an n–polynomial s–type m–preinvex on ( μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , we have
0 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ = | ψ ( μ 1 ) | q 0 1 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ .
Now, Equation (21) becomes
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 ( 1 θ ) | 1 2 θ | d θ 1 1 / q × | ψ ( μ 1 ) | q 0 1 ( 1 θ ) | 1 2 θ | i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 ( 1 θ ) | 1 2 θ | 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ 1 / q + 0 1 θ | 1 2 θ | d θ 1 1 / q | ψ ( μ 1 ) | q 0 1 θ | 1 2 θ | 1 n i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 θ | 1 2 θ | 1 n i = 1 n m i ( 1 ( s θ ) i ) d θ 1 / q .
Since,
0 1 ( 1 θ ) | 1 2 θ | 1 s 1 θ d θ = 0 1 θ | 1 2 θ | 1 s θ d θ = 3 s 4 16 . 0 1 θ | 1 2 θ | 1 s 1 θ d θ = 0 1 ( 1 θ ) | 1 2 θ | 1 s θ d θ = s 4 16 . 0 1 θ | 1 2 θ | d θ = 0 1 ( 1 θ ) | 1 2 θ | d θ = 1 4 .
Using the computations in (23) gives us the desired result. □
Corollary 18.
Considering n = s = 1 in Theorem 15, then
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 1 4 1 1 / q 1 16 | ψ ( μ 1 ) | q + 3 m 16 | ψ μ 2 c | q 1 / q + 3 16 | ψ ( μ 1 ) | q + m 16 | ψ μ 2 c | q 1 / q .
Corollary 19.
Considering n = s = m = 1 in Theorem 15, then
ψ ( μ 1 ) + ψ ( μ 1 + η ( μ 2 c , μ 1 ) ) 2 c η ( μ 2 , c μ 1 ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x η ( μ 2 , c μ 1 ) 2 c 1 4 1 1 / q 1 16 | ψ ( μ 1 ) | q + 3 16 | ψ μ 2 c | q 1 / q + 3 16 | ψ ( μ 1 ) | q + 1 16 | ψ μ 2 c | q 1 / q .
Corollary 20.
Considering n = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 15, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 c 1 4 1 1 / q 4 3 s 16 | ψ ( μ 1 ) | q + 4 s 16 m | ψ μ 2 c | q 1 / q + 4 s 16 | ψ ( μ 1 ) | q + 4 3 s 16 m | ψ μ 2 c | q 1 / q .
Corollary 21.
Considering n = s = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 15, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 c 1 4 1 1 / q 1 16 | ψ ( μ 1 ) | q + 3 m 16 | ψ μ 2 c | q 1 / q + 3 16 | ψ ( μ 1 ) | q + m 16 | ψ μ 2 c | q 1 / q .
Theorem 16.
Let ψ be defined as in Theorem 10. If | ψ | is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) . If | ψ | q is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] , s [ 0 , 1 ] and for q 1 , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , the following inequality holds:
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 1 2 1 1 q i = 1 n 2 s 4 i | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Proof. 
From Lemma 3 and using power-mean inequality, we have
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | d θ η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | d θ 1 1 / q 0 1 | 1 2 θ | | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q .
Since | ψ | q is an n–polynomial s–type m–preinvex on ( μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , we have
0 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ = | ψ ( μ 1 ) | q 0 1 i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 i = 1 n ( 1 ( s θ ) i ) d θ .
Now, Equation (25) becomes
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 μ 1 + η ( m μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 c 0 1 | 1 2 θ | d θ 1 1 / q | ψ ( μ 1 ) | q 0 1 | 1 2 θ | i = 1 n ( 1 s ( 1 θ ) ) i d θ + | ψ μ 2 c | q 0 1 | 1 2 θ | i = 1 n m i ( 1 ( s θ ) i ) d θ 1 / q .
Since,
0 1 | 1 2 θ | 1 s 1 θ d θ = 0 1 | 1 2 θ | 1 s θ d θ = s 2 4 . 0 1 | 1 2 θ | d θ = 1 2 .
The proof of the Theorem gets completed by using these computations in (26). □
Corollary 22.
Considering n = s = 1 in Theorem 16, we obtain the following inequality:
ψ ( μ 1 ) + ψ ( m μ 1 + η ( μ 2 c , μ 1 , m ) ) 2 c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x η ( μ 2 , c μ 1 , m ) 2 2 q + 1 q c | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Corollary 23.
Considering n = s = m = 1 in Theorem 16, we obtain the following inequality:
ψ ( μ 1 ) + ψ ( μ 1 + η ( μ 2 c , μ 1 ) ) 2 c η ( μ 2 , c μ 1 ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x η ( μ 2 , c μ 1 ) 2 2 q + 1 q c | ψ ( μ 1 ) | q + | ψ μ 2 c | q 1 / q .
Corollary 24.
If we set n = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 16, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 c 1 2 1 1 q 2 s 4 | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Corollary 25.
If we set n = s = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 , in Theorem 16, then
ψ ( μ 1 ) + ψ ( μ 2 c ) 2 c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ( μ 2 m c μ 1 ) 2 2 q + 1 q c | ψ ( μ 1 ) | q + m | ψ μ 2 c | q 1 / q .
Theorem 17.
Let ψ be defined as in Theorem 10. If | ψ | is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) . If | ψ | q is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] , s [ 0 , 1 ] and for p , q > 1 , 1 q + 1 p = 1 , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , the following inequality holds:
c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x ψ 2 m μ 1 + η ( μ 2 , μ 1 , m ) 2 c η ( μ 2 , c μ 1 , m ) c 1 p + 1 1 / p i = 1 n 2 s 2 i [ | ψ ( μ 1 ) | q + m i | ψ ( μ 2 c ) | q ] 1 / q + i = 1 n 4 3 s 8 i [ | ψ ( μ 1 ) | q + m i | ψ ( μ 2 c ) | q ] 1 / q .
Proof. 
From Lemma 4 and using Hölder’s inequality, we have
c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x ψ 2 m μ 1 + η ( μ 2 , μ 1 , m ) 2 c = η ( μ 2 , c μ 1 , m ) c 0 1 θ ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ 1 / 2 1 ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ η ( μ 2 , c μ 1 , m ) c 0 1 θ p d θ 1 / p 0 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q + 1 / 2 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q η ( μ 2 , c μ 1 , m ) c 1 p + 1 1 / p 0 1 i = 1 n ( 1 s ( 1 θ ) ) | ψ μ 1 | q d θ + 0 1 i = 1 n m i ( 1 ( s θ ) i ) | ψ μ 2 c | q d θ 1 / q + 1 / 2 1 i = 1 n ( 1 s ( 1 θ ) i | ψ μ 1 | q d θ + 1 / 2 1 i = 1 n m i ( 1 ( s θ ) i ) | ψ μ 2 c | q d θ 1 / q = η ( μ 2 , c μ 1 , m ) c 1 p + 1 1 / p i = 1 n 2 s 2 i [ | ψ ( μ 1 ) | q + m i | ψ ( μ 2 c ) | q ] 1 / q + i = 1 n 4 3 s 8 i [ | ψ ( μ 1 ) | q + m i | ψ ( μ 2 c ) | q ] 1 / q .
Corollary 26.
Cobsidering n = s = 1 in Theorem 17, we obtain the following inequality:
c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x ψ 2 m μ 1 + η ( μ 2 , μ 1 , m ) 2 c η ( μ 2 , c μ 1 , m ) c 1 p + 1 1 / p 1 2 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q + 1 8 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q .
Corollary 27.
Considering n = s = m = 1 in Theorem 17, then
c η ( μ 2 , c μ 1 ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x ψ 2 μ 1 + η ( μ 2 , μ 1 ) 2 c η ( μ 2 , c μ 1 ) c 1 p + 1 1 / p 1 2 [ | ψ ( μ 1 ) | q + | ψ ( μ 2 c ) | q ] 1 / q + 1 8 [ | ψ ( μ 1 ) | q + | ψ ( μ 2 c ) | q ] 1 / q .
Corollary 28.
If we set n = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 17, then
c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ψ m μ 1 + μ 2 2 c ( μ 2 m c μ 1 ) c 1 p + 1 1 / p 2 s 2 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q + 4 3 s 8 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q .
Corollary 29.
If we set n = s = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 17, then
c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ψ m μ 1 + μ 2 2 c ( μ 2 m c μ 1 ) c 1 p + 1 1 / p 1 2 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q + 1 8 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q .
Theorem 18.
Let ψ be defined as in Theorem 10. If | ψ | is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] and s [ 0 , 1 ] , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) . If | ψ | q is an n–polynomial s–type m–preinvex function on X for some fixed m ( 0 , 1 ] , s [ 0 , 1 ] and for q 1 , then for each x ( m μ 1 , m μ 1 + η ( μ 2 , μ 1 , m ) ) , the following inequality holds:
c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x ψ 2 m μ 1 + η ( μ 2 , μ 1 , m ) 2 c η ( μ 2 , c μ 1 , m ) c 1 2 1 1 / q i = 1 n 3 s 6 i | ψ ( μ 1 ) | q + i = 1 n 3 2 s 6 i m i | ψ ( μ 2 c ) | q 1 / q + i = 1 n 4 3 s 8 i [ | ψ ( μ 1 ) | q + m i | ψ ( μ 2 c ) | q ] 1 / q .
Proof. 
From Lemma 4 and using power-mean inequality, we have
c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x ψ 2 m μ 1 + η ( μ 2 , μ 1 , m ) 2 c = η ( μ 2 , c μ 1 , m ) c 0 1 θ ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ 1 / 2 1 ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) d θ η ( μ 2 , c μ 1 , m ) c 0 1 θ d θ 1 1 / q 0 1 θ | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q + 1 / 2 1 | ψ m μ 2 c + θ η ( μ 1 , μ 2 c , m ) | q d θ 1 / q η ( μ 2 , c μ 1 , m ) c 1 2 1 1 / q 0 1 θ i = 1 n ( 1 s ( 1 θ ) ) i | ψ μ 1 | q d θ + 0 1 θ i = 1 n m i ( 1 ( s θ ) i ) | ψ μ 2 c | q d θ 1 / q + 1 / 2 1 i = 1 n ( 1 s ( 1 θ ) ) i | ψ μ 1 | q d θ + 1 / 2 1 i = 1 n m i ( 1 ( s θ ) i ) | ψ μ 2 c | q d θ 1 / q = η ( μ 2 , c μ 1 , m ) c 1 2 1 1 / q i = 1 n 3 s 6 i | ψ ( μ 1 ) | q + i = 1 n 3 2 s 6 i m i | ψ ( μ 2 c ) | q 1 / q + i = 1 n 4 3 s 8 i [ | ψ ( μ 1 ) | q + m i | ψ ( μ 2 c ) | q ] 1 / q .
Corollary 30.
Considering n = s = 1 in Theorem 18, then
c η ( μ 2 , c μ 1 , m ) μ 1 m μ 1 + η ( μ 2 c , μ 1 , m ) ψ ( x ) d x ψ 2 m μ 1 + η ( μ 2 , μ 1 , m ) 2 c η ( μ 2 , c μ 1 , m ) c 1 2 1 1 / q 1 3 | ψ ( μ 1 ) | q + m 6 | ψ ( μ 2 c ) | q 1 / q + 1 8 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q .
Corollary 31.
Considering n = s = m = 1 in Theorem 18, then
c η ( μ 2 , c μ 1 ) μ 1 μ 1 + η ( μ 2 c , μ 1 ) ψ ( x ) d x ψ 2 μ 1 + η ( μ 2 , μ 1 ) 2 c η ( μ 2 , c μ 1 ) c 1 2 1 1 / q 1 3 | ψ ( μ 1 ) | q + 1 6 | ψ ( μ 2 c ) | q 1 / q + 1 8 [ | ψ ( μ 1 ) | q + | ψ ( μ 2 c ) | q ] 1 / q .
Corollary 32.
Considering n = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 18, then
c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ψ m μ 1 + μ 2 ) 2 c ( μ 2 m c μ 1 ) c 1 2 1 1 / q 3 s 6 | ψ ( μ 1 ) | q + 3 2 s 6 m | ψ ( μ 2 c ) | q 1 / q + 4 3 s 8 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q .
Corollary 33.
If we set n = s = 1 and η ( μ 1 , μ 2 , m ) = μ 1 m μ 2 in Theorem 18, then
c ( μ 2 m c μ 1 ) μ 1 μ 2 c ψ ( x ) d x ψ m μ 1 + μ 2 2 c ( μ 2 m c μ 1 ) c 1 2 1 1 / q 1 3 | ψ ( μ 1 ) | q + m 6 | ψ ( μ 2 c ) | q 1 / q + 1 8 [ | ψ ( μ 1 ) | q + m | ψ ( μ 2 c ) | q ] 1 / q .
In future, we believe the outcomes of this manuscript and the newly investigated concept can be estimated and generalized in various ways such as time scale calculus, Raina convexity, s-type Raina convexity, fractional calculus and quantam calculus, etc. We believe the procedure and fruitful techniques of this manuscript will motivate for further research in this direction.

6. Conclusions

In this article, first we introduced a new notion of preinvexity namely an n–polynomial s–type m–preinvex function and discussed its algebraic properties. Then, we establish a new variant of Hermite–Hadamard type inequality in the setting of the new notion. Next, two new integral equalities are presented for differentiable preinvex function and considering them as auxiliary results, several refinements of Hermite-Hadamard type inequality are reviewed. Employing Lemma 3, we presented three Theorems 12–14, where the Hölder and Hölder–İscan inequality are used. It is observed that Theorem 14 provides better result as compared to Theorems 12 and 13. Similarly, employing Lemma 3, Theorems 15 and 16 are derived using power-mean and improved power-mean inequality, and we conclude that Theorem 15 provides better result than Theorem 16.

Author Contributions

Conceptualization, M.T. and S.K.S.; methodology, M.T.; H.A.; H.B. and S.K.S.; software, M.T. and S.K.S.; validation, H.A.; H.B.; T.S. and J.R.; formal analysis, M.T.; H.A.; H.B.; S.K.S.; T.S. and J.R.; investigation, M.T.; H.A.; H.B. and S.K.S.; resources, M.T.; H.A. and S.K.S.; data curation, H.B.; T.S. and J.R.; writing—original draft preparation, M.T.; H.A. and S.K.S.; writing—review and editing, M.T. and S.K.S.; supervision, H.A.; H.B.; T.S. and J.R.; project administration, M.T.; H.A. and S.K.S.; funding acquisition, T.S. and J.R. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Science, Research and Innovation Fund (NSRF), and King Mongkut’s University of Technology North Bangkok with Contract no. KMUTNB-FF-65-49.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Acknowledgments

We would like to thank the National Science, Research and Innovation Fund (NSRF), and King Mongkut’s University of Technology North Bangkok with Contract no. KMUTNB-FF-65-49.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hardy, G.H.; Little, J.E.; Pólya, G. Inequalities; Cambridge Mathematical Library, Cambridge University Press: Cambridge, UK, 1952. [Google Scholar]
  2. Xi, B.Y.; Qi, F. Some integral inequalities of Hermite–Hadamard type for convex functions with applications to means. J. Funct. Spaces Appl. 2012, 2012, 980438. [Google Scholar] [CrossRef] [Green Version]
  3. Niculescu, C.P.; Persson, L.E. Convex Functions and Their Applications; Springer: New York, NY, USA, 2006. [Google Scholar]
  4. Özcan, S.; İşcan, İ. Some new Hermite-Hadamard type integral inequalities for the s–convex functions and theirs applications. J. Inequal. Appl. 2019, 2019, 201. [Google Scholar] [CrossRef] [Green Version]
  5. Khan, M.A.; Chu, Y.M.; Khan, T.U.; Khan, J. Some new inequalities of Hermite–Hadamard type for s–convex functions with applications. Open Math. 2017, 15, 1414–1430. [Google Scholar] [CrossRef]
  6. Tariq, M.; Sahoo, S.K.; Jarad, F.; Kodamasingh, B. Some integral inequalities for generalized preinvex functions with applications. AIMS Math. 2021, 6, 13907–13930. [Google Scholar] [CrossRef]
  7. Tariq, M.; Shaikh, A.A.; Sahoo, S.K.; Ahmad, H.; Sitthiwirattham, T.; Reunsumrit, J. New Integral Inequalities via Generalized Preinvex Functions. Axioms 2021, 10, 296. [Google Scholar] [CrossRef]
  8. Latif, M.A. Hermite–Hadamard-type inequalities for geometrically r-convex functions in terms of Stolarskys mean with applications to means. Adv. Differ. Equ. 2021, 2021, 371. [Google Scholar] [CrossRef]
  9. Hadamard, J. Étude sur les propriétés des fonctions entiéres en particulier d’une fonction considéréé par Riemann. J. Math. Pures. Appl. 1893, 58, 171–215. [Google Scholar]
  10. Baleanu, D.; Purohit, S.D. Chebyshev type integral inequalities involving the fractional hypergeometric operators. Abstr. Appl. Anal. 2014, 2014, 609160. [Google Scholar] [CrossRef]
  11. Guzmán, P.M.; Kórus, P.; Valdés, J.E.N. Generalized integral inequalities of Chebyshev type. Fractal Fract. 2020, 4, 10. [Google Scholar] [CrossRef] [Green Version]
  12. İşcan, İ.; Turhan, S.; Maden, S. Hermite–Hadamard and simpson–like type inequalities for differentiable p–quasi convex Functions. Filomat 2017, 31, 5945–5953. [Google Scholar] [CrossRef] [Green Version]
  13. Toader, G. Some generalizations of the convexity. In Proceedings of the Colloquium on Approximation and Optimization, Cluj–Napoca, Romania, 25–27 October 1984; pp. 329–338. [Google Scholar]
  14. 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] [Green Version]
  15. 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] [Green Version]
  16. Toplu, T.; Kadakal, M.; İşcan, İ. On n–polynomial convexity and some relatd inequalities. AIMS Math 2020, 5, 1304–1318. [Google Scholar] [CrossRef]
  17. Butt, S.I.; Kashuri, A.; Tariq, M.; Nasir, J.; Aslam, A.; Geo, W. Hermite–Hadamard–type inequalities via n–polynomial exponential–type convexity and their applications. Adv. Differ. Equ. 2020, 2020, 508. [Google Scholar] [CrossRef]
  18. Butt, S.I.; Tariq, M.; Aslam, A.; Ahmad, H.; Nofel, T.A. Hermite–Hadamard type inequalities via generalized harmonic exponential convexity. J. Funct. Spaces 2021, 2021, 5533491. [Google Scholar] [CrossRef]
  19. Tariq, M.; Nasir, J.; Sahoo, S.K.; Mallah, A.A. A note on some Ostrowski type inequalities via generalized exponentially convex functions. J. Math. Anal. Model. 2021, 2, 1–15. [Google Scholar]
  20. 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, 264. [Google Scholar] [CrossRef]
  21. 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]
  22. Chen, S.B.; Rashid, S.; Noor, M.A.; Hammouch, Z.; Chu, Y.M. New fractional approaches for n-polynomial P-convexity with applications in special function theory. Adv. Differ. Equ. 2020, 2020, 543. [Google Scholar] [CrossRef]
  23. Awan, M.U.; Akhtar, N.; Iftikhar, S.; Noor, M.A.; Chu, Y.M. New Hermite–Hadamard type inequalities for n-polynomial harmonically convex functions. J. Inequal. Appl. 2020, 2020, 125. [Google Scholar] [CrossRef]
  24. Du, T.T.; 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] [Green Version]
  25. Weir, T.; Mond, B. Pre–inven functions in multiple objective optimization. J. Math. Anal. Appl. 1988, 136, 29–38. [Google Scholar] [CrossRef] [Green Version]
  26. Noor, M.A. Hadamard integral inequalities for product of two preinvex function. Nonl. Anal. Forum 2009, 14, 167–173. [Google Scholar]
  27. Noor, M.A. Some new classes of nonconvex functions. Nonl. Funct. Anal. Appl. 2006, 11, 165–171. [Google Scholar]
  28. Noor, M.A. On Hadamard integral inequalities invoving two log-preinvex functions. J. Inequal. Pure Appl. Math. 2007, 8, 75. [Google Scholar]
  29. Awan, M.U.; Talib, S.; Noor, M.A.; Chu, Y.M.; Noor, K.I. Some trapezium–like inequalities involving functions having strongly n–polynomial preinvexity property of higher order. J. Funct. Spaces 2020, 2020, 9154139. [Google Scholar] [CrossRef]
  30. Mohan, S.R.; Neogy, S.K. On invex sets and preinvex functions. J. Math. Anal. Appl. 1995, 189, 901–908. [Google Scholar] [CrossRef] [Green Version]
  31. Du, T.S.; Liao, J.G.; Chen, L.G.; 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] [Green Version]
  32. Mishra, S.K.; Giorgi, G. Invexity and Optimization; Springer: Berlin, Germany, 2008. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

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. https://doi.org/10.3390/axioms10040328

AMA Style

Tariq M, Ahmad H, Budak H, Sahoo SK, Sitthiwirattham T, Reunsumrit J. A Comprehensive Analysis of Hermite–Hadamard Type Inequalities via Generalized Preinvex Functions. Axioms. 2021; 10(4):328. https://doi.org/10.3390/axioms10040328

Chicago/Turabian Style

Tariq, Muhammad, Hijaz Ahmad, Hüseyin Budak, Soubhagya Kumar Sahoo, Thanin Sitthiwirattham, and Jiraporn Reunsumrit. 2021. "A Comprehensive Analysis of Hermite–Hadamard Type Inequalities via Generalized Preinvex Functions" Axioms 10, no. 4: 328. https://doi.org/10.3390/axioms10040328

APA Style

Tariq, M., Ahmad, H., Budak, H., Sahoo, S. K., Sitthiwirattham, T., & Reunsumrit, J. (2021). A Comprehensive Analysis of Hermite–Hadamard Type Inequalities via Generalized Preinvex Functions. Axioms, 10(4), 328. https://doi.org/10.3390/axioms10040328

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop