In this paper, we obtain the solution to bi-level linear fractional programming problem (BLFP) by means of an optimization algorithm based on the duality gap of the lower level problem. In our algorithm, the bi-level ...
详细信息
In this paper, we obtain the solution to bi-level linear fractional programming problem (BLFP) by means of an optimization algorithm based on the duality gap of the lower level problem. In our algorithm, the bi-level linear fractional programming problem is transformed into an equivalent single levelprogramming problem by forcing the dual gap of the lower level problem to zero. Then, by obtaining all vertices of a polyhedron, the single levelprogramming problem can be converted into a series of linearfractionalprogramming problems. Finally, the performance of the proposed algorithm is tested on a set of examples taken from the literature. (C) 2012 Elsevier Ltd. All rights reserved.
In this research paper, we will solve problems of bi-level linear fractional programming (BL-LFP) by proposing an interactive approach. Based on the imposition of the relationship DM. to obtained adequate solution, DM...
详细信息
In this research paper, we will solve problems of bi-level linear fractional programming (BL-LFP) by proposing an interactive approach. Based on the imposition of the relationship DM. to obtained adequate solution, DMs will updating the minimal adequate level at upper level permanently, and that is through. Firstly, the decision makers uncertainty is described by introducing the membership function and non-membership function. Secondly, the opting of minimum adequate degree, leads to obtain the adequate solution, with the overall adequate balance considerations among two levels. For more, this paper gives an algorithm of the proposed approach. At the end, we give a numerical example to explain the feasibility of that approach.
暂无评论