<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>DTESI</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>The general algorithm of linearization in linear fractional optimization problems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Serhii Chernov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liudmyla Chernova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liubava Chernova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serhii Titov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Admiral Makarov National University of Shipbuilding</institution>
          ,
          <addr-line>9, Heroiv Ukrainy Ave., 54025 Mykolaiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>9</volume>
      <fpage>16</fpage>
      <lpage>17</lpage>
      <abstract>
        <p>One of the most common examples of using the linear fractional optimization in project management is given by a problem of minimizing the expense per a unit of time or resource while maximizing the tasks completion quality. For example, in planning of a construction project, managers can use linear fractional models for optimizing the expense for construction materials and manpower with ensuring a high quality of works and good meeting of the schedule milestones at the same time.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;linear fractional optimization</kwd>
        <kwd>project</kwd>
        <kwd>resources</kwd>
        <kwd>risk management</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Statement of basic material</title>
      <p>especially in the project management where it is essential to find the optimum ratio between various
resources and results.</p>
      <p>One of the most common examples of using the linear fractional optimization in project
management is given by a problem of minimizing the expense per a unit of time or resource while
maximizing the tasks completion quality. For example, in planning of a construction project,
managers can use linear fractional models for optimizing the expense for construction materials and
manpower with ensuring a high quality of works and good meeting of the schedule milestones at the
same time.</p>
      <p>Another example is given by resources usage optimization. In large-scale projects, such as
construction of infrastructures or implementation of new technologies, it is required to efficiently
distribute the resources across multiple project stages. Using the linear fractional optimization, you
can minimize the expense per one unit of productivity or increase the productivity within a
constricted budget, which is essential for a successful project closeout.</p>
      <p>As it is difficult to solve linear fractional problems with the help of conventional optimization
methods, they are frequently linearized, i.e. converted into linear form. This is attained by
introducing new variables that allow reducing the fractional function to a linear one, after which
standard linear programing methods, such as simplex method, can be applied.</p>
      <p>The linear fractional optimization is also used in risk management. In the project management,
risks are often measured in the form of a ratio of a certain event probability vs its consequences.
Linear fractional optimization can help to minimize potential expenses with maximizing the
efficiency of risk management measures at the same time.</p>
      <p>The advantages of linear fractional optimization include the possibility of taking account of
complicated relationship between multiple project parameters, which enables obtaining more
accurate and well-balanced solutions. It also provides flexibility in decision taking, as the managers
can model various event development scenarios and select the most optimum way.</p>
      <p>However, it is worth mentioning that the linear fractional optimization is the most complicated
from the calculation point of view. It requires significant resources for solving and may require
special algorithms and software. This creates a certain challenge for its utilization in real projects,
especially in cases with a big number of variables and constraints.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Problem research</title>
      <p>Mathematic models of mixed project management optimization often use nonlinear functions like:
where
,
Similar nonlinear objective functions are used for mathematic models of economic specialization:
 The objective function of a model for optimizing the product manufacture expense
profitability:
- the quantity of product planned to manufacture,
- the profit from selling one unit of product</p>
      <p>,
- the prime cost of producing one unit of product .</p>
      <p> The objective function of a model for optimizing the product sales profitability:
- the quantity of product planned to sales,
- the profit from selling one unit of product</p>
      <p>,
- the price of one unit of product
</p>
      <p>The objective function of a model for optimizing the expense per one monetary unit of
product:
where
where
where</p>
      <p>,
,
- the quantity of product planned to sales,
- the prime cost of one product unit manufacture
,
- the price of one unit of product
</p>
      <p>The objective function of a model for optimizing the product manufacture prime cost:
where
- the quantity of product produced,
- the price of one unit of product .</p>
      <p>In view of this, it is important to linearize objective functions of models to reduce the mathematic
model to a linear optimization problem.</p>
      <p>Basis</p>
      <p>C
where the objective function is a linear fractional function and the system of constraints complies
with conditions of linearity, i.e. they are linear equations or inequalities.</p>
      <sec id="sec-3-1">
        <title>A general linear fractional optimization problem shall look like:</title>
        <p>
          We reduce linear fractional optimization problem (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) to solution of a linear optimization problem.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Let us designate</title>
      </sec>
      <sec id="sec-3-3">
        <title>Problem (1) turns to: , and introduce new variables: . (1)</title>
        <p>
          Additional problem (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) is a set of two problems. The first problem is a linear optimization problem.
