<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-information-and-optimization-sciences</journal-id>
      <journal-title-group>
        <journal-title>Journal of Information and Optimization Sciences</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0103</issn>
      <issn publication-format="print">0252-2667</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JIOS-1224</article-id>
      <title-group>
        <article-title>Solving a quadratic fractional problem via a new quadratic formulation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Ahlem</surname>
            <given-names>Bennani</given-names>
          </name>
          <aff>Department of Mathematics, Faculty of Sciences, Laboratory of Fundamental and Numerical Mathematics, University of Ferhat Abbas Setif-1, 19000, Algeria</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Benterki</surname>
            <given-names>Dj.</given-names>
          </name>
          <aff>Department of Mathematics, Faculty of Sciences, Laboratory of Fundamental and Numerical Mathematics, University of Ferhat Abbas Setif-1, 19000, Algeria</aff>
        </contrib>
      </contrib-group>
      <volume>47</volume>
      <issue>1</issue>
      <fpage>1</fpage>
      <lpage>15</lpage>
      <pub-date date-type="pub">
        <day>03</day>
        <month>02</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>We present two different techniques for solving a quadratic fractional program. The first one uses Taylor’s development which makes it possible to transform the quadratic fractional programming problem into an equivalent linear programming problem that will be solved via an interior point approach. The second one allows us to transform the quadratic fractional programming problem into an equivalent quadratic program that will be solved by an efficient algorithm for this class of problems. The established comparative numerical tests show that the algorithm works properly and confirms the effectiveness of our proposed techniques.</p>
      </abstract>
      <kwd-group>
        <kwd>Quadratic fractional programming</kwd>
        <kwd>Quadratic programming</kwd>
        <kwd>Linear programming</kwd>
        <kwd>Projective interior point methods</kwd>
        <kwd>Algorithm DCA</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>
