<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-interdisciplinary-mathematics</journal-id>
      <journal-title-group>
        <journal-title>Journal of Interdisciplinary Mathematics</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-012X</issn>
      <issn publication-format="print">0972-0502</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JIM-1481</article-id>
      <title-group>
        <article-title>Some properties of semi (p, e)-convexity</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Hazim</surname>
            <given-names>Rivan Emad</given-names>
          </name>
          <aff>Department of Mathematics, College of Education for Pure Science (Ibn-Al-Haitham), University of Baghdad, Baghdad, Iraq</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Majeed</surname>
            <given-names>Saba Naser</given-names>
          </name>
          <aff>Department of Mathematics, College of Education for Pure Science (Ibn-Al-Haitham), University of Baghdad, Baghdad, Iraq</aff>
        </contrib>
      </contrib-group>
      <volume>26</volume>
      <issue>4</issue>
      <fpage>629</fpage>
      <lpage>635</lpage>
      <pub-date date-type="pub">
        <day>15</day>
        <month>07</month>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>In this paper, we present a new class of functions called semi (p, e)-convex functions which represent a combination of  p- convex and semi e-convex functions. We discuss some important properties and characteristics of this class. For applying this class of new functions to optimize programming, we present some optimality properties such that the cost function of the optimization programming is semi (p, e)-convex and the set of constraints is (p, e)-convex.</p>
      </abstract>
      <kwd-group>
        <kwd>(p</kwd>
        <kwd>e)-convex set</kwd>
        <kwd>(p</kwd>
        <kwd>e)-convex function</kwd>
        <kwd>Semi (p</kwd>
        <kwd>e)-convex function</kwd>
        <kwd>Nonlinear optimization problem</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