Therefore, it is solved by simplex method and then we are to find a solution to the initial linear
fractional problem. The second problem is associated with designation
simplifying the problem solution in general.
        </p>
        <p>Model example No. 1.</p>
      </sec>
      <sec id="sec-3-4">
        <title>Let us find the solution of problem for We have a linear fractional optimization problem. In the system of constraints, we move from inequality constraints to equation constraints:</title>
      </sec>
      <sec id="sec-3-5">
        <title>Let us designate</title>
        <p>and introduce new variables:
, , …,</p>
      </sec>
      <sec id="sec-3-6">
        <title>The objective function of additional problem (2) turns to: , . .</title>
      </sec>
      <sec id="sec-3-7">
        <title>We shell multiply both the system of constraints equation members (4) by variables (5).</title>
      </sec>
      <sec id="sec-3-8">
        <title>Additional problem (2) turns to: and move to new (2) (3)</title>
        <p>
          (
          <xref ref-type="bibr" rid="ref4">4</xref>
          )
(
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
Wiz
Wiz
z 1
1
-5
1
2
0
1
3
-2
z 2
2
-1
2
3
0
5
2
5
B
-1
3
1
z 0
-4
-1
3
0
-7
8
3
3
a 4
a 5
a 3
D j
a 0
a 5
a 3
D j
a 0
a 5
a 1
D j
Basis
        </p>
        <p>
          C
(
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
        </p>
        <p>It is known that the beginning of solving a linear optimization problem with simplex method
requires obtaining the primary basis</p>
        <p>with necessary use of the Jordan-Gauss complete
elimination method (Table 1).</p>
      </sec>
      <sec id="sec-3-9">
        <title>We have . Table 2 provides a simplex calculation of additional problem (6).</title>
        <p>
          The optimum solution of additional problem (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) is equal to:
0
2
1
3
b
0
0
1
0
-1
3
1
1
,
,
, .
        </p>
        <p>For obtaining a solution to the minimization problem, it is worth mentioning that the current basis
of solving the maximization problem with simplex method (Table No. 2) is the solution to the
minimization problem as all estimates in the simplex table are nonpositive.</p>
      </sec>
      <sec id="sec-3-10">
        <title>We finally have: , ,</title>
        <p>Model example No. 2.</p>
      </sec>
      <sec id="sec-3-11">
        <title>We need to find the solution to problem</title>
        <p>,</p>
        <p>We have a linear fractional optimization problem. In the system of constraints, we move from
inequality constraints to equation constraints:</p>
      </sec>
      <sec id="sec-3-12">
        <title>We designate</title>
        <p>and introduce new variables:
, , …, ,</p>
      </sec>
      <sec id="sec-3-13">
        <title>In this case, the objective function of additional problem (2) turns to: , .</title>
      </sec>
      <sec id="sec-3-14">
        <title>We shall multiply both the system of constraints equation members (4) by variables (5).</title>
      </sec>
      <sec id="sec-3-15">
        <title>Additional problem (2) turns to: and move to new (7) (8)</title>
        <p>(9)</p>
        <p>It is known that the beginning of solution to a linear optimization problem with simplex method
requires obtaining the primary basis
elimination method (Table 3).</p>
        <p>with necessary use of the Jordan-Gauss complete</p>
      </sec>
      <sec id="sec-3-16">
        <title>We have . The optimum solution to additional problem (6) is equal to: then</title>
        <p>,
(10)
,</p>
        <p>
          ,
, ,
Table 4 provides a simplex calculation to additional minimization problem (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ).
,
        </p>
        <p>
          The optimum solution to additional minimization problem (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) is equal to:
then
,
,
,
,
,
,
        </p>
        <p>We have: , , , .</p>
        <p>In a two-dimensional case, a linear fractional optimization problem can be graphically solved with
graphic interpretation of the solution.</p>
        <p>A linear fractional problem of two variables optimization shall be formulated as follows: we need
to fine such a basis</p>
        <p>that provides the optimum value to objective function</p>
        <p>Let us consider the solution and the geometric interpretation of the problem solution with two
variables. Two cases are possible:</p>
      </sec>
      <sec id="sec-3-17">
        <title>Objective function of the problem is a homogeneous function like:</title>
      </sec>
      <sec id="sec-3-18">
        <title>Objective function of the problem is a nonhomogeneous function like:</title>
        <p>Let us first consider a case when the objective function of the problem is homogeneous (12). We
know that the solution to system of constraints
of problem (11) is a convex set constrained by
lines also called polyhedron. In general case,
is geometrically shown as a polygon (Fig. 1).
For geometric interpretation of conduct of objective function (12), solve this equation relative to
:
,</p>
      </sec>
      <sec id="sec-3-19">
        <title>We introduce designation and then we obtain the equation of line that passes across the coordinate’s origin .</title>
        <p>Providing various values to objective function
, we obtain a sheaf of lines with the center at
point of the coordinate’s origin. The sense of geometric solution of the two-dimensional linear
fractional optimization problem consists in finding such a line that corresponds to the optimum value
of
and belongs to polyhedron</p>
        <p>at the same time. This line that is commonly called tagline
(Fig. 2) will be a line touching the apex
the alternative minimum case (Fig. 3).</p>
        <p>or passing across the polyhedron side corresponding to
x</p>
        <p>2
O
,
,
x</p>
        <p>2</p>
        <p>O</p>
        <p>The coordinates of the apexes the tagline passes across are the very coordinates giving the
optimum problem attack plans.</p>
      </sec>
      <sec id="sec-3-20">
        <title>Depending on the two-dimensional system of constraints (Fig. 4) , the following cases are possible:</title>
        <sec id="sec-3-20-1">
          <title>Wompitn</title>
        </sec>
        <sec id="sec-3-20-2">
          <title>Xompitn</title>
          <p>
I</p>
        </sec>
        <sec id="sec-3-20-3">
          <title>Xompatx</title>
        </sec>
        <sec id="sec-3-20-4">
          <title>Wompatx</title>
          <p>x
1</p>
        </sec>
        <sec id="sec-3-20-5">
          <title>Wompatx</title>
        </sec>
        <sec id="sec-3-20-6">
          <title>Xompatx</title>
          <p>
I

I</p>
        </sec>
        <sec id="sec-3-20-7">
          <title>Wompitn</title>
        </sec>
        <sec id="sec-3-20-8">
          <title>Xompitn</title>
          <p>a)
c)</p>
        </sec>
        <sec id="sec-3-20-9">
          <title>Wompitn Xompitn</title>
          <p>x</p>
          <p>1
