Another modification from two papers of Ghodousian and Khorram and Khorram et al. (Q2479226)

The authors show that in some cases the tabular method algorithm of \textit{A. Ghodousian, E. Khorram} [Appl. Math. Comput. 180, No.~1, 411--418 (2006; Zbl 1102.90036)] and the first procedure of \textit{E. Khorram, A. Ghodousian} and \textit{A. A. Molai} [Appl. Math. Comput. 179, No.~2, 654--661 (2006; Zbl 1103.65067)] may not lead to the optimal solutions of the two models in solving a linear programming problem with the convex combination of the max-min and the max-average composition and the max-star composition. The proposed algorithm of \textit{A. A. Molai} and \textit{E. Khorram} [Appl. Math. Comput. 190, No.~2, 1161--1167 (2007; Zbl 1227.90049)] is generalized to solve the two models in a general case. Some numerical examples are illustrated.