ACM Home Page
Please provide us with feedback. Feedback
On generation of test problems for linear programming codes
Full text PdfPdf (328 KB)
Source
Communications of the ACM archive
Volume 17 ,  Issue 10  (October 1974) table of contents
Pages: 583 - 586  
Year of Publication: 1974
ISSN:0001-0782
Authors
A. Charnes  Univ. of Texas, Austin
W. M. Raike  The Naval Post Graduate School, Monterey
J. D. Stutz  Univ. of Texas, Austin
A. S. Walters  Carnegie-Mellon Univ., Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 41,   Citation Count: 2
Additional Information:

abstract   cited by   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/355620.361173
What is a DOI?

ABSTRACT

Users of linear programming computer codes have realized the necessity of evaluating the capacity, effectiveness, and accuracy of the solutions provided by such codes. Large scale linear programming codes at most installations are assumed to be generating correct solutions without ever having been “bench-marked” by test problems with known solutions. The reason for this failure to adequately test the codes is that rarely are there large problems with known solutions readily available. This paper presents a theoretical justification and an Illustrative implementation of a method for generating linear programming test problems with known solutions. The method permits the generation of test problems that are of arbitrary size and have a wide range of numerical characteristics.



Collaborative Colleagues:
A. Charnes: colleagues
W. M. Raike: colleagues
J. D. Stutz: colleagues
A. S. Walters: colleagues