Finding the best efficient solution for multi objective ‎programming problems based on the distance of objectives

  • Authors

    • Dr. Alia Youssef Gebreel Gebreel Operations Research
    https://doi.org/10.14419/8f54vr35

  • Abstract

    Multi-objective programming is one of the most famous branches of operations research. Several traditional and artificial methods have been ‎used to solve multi-objective problems in different fields. Most of these methods give a set of efficient solutions rather than an  optimal ‎solution because the objective functions are conflicting in nature. This leads to different individual solutions, or no one solution can be ‎available for all objective functions. Therefore, they must reconcile. In such a situation, the best way is needed to find a ‎feasible    solution that is optimal for all objectives. In other words, it is the best or preferred solution that is considered the closest to the ‎utopian point.

    Despite the variety of applied methods, there is not one universal method for solving multiobjective optimization problems. ‎Nevertheless, this paper introduces some new general mathematical models to find the best efficient solution for multi-objective programming problems. They depend on minimizing the distance of objectives from the utopian point for accurate as well as computationally fast ‎approaches. Of course, by doing so, the required solution is directly obtained. Additionally, some illustrative numerical linear and nonlinear ‎examples demonstrate the computational details. The results are compared with the existing solutions in other researches. ‎All results conclude that the proposed methods are very important for decision making and they can be used in a variety of problems having ‎multiple objectives in real life. One can say that these methods are very simple to give useful insights into practical problems. Finally, this ‎work strives to provide the best solution with stable steps, lowest time processing, flexibility, and applicability‎.

  • References

    1. Alia Youssef Gebreel (2021), “Solving the multi-objective convex programming problems to get the best compromise solution”, Australian Jour-nal of Basic and Applied Scientifics, DOI: 10.22587/ajbas.2021.15.5.3, Vol. 15, No. 5, pp. 17-29, and Research gate.
    2. Alia Youssef Gebreel (2022), “Artificial corona algorithm to solve multi-objective programming problems”, American Journal of Artificial Intelli-gence, https://doi.org/10.22541/au.166785474.41956469/v1.
    3. Abdullah Konaka, David W. Coitb, Alice E. Smithm (2006), “Multi-objective optimization using genetic algorithms: A tutorial”, Reliability Engi-neering and System Safety, 91, pp. 992–1007, www.elsevier.com/locate/ress. https://doi.org/10.1016/j.ress.2005.11.018.
    4. Carlos A. Coello Coello (2000), “An updated survey of GA-based multiobjective optimization techniques”, ACM Computing Surveys, Vol. 32, No. 2, pp. 109-143, June. https://doi.org/10.1145/358923.358929.
    5. Carlos A. Coello Coello, Gary B. Lamont and David A. Van Veldhuizen (2007), “Evolutionary algorithms for solving multi-objective problems”, Springer Science+ Business Media, LLC, Second Edition.
    6. Jorge Nocedal Stephen J. Wright (1999), “Numerical optimization”, Springer-Verlag New York, Inc. https://doi.org/10.1007/b98874.
    7. Josip Matejaš, Tunjo Peri´c, and Danijel Mlinari´c (2021), “Which efficient solution in multi objective programming problem should be taken?”, Central European Journal of Operations Research, 29, pp.967–987, https://doi.org/10.1007/s10100-020-00718-1.
    8. Kaisa M Miettinen (2004), “Nonlinear multiobjective optimization”, Kluwer Academic Publishers, Fourth Printing.
    9. Kalyanmoy Deb (2001), “Multi-objective optimization using evolutionary algorithms”, John Wiley & Sons, Ltd.
    10. Mohamed S. A. Osman, Waiel Fathi Abed El Wahed, Mahmoud Mostafa El-Sherbiny, and Alia Youssef Gebreel (2018), “Developing intelligent interactive approach for multi-objective optimization problems”, Ph.D. Degree in Operations Research, Institute of Statistical Studies and Re-search, Cairo University, Research gate.
    11. Murshid Kamal, Syed Aqib Jalil, Syed Mohd Muneeb, Irfan Ali (2018), “A distance based method for solving multi-objective optimization prob-lems”, Journal of applied modern statistical methods, https://doi.org/10.22237/jmasm/1532525455.
    12. Nyoman Gunantara1 (2018), “A review of multi-objective optimization: Methods and its applications”, Cogent Engineering, 5: 1502242, pp. 1-16, https://doi.org/10.1080/23311916.2018.1502242.
    13. Oscar Brito Augusto, Fouad Bennis and Stephane Caro (2012), “A new method for decision making in multi-objective optimization problems”, Brazilian Operations Research Society, Pesquisa Operacional Vol. 32, No. 2, pp. 331-369. https://doi.org/10.1590/S0101-74382012005000014.
    14. Petr FIALA (2011), “Multiobjective De Novo linear programming”, Mathematica, 50, 2, pp. 29–36.
    15. R.T. Marler and J.S. Arora (2004), “Survey of multi-objective optimization methods for engineering”, Struct Multidisc Optim, 26, pp. 369–395, https://doi.org/10.1007/s00158-003-0368-6.
    16. Rupesh Kumar Tiwari (2013), “Multi objective optimization of drilling process variables using genetic algorithm for precision drilling operation”, International Journal of Engineering Research and Development, Vol. 6, No. 12, PP. 43-59.
    17. Ahmad Abubaker, Adam Baharum and Mahmoud Alrefaei (2014), “Good solution for multi-objective optimization problem”, Proceedings of the 21st National Symposium on Mathematical Sciences (SKSM21), https://doi.org/10.1063/1.4887752.
    18. Majid Rafei, Samin Ebrahim Sorkhabi, Mohammad Reza Mosavi (2014), “Multi-objective optimization means of multi-dimensional MLP neural networks”, Neural Network World 1/14, https://doi.org/10.14311/NNW.2014.24.002.
    19. Alia Youssef Gebreel (2016), “On a compromise solution for solving multi- objective convex programming problems”, International Journal Sci-entific & Engineering Research (ISSN 2229- 5518), Vol. 7, No. 6, pp. 403- 409, and Research gate.
    20. Alia Youssef Gebreel (2023), “The best compromise solution for multi-objective programming problems”, Research gate, https:// www .researchgate.net /publication /378965713_ The_ Best_ Compromise _ Solution _for_Multi-objective_Programming_Problems. https://doi.org/10.47194/ijgor.v4i4.241.
    21. P. K De, Bharti Yadav (2011), “An algorithm for obtaining optimal compromise solution of a multi objective fuzzy linear programming problem”, International Journal of Computer Applications, (0975 – 8887), Vol. 17, No. 1, pp. 20-24. https://doi.org/10.5120/2185-2760
    22. Mustafa Sivri, Hale Gonce Kocken, Inci Albayrak, and Sema Akin (2019), “Generating a set of compromise solutions of a multi-objective linear programming problem through game theory”, Operations research decisions.

  • Downloads

  • How to Cite

    Gebreel, D. A. Y. G. (2025). Finding the best efficient solution for multi objective ‎programming problems based on the distance of objectives. International Journal of Advanced Mathematical Sciences, 11(1), 55-67. https://doi.org/10.14419/8f54vr35