Comparisons of Linear Goal Programming Algorithms

Abstract

Lack of an efficient algorithm capable of reaching a compromised solution within a reasonable time is a major setback in the use of goal programming. Orumie and Ebong newly developed an alternative method of solving goal programming problem utilizing modified simplex procedures. This algorithm is compared in terms of accuracy and time requirements with existing algorithms by Lee and by Ignizio. Computational times for 10 goal programming models of various sizes are presented. Number of iteration per problem, total entries per problems is used as benchmark for the comparisons. The new method by Orumie and Ebong (2011) have better  computational times in all the problem solution and proved the best since there is a reduction in computational time in all the problems solved.

Keywords: Goal Programming, Lee’s modified simplex, Ignizio’s Sequential, Orumie and Ebong method