An adaptive method to solve multi-level-multi objective linear programming problems

In this paper, a new approach is developed to solve multi-level multi-objective linear programming problems (ML-MOLPP). First, we dene a new concept that is the non-dominated feasible solution (compromise solutions) for ML-MOLPP. After that, a criterion of non-dominance of feasible solutions is given. Then, an algorithm is developed to generate a compromise solution. The constructive adaptive method, a well-executed method in linear programming, is then improved. The algorithm is presented and demonstrated in detail and followed by a numerical example.