Solving Linear Fractional Programming Problems Via Revised Simplex Method
DOI:
https://doi.org/10.23918/eajse.v10i3p6Keywords:
Fractional Programming Problem, Modified Simplex Method, Revised MethodAbstract
When using fractional programming, the numerator to denominator ratio serves as the goal function. Due to the challenges' application in finance and Business Scheduling, manufacturing scheduling., hospital and health care preparation, and other areas, there has been a great deal of study and interest in these kinds of issues. Under a set of linear constraints, linear fractional programming, or LFP, aims to maximise a quotient of two linear functions. Many methods for resolving linear fractional programming issues possessed been developed in the past few years. In this research, we defined the updated simplex technique, used it to resolve linear fractional programming issues, and proposed an algorithm for it. We also employed the modified method to solve LFP problems. To demonstrate the effectiveness of the approach, many numerical cases are resolved, shown, and the outcomes are compared. Results from the updated simplex approach were shown to be more rapid and efficient than those from the modified method.
References
[1] Pandian, P. and M. Jayalakshmi, On solving linear fractional programming problems. Modern Applied Science, 2013. 7(6): p. 90. http://dx.doi.org/10.5539/mas.v7n6p90
[2] Kumari, P., An Algorithm for solving Linear Fractional Programming Problems. https://bharataganitaparisad.com/wp-content/uploads/2022/11/721-ch10.pdf
[3] Sulaiman, A.N.S., A. D., Using mean and median to Solve Fractional multi-objective programming problem. Zanco, journal of pure and applied sciences/Salahaddin university. Hawler-Iraq, 2010: p. 1-10.
[4] Mustafa, R.B. and N.A. Sulaiman, A New Approach to Solving Linear Fractional Programming Problem with Rough Interval Coefficients in the Objective Function. Ibn AL-Haitham Journal For Pure and Applied Sciences, 2022. 35(2): p. 70-83. https://doi.org/10.30526/35.2.2809
[5] Mahmood, Z.M. and N.A. Sulaiman, A New Transformation Technique to Solve Multi-Objective Linear Programming Problems. Zanco Journal of Pure and Applied Sciences, 2022. 34(s6): p. 125-131. http://dx.doi.org/10.21271/ZJPAS.34.s6.15
[6] Nawkhass, M., On solving quadratic fractional programming problems. 2014, M. Sc. Thesis, Salahaddin university Erbil Iraq.
[7] Raina, A.A., et al., Solving linear fractional programming problem using revised and column simplex method, in Applications of Advanced Optimization Techniques in Industrial Engineering. 2022, CRC Press. p. 35-51. https://doi.org/10.1201/9781003089636
[8] Nawkhass, M.A. and N.A. Sulaiman, Modify Symmetric Fuzzy Approach to Solve the Multi-Objective Linear Fractional Programming Problem. International Journal of Fuzzy System Applications (IJFSA), 2022. 11(1): p. 1-17. https://doi.org/10.4018/IJFSA.312243
[9] Nawkhass, M.A. and H.Q. Birdawod, Transformed and solving multi-objective linear programming problems to single-objective by using correlation technique. Cihan International Journal of Social Science, 2017. 1(1): p. 30-36.
[10] Suleiman, N.A. and M.A. Nawkhass, A new modified simplex method to solve quadratic fractional programming problem and compared it to a traditional simplex method by using pseudoaffinity of quadratic fractional functions. Applied Mathematical Sciences, 2013. 7(76): p. 3749-3764. http://dx.doi.org/10.12988/ams.2013.36298
Downloads
Published
License
Copyright (c) 2025 Osman Omer, Nejmaddin Sulaiman
This work is licensed under a Creative Commons Attribution 4.0 International License.
Eurasian J. Sci. Eng is distributed under the terms of the Creative Commons Attribution License 4.0 (CC BY-4.0) https://creativecommons.org/licenses/by/4.0/
