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

Jeffrey L. Arthur and A. Ravindran
Additional contact information
Jeffrey L. Arthur: Oregon State University
A. Ravindran: Purdue University

Management Science, 1978, vol. 24, issue 8, 867-868

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.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.8.867 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:24:y:1978:i:8:p:867-868

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().