An Efficient Goal Programming Algorithm Using Constraint Partitioning and Variable Elimination

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Management science 1978-04, Vol.24 (8), p.867-868
Hauptverfasser: Arthur, Jeffrey L., Ravindran, A.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Decision analysis
Decision making
Decision making models
Decision theory
Goal programming
Goal setting
Linear programming
Management science
Objective functions
Objectives
Optimal solutions
Tableaux
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.24.8.867