作者: Ali Abbasi Molai , Esmaile Khorram
DOI: 10.1016/J.AMC.2007.07.061
关键词:
摘要: Abstract In this paper, we focus on the proposed algorithms to solve a linear programming problem with convex combination of max–min and max–average composition max–star composition, respectively. They have been by Ghodousian Khorram [A. Ghodousian, E. Khorram, Solving fuzzy relation equations, Appl. Math. Comput. 180 (2006) 411–418] et al. [E. A. Abbasi Molai, optimization problems equation constraints, 179 654–661], Firstly, show that “Tabular method algorithm” in first paper “First procedure” second may not lead optimal solutions two models some cases. Secondly, generalize algorithm Molai A modified for solving 190 (2007) 1161–1167] models. fact, it modifies presented papers. Finally, numerical examples are given illustrate purposes.