A new procedure for the initial solution of goal programming

This study proposes a new procedure to find an initial solution to reduce the number of iterations of goal programming. The process of computing an initial solution is divided into two steps in this study. Decision variables which satisfy feasibility using Gaussian eliminations construct an initial solution reducing the iterations in the first step. It uses LHS as a tool that decision variables construct an initial solution. The initial solution which is constructed by the first step computes the updated coefficient of the objective function in the second step. If the solution does not satisfy the optimality, the optimal solution using the Modified Simplex Method is sought. The method does not reduce the overall computing time of goal programming problems, because more time is required for the process of constructing an initial solution. But the result of this study shows that the proposed procedure can effectively reduce the large number of iterations in the first step. [In Korean.]