An algorithm Is presented for solving the hnear goal programming problem It is shown how the ordmal priomty factors m the goal programmmg objective function can be used to partmon the goal constraints of the problem, allowing a sequence of smaller subproblems to be solved in order to fred a solution to the original problem. Also discussed is the additional efficiency of the algorithm achieved by the use of variable elnninatmn and special terminatmn rules. Prehminary computatmnal results demonstrate the efficiency of the new algorithm.
All Science Journal Classification (ASJC) codes
- Applied Mathematics