A revised simplex based method for solving multi-objective linear programming programs

There are two interesting Algorithm, in the literature, for solving multi-objective optimization problems. One is called the Bi-Objective Simplex and the other is Multi-Objective Simplex. We use the first algorithm in single objective optimization to the bi-objective case. In order to do so, the mathematical program must be linear and in standard form (slack/surplus variables may have to be added). We used the second algorithm for more than two Objective (p >۲). At the end, we used an example to better understand the subject.

کلیدواژه ها:

Linear programming ، multi-objective ، simplex methods ، algorithm