Abstract. This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1) Taylor's polynomial linearization approximation, (2) the method of variable change, and (3) a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a) using the optimal value of the objective functions as the decision makers' aspirations, and (b) the decision makers' aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.

This paper presents a new approach for solving decentralized bi-level multi-objective linear fractional programming problems. The main goal was to find a simple algorithm with high confidence of decision-makers in the results. First, all the linear fractional programming models on the given set of constraints were solved separately. Next, all the linear fractional objective functions were linearized, membership functions of objective functions and decision variables controlled by decision-makers at the highest level calculated, and a fuzzy multi-objective linear programming model formed and solved as linear goal programming problem by using simplex algorithm. The efficiency of the proposed algorithm was investigated using an economic example, and the obtained results compared with those obtained using an existing method.