Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Surveys in Operations Research and Management Science
Paper Title
Journal
Date
