Note—An Efficient Goal Programming Algorithm Using Constraint Partitioning and Variable Elimination

Publisher Website
Google Scholar
Abstract
An efficient algorithm for solving linear goal programming problems using partitioning and elimination procedures is presented. The algorithm takes advantage of the definition of ordinal preemptive factors in the objective function inherent in most goal programming formulations. Preliminary results indicate that the partitioning algorithm is superior to the existing methods for solving goal programming problems.

This publication has 0 references indexed in Scilit: