Abstract
In this paper, we introduce a new class of harmonic convex functions with respect to an arbitrary trifunction F(·,·,·): K×K×[0,1]→R, which is called generalized strongly harmonic convex functions. We study some basic properties of strongly harmonic convex functions. We also discuss the sufficient conditions of optimality for unconstrained and inequality constrained programming under the generalized harmonic convexity. Several special cases are discussed as applications of our results. Ideas and techniques of this paper may motivate further research in different fields.
Highlights
The concept of convexity and generalized convexity in the study of optimality to solve mathematical programming, have been extended using innovative ideas and techniques
We introduce a new class of harmonic convex functions with respect to an arbitrary trifunction F (·, ·, ·) : K × K × [0, 1] → R, which is called generalized strongly harmonic convex functions
We study some basic properties of strongly harmonic convex functions
Summary
The concept of convexity and generalized convexity in the study of optimality to solve mathematical programming, have been extended using innovative ideas and techniques. We introduce a new class of harmonic convex functions with respect to an arbitrary trifunction F (·, ·, ·) : K × K × [0, 1] → R, which is called generalized strongly harmonic convex functions. We consider the concept of generalized strongly harmonic convex functions with respect to an arbitrary trifunction F (·, ·, ·) : K × K × [0, 1] → R.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Analysis and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.