Abstract
Fractal analysis is one of interesting research areas of computer science and engineering, which depicts a precise description of phenomena in modeling. Visual beauty and self-similarity has made it an attractive field of research. The fractal sets are the effective tools to describe the accuracy of the inequalities for convex functions. In this paper, we employ linear fractals
R
α
to investigate the
(
s
,
m
)
-convexity and relate them to derive generalized Hermite–Hadamard (HH) type inequalities and several other associated variants depending on an auxiliary result. Under this novel approach, we aim at establishing an analog with the help of local fractional integration. Meanwhile, we establish generalized Simpson-type inequalities for
(
s
,
m
)
-convex functions. The results in the frame of local fractional showed that among all comparisons, we can only see the correlation between novel strategies and the earlier consequences in generalized
s
-convex, generalized
m
-convex, and generalized convex functions. We obtain application in probability density functions and generalized special means to confirm the relevance and computational effectiveness of the considered method. Similar results in this dynamic field can also be widely applied to other types of fractals and explored similarly to what has been done in this paper.