ACM Home Page
Please provide us with feedback. Feedback
Algorithm 557: PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems [H]
Full text PdfPdf (46 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 ,  Issue 3  (September 1980) table of contents
Page: 429  
Year of Publication: 1980
ISSN:0098-3500
Authors
J. L. Arthur  Department of Statistics, Oregon State University, Corvallis, OR
A. Ravindran  School of Industrial Engineering, Purdue University, West Lafayette, IN
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 18,   Citation Count: 0
Additional Information:

appendices and supplements   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355900.355914
What is a DOI?

APPENDICES and SUPPLEMENTS
a partitioning algorithm for linear goal programming problems.
Gams: G2a1


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1

Collaborative Colleagues:
J. L. Arthur: colleagues
A. Ravindran: colleagues