<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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</p></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

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

Scientific Bulletin

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

A number of methods and techniques for determining “effective” solutions for multiple objective linear programming problems (MPP) have been developed. In this...

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

Online veröffentlicht: 27. Juli 2018

Seitenbereich: 11 - 18

DOI: https://doi.org/10.2478/bsaft-2018-0002

Schlüsselwörter
Multiple objective linear programming problem (MPP), efficient solution, Pareto front, methods of weighted metrics, ε- constraint method

© 2018 Vasile Căruțașu, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

Online veröffentlicht: 27. Juli 2018

Seitenbereich: 11 - 18

DOI: https://doi.org/10.2478/bsaft-2018-0002

SchlüsselwörterMultiple objective linear programming problem (MPP), efficient solution, Pareto front, methods of weighted metrics, ε- constraint method

© 2018 Vasile Căruțașu, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
Multiple objective linear programming problem (MPP), efficient solution, Pareto front, methods of weighted metrics, ε- constraint method