Ebrahim A. Youness, Tarek Emam
Abstract
In this study a new class of functions, called semi strongly E-convex functions, and generalized semi strongly E-convex functions are defined .We discuss some their basic properties and obtain sufficient optimality criteria for nonlinear programming problems involving these functions.
OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this study a new class of functions, called semi strongly E-convex functions, and generalized semi strongly E-convex functions are defined .We discuss some their basic properties and obtain sufficient optimality criteria for nonlinear programming problems involving these functions.
Key concepts: Mathematics, Regular polygon, Convex function, Pure mathematics, Combinatorics, Geometry