2018
DOI: 10.3390/sym10100493
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Preinvex Functions and Their Applications

Abstract: A class of function called sub-b-s-preinvex function is defined as a generalization of s-convex and b-preinvex functions, and some of its basic properties are presented here. The sufficient conditions of optimality for unconstrainded and inquality constrained programming are discussed under the sub-b-s-preinvexity. Moreover, some new inequalities of the Hermite—Hadamard type for differentiable sub-b-s-preinvex functions are presented. Examples of applications of these inequalities are shown.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
8
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 20 publications
0
8
0
Order By: Relevance
“…Later, the same authors [18] obtained necessary optimality conditions for an optimization problem on complete Riemannian manifolds, but they did not obtain characterizations. Kiliçman and Saleh [19] presented a Karush-Kuhn-Tucker sufficient optimality condition as well as a new Hermite-Hadamard-type integral inequality using differentiable sub-b-s-preinvex functions.…”
Section: Introductionmentioning
confidence: 99%
“…Later, the same authors [18] obtained necessary optimality conditions for an optimization problem on complete Riemannian manifolds, but they did not obtain characterizations. Kiliçman and Saleh [19] presented a Karush-Kuhn-Tucker sufficient optimality condition as well as a new Hermite-Hadamard-type integral inequality using differentiable sub-b-s-preinvex functions.…”
Section: Introductionmentioning
confidence: 99%
“…One example of these is how the convexity was applied to estimate errors when using a trapezoidal formula for numerical integration [6,7]. Others include studying problems in nonlinear programming and applying them to special means [8]. Among them, an interesting inequality for convex function is of Hermite-Hadamard type, which can be stated as follows:…”
Section: Introductionmentioning
confidence: 99%
“…Hermite-Hadamard inequality based on log-preinvex function was presented by Noor [7,8]. Many papers have appeared in the literature under the concept of preinvexity (see, [9][10][11][12][13][14][15]).…”
Section: Introductionmentioning
confidence: 99%