The set of all the possible compromises of a multi-level multi-objective linear programming problem

Abstract

In this paper, a new approach is developed to solve multi-level multi-objective linear programming problems (ML-MOLPP), by providing the set of all the compromises without taking into account the hierarchy of the problem. A simple criterion is developed for testing whether a given feasible solution is a possible compromise or not. We describe a method used to generate the set of all the compromises, based on the P.L. Yu and M. Zeleny’s method. Theoretical results, numerical example and flow diagram are reported.

Keywords

• Multi-level multi-objective linear programming
• decision-makers
• non-dominated points
• non-dominated facets
• non-dominated extreme points