Note--An Efficient Goal Programming Algorithm Using Constraint Partitioning and Variable Elimination
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.
Year of publication: |
1978
|
---|---|
Authors: | Arthur, Jeffrey L. ; Ravindran, A. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 24.1978, 8, p. 867-868
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A branch and bound algorithm with constraint partitioning for integer goal programming problems
Arthur, Jeffrey L., (1980)
-
Spatial-endogenous fire risk and efficient fuel management and timber harvest
Konoshima, Masashi, (2008)
-
Modeling joint production of wildlife and timber
Nalle, Darek J., (2004)
- More ...