Multi-level multi-objective integer linear programming problem

This paper concentrates on Multi-level Multi-objective Decision-Making (MMDM) problem with linear constraints. The objective functions at each level are to be maximized and are linear functions. Aconvergent algorithm based on Stackelberg strategy is employed to solve the(MMILP) problem which does not increase the complexities of the problem considered here. It solves the problem hierarchically for a given choice of the variables under the control of the upper level decision maker (DM) and each level having several objectives which are conflicting in nature is solved by the weighted method by assigning a positive weight vector to each objective function and transforms it into a parametric program. An illustrative numerical example is given to demonstrate the algorithm.