x
1
x
2</p>
          <p>I
d)</p>
          <p>is constrained, there are two alternative optimums obtained
at points of the two sides of polyhedron</p>
          <p>(Fig. 4a)
The admissible values area is not constrained, there are two angular apexes providing
the optimum values to the objective function (Fig. 4b)
The admissible values area is not constrained, there is only one angular apex providing
the optimum (the minimum) value to the objective function. The second optimum
(minimum) corresponds to a case of the asymptotic maximum (Fig. 4c)
 The admissible values area is not constrained. The optimums are asymptotic (Fig. 4d)
Let us consider some examples of a geometric solution to linear fractional optimization problems
in case of a homogeneous objective function.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>Linear fractional optimization is a powerful tool in project management, particularly when
optimizing complex relationships between cost, time, and quality. By employing this method, project
managers can achieve more balanced and practical solutions that ensure an efficient allocation of
resources while simultaneously minimizing risks. This approach is beneficial in scenarios where
traditional optimization techniques may need to fully address the multidimensional nature of project
constraints and trade-offs.</p>
      <p>One of the critical strengths of linear fractional optimization is its ability to handle conflicting
objectives, such as reducing expenses while maintaining high quality and meeting tight deadlines.
These trade-offs are common in project management, where stakeholders often have differing
priorities and limited resources. The method provides a structured way to identify the best possible
outcomes, making it easier to align the project goals with available resources and strategic objectives.</p>
      <p>Despite the inherent complexity of many projects, linear fractional optimization remains
adaptable and flexible. It offers a clear framework for decision-making in both simple and highly
intricate project environments, making it a versatile tool. Its adaptability to various industries, from
construction and engineering to information technology and healthcare, where optimizing
performance, cost efficiency, and quality assurance are critical, further underscores its adaptability
and potential impact.</p>
      <p>As project management continues to evolve with new technologies and methodologies, the
practicality and relevance of linear fractional optimization become more apparent. The potential for
further development and broader application of this technique grows, especially with advances in
computational tools, data analytics, and artificial intelligence. These advancements make linear
fractional optimization more accessible and capable of handling even more complex decision-making
processes, thereby improving project outcomes.</p>
    </sec>
    <sec id="sec-5">
      <title>Declaration on Generative AI</title>
      <p>
        The authors have not employed any Generative AI tools.
