Thumbnail
Access Restriction
Subscribed

Author Charnes, A. ♦ Raike, W. M. ♦ Walters, A. S. ♦ Stutz, J. D.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Lp program evaluation ♦ Linear programming ♦ Lp program validation ♦ Test problem generation
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.
Description Affiliation: Carnegie-Mellon Univ., Pittsburgh, PA (Walters, A. S.) || The Naval Post Graduate School, Monterey (Raike, W. M.) || Univ. of Texas, Austin (Charnes, A.; Stutz, J. D.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 10
Page Count 4
Starting Page 583
Ending Page 586


Open content in new tab

   Open content in new tab
Source: ACM Digital Library