Abstract
This paper compares and contrasts real world and random generated test problems as sources of standard tests for mathematical programming algorithms. Real problems are viewed as realizations from a test population of interest, and random problems are treated as models for the population. Methodological advantages and difficulties inherent in the alternatives are highlighted, and methods for dealing with the limitations discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dembo, R. S. and Mulvey, J. M., “On the Analysis and Comparison of Mathematical Programming Algorithms and Software,” report HBS 71–19. Graduate School of Business Administration, Harvard University, December 1976.
Garey, Michael R. and David S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
Lin, Benjamin W. and Ronald R. Rardin, “Development of a Parametric Generating Procedure for Integer Programming Test Problems,” Journal of the ACM, 24, 465–472, 1977.
Rardin, Ronald L. and Benjamin W. Lin, “Controlled Experimental Design for Statistical Comparison of Integer Programming Algorithms,” Management Science, 12, 1258–1271, 1980.
Rardin, Ronald L. and Benjamin W. Lin, “The RIP Random Integer Programming Test Problem Generator,” School of Industrial and Systems Engineering, Georgia Institute of Technology, June 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rardin, R.L., Lin, B.W. (1982). Test Problems for Computational Experiments -- Issues and Techniques. In: Mulvey, J.M. (eds) Evaluating Mathematical Programming Techniques. Lecture Notes in Economics and Mathematical Systems, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95406-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-95406-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11495-6
Online ISBN: 978-3-642-95406-1
eBook Packages: Springer Book Archive