Abstract
This paper studies a multi-level multi-objective decision-making (ML-MODM) problems with linear or non-linear constraints. The objective functions at each level are non-linear functions, which are to be maximized or minimized.
This paper presents a three-level multi-objective decision-making (TL-MODM) model and an interactive algorithm for solving such a model. The algorithm simplifies three-level multi-objective decision-making problems by transforming them into separate multi-objective decision making problems at each level, thereby avoiding the difficulty associated with non-convex mathematical programming. Our algorithm is an extension of the work of Shi and Xia [X. Shi, H. Xia, Interactive bi-level multi-objective decision making, Journal of the Operational Research Society 48 (1997) 943–949], which dealt with interactive bi-level multi-objective decision-making problems, with some modifications in assigning satisfactoriness to each objective function in all the levels of the TL-MODM problem. Also, we solve each separate multi-objective decision making problem of the TL-MODM problem by the balance space approach.
A new formula is introduced to interconnect the satisfactoriness and the proportions of deviation needed to reflect the relative importance of each objective function. Thus, we have the proportions of deviation including satisfactoriness.
In addition, we present new definitions for the satisfactoriness and the preferred solution in view of singular-level multi-objective decision making problems that corresponds to the
η-optimal solution of the balance space approach. Also, new definitions for the feasible solution and the preferred solution (
η-optimal point) of the TL-MODM problem are presented. An illustrative numerical example is given to demonstrate the algorithm.