Improved Pareto Set Based Method for Solving -Objective Linear Programming Problems

Section: Research Paper
Issue
Vol. 23 No. 1 (2026): Volume 23 Issue 1
Published
May 31, 2026
Pages
21-27

Abstract

A basic idea in mathematics, convex combinations are especially important in linear algebra, convex analysis, and optimization. They offer a method for creating new points from a given set while maintaining convexity, which is a crucial characteristic in many applied and mathematical domains. In this paper, we improved and generalized an idea for solving multi-objective function to find a compromise solution. The method focused on using convex combination of some points namely, positive efficient points which is a new definition. The results providing acceptable solutions for decision-makers. Comparing it with other methods, the method gives range of solutions as well as, can be used in the case of the individual optimal solutions are on distinct extreme points.

References

  1. Bhuiyan, J., & Mazumder, R. (2024). Application of linear programming in employee allocation: A case stud in emerging economy. International Journal of Science and Research Archive, 11(01), 253-259. https://ssrn.com/abstract=4696744
  2. Sharma, G., & Kumar, A. (2020). Solving a travelling salesman problem with heuristic model approach and comparing with AMPL Solution. Iraqi Journal of Statistical Sciences, 17 (2), 1-6. DOI:10.33899/iqjoss.2020.167384
  3. Ramadan, A. M. (2023). Ranking fuzzy numbers by geometric average method and its application to fuzzy inear fractional programming problems. Iraqi Journal of Statistical Sciences, 20 (1).
  4. Ahmed, M. & Nada, Y. (2013). Suggested genetic algorithm for solving linear fractional programming with application. Iraqi Journal of Statistical Sciences, 13 (30), 386-397. DOI: 10.33899/iqjoss.2013.081245
  5. Manal, K. Al-Abachi & Manaf, H. Ahmed. (2011). A proposed algorithm based on linear programming approach for three-stage three jobs flow shop scheduling with criteria: minimize makespan. Iraqi Journal of Statistical Sciences, 11 (2), 612 – 625. https://doi.org/10.33899/iqjoss.2011.27819
  6. Ahmed, M. Al-Sabawi & Ahmed I. Al-Mashhadani. (2011). Using linear programming method to estimate parameters of linear regression model by absolute deviation. Iraqi Journal of Statistical Sciences, 11 (1), 101-122. https://doi.org/10.33899/iqjoss.2011.28373
  7. Sen, C. (2018). Correlation technique for solving multi-objective programming (MOP) problems-An evaluation. International Journal of Mathematics Trends and Technology, 60 (3), 187-190, https://doi.org/10.14445/22315373/IJMTT-V60P529
  8. Sulaiman, N., & Sadiq, G. (2006). Solving the multi objective programming problem using mean and median value. AL-Rafidain Journal of Computer Sciences and Mathematics, 3 (1), 69-83. DOI:10.33899/csmj.2006.164037
  9. Sohag, Z. I., & Asadujjaman, M. (2018). A proposed new average method for solving multi-objective linear problem using various kinds of mean techniques. Math Lett., 4 (2), 25-33. DOI:10.11648/j.ml.20180402.11
  10. Tougma, A., & Somé, K. (2024). Solving multi-objective optimization problems with inequality constraint using an augmented Lagrangian function. Statistics, Optimization & Information Computing, 12 (5), 1364-1381. DOI:10.19139/soic-2310-5070-1875
  11. Ali, W., Sadia, S., Javaid, S., Abidi, N., Nabeel, M., Javaid, M. S., & Nusrat, A. (2025). Solving the multi-objective linear plus linear fractional programming problem using different mathematical programming approaches. Palestine Journal of Mathematics, 14 (1), 1015-1040
  12. Fentaw, G., & Akate, A. (2024). New mean and median techniques to solve multi-objective linear fractional programming problem and comparison with other techniques. Journal of Optimization, 2024 (1). https://doi.org/10.1155/2024/5000269
  13. Sulaiman, N. A., & Mustafa, R. B. (2016). Using harmonic mean to solve multi-objective linear programming problems. American journal of operations Research, 6 (1), 25-30. DOI:10.4236/ajor.2016.61004
  14. Sen, C. (1983). A new approach for multi-objective rural development planning.
  15. Mrakhan, M. B., Ramadan, A. M., & Mahmood, R. F. (2021). A novel technique for solving multi-objective linear programming problems. Mathematical Forum, 28 (2).
  16. Zimmermann, H. J. (1978). Fuzzy programming and linear programming with several objective functions. Fuzzy sets and Systems, 1(1), 45-55. DOI:10.1016/0165-0114(78)90031-3
  17. Hassan, D. A., Mehdavi-Amiri, N., & Ramadan, A. M. (2022). A heuristic approach to minimize three criteria using efficient solutions. Indones. J. Electr. Eng. Comput. Sci, 6 (1), 334-341. DOI:10.11591/ijeecs.v26.i1
  18. Kamal, M., Jalil, S. A., Muneeb, S. M., & Ali, I. (2018). A distance-based method for solving multi-objective optimization problems. Journal of Modern Applied Statistical Methods, 17 (1), 21. DOI:10.22237/jmasm/1532525455
  19. El-Shorbagy, M.A., Abd Elazeem A.M. (2024). Convex combination search algorithm: A novel metaheuristic optimization algorithm for solving global optimization and engineering design problems. Journal of Engineering Research,

Authors

Chiya A. Mohammed

Department of Mathematics, College of Science, Sulaimani University, KRG, Iraq.

Ayad M. Ramadan

Department of Mathematics, College of Science, Sulaimani University, KRG, Iraq.

Identifiers

https://doi.org/10.33899/iqjoss.v23i1.61499
Download this PDF file
PDF

Statistics

How to Cite

Mohammed, C. A. ., & Ramadan, A. M. . (2026). Improved Pareto Set Based Method for Solving -Objective Linear Programming Problems. IRAQI JOURNAL OF STATISTICAL SCIENCES, 23(1), 21–27. https://doi.org/10.33899/iqjoss.v23i1.61499