Sequential linear goal programming: Implementation via MPSX

Sequential linear goal programming: Implementation via MPSX

This paper presents the actual results obtained when a traditional linear programming computer code is used sequentially so as to solve the linear goal programming problem. The approach, denoted as Sequential Linear Goal Programming (SLGP), was implemented by incorporating the IBM linear programming...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research 1979, Vol.6 (3), p.141-145
Hauptverfasser: Ignizio, James P., Perlis, John H.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Codes
Computers
Linear programming
Objectives
Optimization
Sequence
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents the actual results obtained when a traditional linear programming computer code is used sequentially so as to solve the linear goal programming problem. The approach, denoted as Sequential Linear Goal Programming (SLGP), was implemented by incorporating the IBM linear programming code known as MPSX. The results obtained, the advantages and drawbacks, as well as a comparison with an alternate linear goal programming code, are also described.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/0305-0548(79)90026-1