http://www.agrosvit.info/index.php?op=1&amp;z=3205&amp;i=14.
[7] S. Bushuyev, A. Ivko, “Construction of models and application of syncretic innovation project
management in the era of artificial intelligence”. Eastern-European Journal of Enterprise
Technologies, 2024, 3(3(129)), pp. 44–54.
[8] S. Bushuyev, A. Ivko, “Values Spiral Development Method in the Implementation of
Digitalization Projects in Syncretic Methodology”. International Journal of Computing, 2024,
23(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), pp. 177–186.
[9] W. Abd-Elhameed, A. Ali, “New Specific and General Linearization Formulas of Some Classes of
      </p>
      <p>
        Jacobi Polynomials.” Mathematics, Vol. 9(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ), 2021, pp.74. https://doi.org/10.3390/math9010074.
[10] R. Hahnloser, “Learning algorithms based on linearization Network”, Computation in Neural
      </p>
      <p>
        Systems, 9(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), 1998, pp. 363–380. https://doi.org/10.1088/0954-898X_9_3_006.
[11] Chernova L., Titov S., Chernov S., Kolesnikova K., Chernova L., Gogunskii V. Development of a
formal algorithm for the formulation of a dual linear optimization problem, 2019,
EasternEuropean Journal of Enterprise Technologies, 4 (
        <xref ref-type="bibr" rid="ref4 ref5 ref6">4-100</xref>
        ), pp. 28 - 36, DOI:
10.15587/17294061.2019.175105.
[12] L. Ghaoui, F. Oustry, M. AitRami, “A cone complementarity linearization algorithm for static
output-feedback and related problems”, IEEE Transactions on Automatic Control, vol. 42, no. 8,
1997, pp. 1171-1176, doi: 10.1109/9.618250.
[13] K. Kolesnikova, O. Mezentseva, T. Mukatayev, "Analysis of Bitcoin Transactions to Detect Illegal
Transactions Using Convolutional Neural Networks," 2021 IEEE International Conference on
Smart Information Systems and Technologies (SIST), Nur-Sultan, Kazakhstan, 2021, pp. 1-6, doi:
10.1109/SIST50301.2021.9465983.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>O.</given-names>
            <surname>Goyer</surname>
          </string-name>
          , “
          <article-title>Modern view of project management problems</article-title>
          . Actual problems of international relations”,
          <source>Issue</source>
          <volume>111</volume>
          (
          <issue>2</issue>
          ),
          <year>2012</year>
          , pр.
          <fpage>125</fpage>
          -
          <lpage>135</lpage>
          . URL: http://nbuv. gov.ua/UJRN/apmv_2012_
          <volume>111</volume>
          (
          <issue>2</issue>
          )__
          <fpage>17</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>O.</given-names>
            <surname>Oghirko</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Krap-Spisak, “Information technology of project management”. Bulletin of the Lviv Polytechnic National University</article-title>
          . Computer science and information technology,
          <source>No. 843</source>
          ,
          <year>2016</year>
          , P.
          <fpage>57</fpage>
          -
          <lpage>64</lpage>
          . URL: http://nbuv.gov.ua/UJRN/ VNULPKNIT_
          <year>2016</year>
          _
          <volume>843</volume>
          _
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Zelenska</surname>
          </string-name>
          , I. Golub, “
          <article-title>Peculiarities of the development of IT project management information systems using the methods of economic and mathematical modeling”</article-title>
          .
          <source>Investments: practice and experience, No. 4</source>
          ,
          <year>2014</year>
          , pр.
          <fpage>139</fpage>
          -
          <lpage>144</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Rodashchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kontseba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lischuk</surname>
          </string-name>
          , S. Skurtol, “
          <article-title>Network planning in IT project management”</article-title>
          .
          <source>Taurian Scientific Bulletin. Series: Technical Sciences, 1</source>
          ,
          <year>2023</year>
          . P.
          <volume>42</volume>
          -
          <fpage>56</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tripathi</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Kumar, “
          <article-title>Systematic literature review of software project management performance measurement”</article-title>
          .
          <source>Journal of Software Engineering Research and Development</source>
          ,
          <year>2019</year>
          . №
          <volume>7</volume>
          (
          <issue>1</issue>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>O.</given-names>
            <surname>Smetaniuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bondarchuk</surname>
          </string-name>
          . “
          <article-title>Peculiarities of the project management system in IT companies”</article-title>
          .
          <source>Agrosvit</source>
          ,
          <year>2020</year>
          . URL:
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>