Analysis of Graphic Method, Sequential Linear Goal Programming, and Modified Simplex to Resolve Problems Goal Programming

Goal programming is a method used to deal with several problems in making adecision that involves more than one goal to be achieved. The goalprogramming problem as a form of development of linear programmingrequires an effective solution method. The goal programming problem isconverted into the premetive goal programming method and then solved byseveral methods, namely the graphical method, the sequential linear goalprogramming method, and the modified simplex method. These three methodsaim to find the optimal solution. In this case, an analysis is carried out on eachmethod and comparing which method is the most effective in solving the goalprogramming problem. The purpose of this research is to examine each methodto show the characteristics, advantages, and disadvantages of each method. Theresults show that when viewed from the workflow in each method and manyiterations, the graphical method is the simple method, the sequential linear goalprogramming method is the most complex method and the calculation time islong, while the modified simplex method is the most effective method