Two simple ways to find an efficient solution for a multiple objective linear programming problem

Vasile Căruțașu 1
  • 1 “Nicolae Bălcescu” Land Forces Academy,, Sibiu, Romania

Abstract

A number of methods and techniques for determining “effective” solutions for multiple objective linear programming problems (MPP) have been developed. In this study, we will present two simple methods for determining an efficient solution for a MPP that reducing the given problem to a one-objective linear programming problem. One of these methods falls under the category of methods of weighted metrics, and the other is an approach similar to the ε- constraint method. The solutions determined by the two methods are not only effective and are found on the Pareto frontier, but are also “the best” in terms of distance to the optimal solutions for all objective function from the MPP. Obviously, besides the optimal solutions of linear programming problems in which we take each objective function, we can also consider the ideal point and Nadir point, in order to take into account all the notions that have been introduced to provide a solution to this problem

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • Antonio, L. J., Saul, Z. M., & Carlos, A. C. C. (2009). An Introduction to Multiobjective Optimization Techniques. Mexico: Nova Science Publishers, Inc.

  • Dubois-Lacoste, J., Lopez-Ibanez, M., & Stutzle, T. (2013). Hybrid Metaheuristics. Combining Two Search Paradigms for Multi-objective Optimization: Two-Phase and Pareto Local Search. Berlin-Heidelberg: Springer-Verlag.

  • Ehrgott, M. (2005). Multicriteria Optimization (Second Edition). Berlin-Heidelberg: Springer International Publishing.

  • Emmerich, M., & Deutz, A. (2006). Multicriteria Optimization and Decision Making. Principles, Algorithms and Case Studies, LIACS Master Course, available at: (http://liacs.leidenuniv.nl/~emmerichmtm/modapage/MCOReaderEmmeirchDeutz2017.pdf )

  • Narzisi, G. (2008). Classic Methods for Multi-Objective Optimization. New York: New York University, Courant Institute of Mathematical Sciences.

  • Pardalos, P.M., Zilinskas, A., & Zilinskas, J. (2017). Non-Convex Multi-Objective Optimization, Series: Optimization and Its Applications - 123. Berlin-Heidelberg: Springer International Publishing.

  • Scap, D., Hoic, M., & Jokic, A. (2013). Determination of the Pareto Frontier for Multiobjective Optimization Problem. Transactions of Famena, No. 2, 15-28.

OPEN ACCESS

Journal + Issues

Search