Skip to main content
SpringerLink
Log in

In Pursuit of a Methodology for Testing Mathematical Programming Software

  • Conference paper
Evaluating Mathematical Programming Techniques

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 199))

Abstract

To resolve the often conflicting and confusing results of computational testing of mathematical software reported in the literature, the Committee on Algorithms of the Mathematical Programming Society has developed guidelines which present minimum standards to which all papers reporting such efforts should conform. Although guidelines now exist, the development of sound methodologies for this testing is at the embryonic stage. This paper surveys the results to date of computational test efforts in each of the major fields of mathematical programming and reviews to what extent these efforts have advanced the goal of developing methodologies for testing MP software. Directions for future research are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Abadie and J. Guigou, “Numerical Experiments with the GRG Method,” in F. Lootsma, Numerical Methods for Nonlinear Optimization Academic Press, New York (1972), pp. 529–536.

    Google Scholar 

  2. E. Balas and E. Zemel, “Al Algorithm for Large Zero-One Knapsack Problems,” Operations Research, Vol. 28, No. 5, pp. 1130–1154.

    Google Scholar 

  3. R. Braitsch, “A Computer Comparison of Four Quadratic Programming Algorithms,” Management Science, Vol. 15, No. 11 (1972), pp. 631–643.

    Google Scholar 

  4. T. E. Bell, “Computer Performance Variability,” Computer Performance Evaluation, National Bureau of Standards Special Publication 406 (August 1975).

    Google Scholar 

  5. M. Bourgoin and E. Heurgon, “Study and Comparison of Algorithms of the Shortest Path Through Planned Experiments,” Project Planning by Network Analysis North-Holland, Amsterdam, Netherlands (1969), pp. 106–118.

    Google Scholar 

  6. E. Brocklehurst and K. Dennis, “A Comparison of Six Algorithms for Dense Linear Programs,” NPL Report NAC51, National Physical Laboratory, Teddington, Middlesex, England (June 1974).

    Google Scholar 

  7. A. Buckley, “Testing Minimization Codes,” COAL Newsletter #5 (February 1981), pp. 49–52.

    Google Scholar 

  8. J. C. P. Bus, “Performance Measures for Evaluating Mathematical Programming Software,” COAL Newsletter (January 1980), p. 8.

    Google Scholar 

  9. J. C. P. Bus, “A Proposal for the Classification and Documentation of Test Problems in the Field of Nonlinear Programming,” Design and Implementation of Optimization Software (ed. H. Greenberg), Nato Advance Study Institute Series, Series E-Applied Science, No. 28, pp. 507–518.

    Google Scholar 

  10. J. C. P. Bus, “Numerical Solution of Systems of Nonlinear Equations,” Doctoral Thesis presented to the faculty of the University of Amsterdam Mathematics Center, Amsterdam (April 1980).

    Google Scholar 

  11. R. E. Chang, “An Evaluation and Comparison of Curve Fitting Software,” SAND80–8727, Sandia National Laboratories, Albuquerque, New Mexico (1981).

    Google Scholar 

  12. H. Chernoff, “The Use of Faces to Represent Points in k-Dimensional Space Graphically,” Journal American Statistical Association Vol. 68 (1973), pp. 361–368.

    Article  Google Scholar 

  13. A. Colville, “A Comparative Study of Nonlinear Programming Codes,” IBM Scientific Center Report No. 320–2949 (June 1968), pp. 487500.

    Google Scholar 

  14. L. W. Cornwall, P. A. Hutchinson, M. Minkoff, and H. K. Schultz, “Test Problems for Constrained Nonlinear Mathematical Programming Algorithms,” TM 320, Argonne National Laboratories, Applied Mathematics Division (1978).

    Google Scholar 

  15. H. Crowder, R. S. Dembo, and J. M. Mulvey, “On Reporting Computational Experiments with Mathematical Software,” ACM TOMS Vol. 5 (1979), pp. 193–203.

    Article  Google Scholar 

  16. H. P. Crowder and M. W. Padberg, “Large Scale Symmetric Travelling Salesman Problems,” Management Science, Vol. 26, No. 5, pp. 495–509.

    Google Scholar 

  17. H. P. Crowder and P. B. Saunders, “Results of a Survey on MP Performance Indicators,” COAL Newsletter (January 1980), pp. 2–6.

    Google Scholar 

  18. H. J. Curnow, and B. A. Wichmann, “A Synthetic Benchmark,” The Computer Journal, Vol. 19, No. 1 (February 1976) pp. 43–46.

    Article  Google Scholar 

  19. R. S. Dembo, “Random Generation of Problems with a Given Structure,” COAL Newsletter (January 1980), pp. 25–26.

    Google Scholar 

  20. R. S. Dembo, “The Current State-of-the-Art of Algorithms and Computer Software for Geometric Programming,” Working Paper 88, School of Organization and Management, Yale University, New Haven, CT (1976).

    Google Scholar 

  21. R. S. Dembo, “A Set of Geometric Programming Test Problems and Their Solutions,” Mathematical Programming Vol. 10 (1976), pp. 192–214.

    Article  Google Scholar 

  22. R. S. Dembo and H. Avriel, “Optimal Design of a Membrane Separation Process Using Signomial Programming,” Mathematical Programming Vol. 15 (1978), pp. 12–25.

    Article  Google Scholar 

  23. R. S. Dembo and J. M. Mulvey, “On the Analysis and Comparison of Mathematical Programming Algorithms and Software,” in W. White, Computers and Mathematical Programming Natl. Bur. Stds. Special Publications 502 (February 1978).

    Google Scholar 

  24. R. Dial, F. Glover, D. Karney, and D. Klingman, “A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees,” Networks Vol. 9 (1979), pp. 215–248.

    Article  Google Scholar 

  25. P. Domich, J. Lawrence, and D. Shier, “Generators for Discrete Polynomial L1 Approximation Problems,” J. of Res. of the National Bureau of Standards Vol. 84, No. 6 (1979), pp. 485–487.

    Google Scholar 

  26. J. Dorrenbacher, et al., “POLISH–A FORTRAN Program to Edit FORTRAN Programs,” Dept. of Comp. Sci., University of Colorado, Tech. Report #CU–05–050–76 (Rev.)(May 1976).

    Google Scholar 

  27. J. S. Dyer, “Interactive Goal Programming,” Management Science Vol. 19 (1972), pp. 62–70.

    Article  Google Scholar 

  28. E. D. Eason, “Evidence of Fundamental Difficulties in Nonlinear Optimization Code Comparisons,” to appear in the Proceedings of the Conference on Testing and Validating of Algorithms and Software, held in Boulder, CO (January 1981).

    Google Scholar 

  29. E. D. Eason and R. G. Fenton, “A Comparison of Numerical Optimization Methods for Engineering Design,” J. of Engineering for Industry ASME, Vol. 96, No. 1 (1974), pp. 196–200.

    Article  Google Scholar 

  30. E. D. Eason, “Validity of Colville’s Time Standardization for Comparing Optimization Codes,” ASME Paper No. 77-DET-116 (September 1977).

    Google Scholar 

  31. J. J. Elam and D. Klingman, “Netgen II: A System for Generating Structured Network-based Mathematical Programming Test Problems,” to appear in The Proceedings of the Conference on Testing and Validating Algorithms and Software, held in Boulder, CO (January 1981).

    Google Scholar 

  32. M. Enquist, “A Successive Shortest Path Algorithm for the Assignment Problem,” Research Report CCS 375, Center for Cybernetic Studies, The University of Texas, Austin, TX 78712.

    Google Scholar 

  33. J. E. Fattier, Y. T. Sin, R. R. Root, K. M. Ragsdell, and G. V. Reklaitis, “On the Computational Utility of Posynomial Geometric Programming Solution Methods,” to appear in Mathematical Programming (1981).

    Google Scholar 

  34. D. Fayard and G. Plateau, “Resolution of the Zero-One Knapsack Problem: Comparison of Methods,” Mathematical Programming Vol. 8 (1975), pp. 272–307.

    Article  Google Scholar 

  35. J. Feiber, R. N. Taylor, and L. J. Osterweil, “NEWTON-A Dynamic Testing System for Fortran 77 Programs; Preliminary Report,” University of Colorado, Dept. of Comp. Sci., Tech. Note (November 1980).

    Google Scholar 

  36. J. M. Fleisher; “Constructure of Plant Location Test Problems with Known Optimal Solutions,” Computer Sciences Technical Report #263, University of Wisconsin, Madison, WI (December 1975).

    Google Scholar 

  37. J. M. Fleisher, “Construction of Generalized Capital Budgeting Test Problems with Known Optimal Solutions,” Computer Sciences Technical Report #260, University of Wisconsin, Madison, WI (August 1975).

    Google Scholar 

  38. J. M. Fleisher and R. R. Meyer, “New Sufficient Optimality Condition for Integer Programming and Their Application,” Communications of the ACM Vol. 21, No. 5 (1978), pp. 412–418.

    Article  Google Scholar 

  39. L. D. Fosdick, (ed.) 1979, Performance and Evaluation of Numerical Software North-Holland Press.

    Google Scholar 

  40. J. Gilsinn, K. Hoffman, R. H. F. Jackson, E. Leyendecker, P. Saunders, and D. Shier, “Methodology and Analysis for Comparison Discrete Linear Li Approximation Codes,” Communications in Statistics, Simulation, aid Computations Vol. B6, No. 4 (1977), pp. 399–413.

    Article  Google Scholar 

  41. J. Gilsinn and C. Witzgall, “A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees,” Technical Note 772 (May 1973) Natl. Bur. of Stds., Washington, D.C.

    Google Scholar 

  42. F. Glover, J. Hultz, and D. Klingman, “Improved Computer-Based Planning Techniques, Part 1,” Interfaces Vol. 8, No. 4 (August 1976), p. 16.

    Article  Google Scholar 

  43. F. Glover, D. Karney, D. Klingman, and A. Napier, “A Comparison of Computation Times for Various Starting Procedures, Basis Solution Criteria, and Solution Algorithms for Distribution Problems,” Research Report CS#4, Center for Cybernetic Studies, Graduate School of Business, University of Texas (May 1971).

    Google Scholar 

  44. F. Glover, D. Karney, D. Klingman, and A. Napier, “A Comparison Study of Start Procedures, Basis Charge Criteria, and Solution Algorithms for Transportation Problems,” Research Report CS#93, Center for Cybernetic Studies, Graduate School of Business, University of Texas (September 1972).

    Google Scholar 

  45. F. Glover, D. Klingman, J. Mote, and D. Whitman, “Comprehensive Computer Evaluation and Enhancement of Max Flow Algorithms,” Research Report CC5356, Center for Cybernetic Studies, Graduate School of Business, University of Texas (1979).

    Google Scholar 

  46. B. Golden, “Shortest Path Algorithms: A Comparison,” Operations Research, Vol. 24, No. 6 (Nov.-Dec. 1976), pp. 1164–1168.

    Article  Google Scholar 

  47. J. S. Graves, “An Improved Branch and Bound Algorithm for Integer Programs with Set Partitioning Constants,” Ph.D. Thesis presented to the faculty of Carnegie Mellon University, Pittsburgh, PA (1976).

    Google Scholar 

  48. J. S. Graves, “An Approach to Design of Experiments for Computational Testing of Math Programming Algorithms,” to appear in the Proceedings of the Conference on Testing 888 Validating Algorithms and Software, held in Boulder, CO. (January 1981).

    Google Scholar 

  49. P. Gray, “Exact Solution of the Fixed Charge Transportation Problem,” Operations Research Vol. 19, No. 6 (1971), pp. 1529–1537.

    Article  Google Scholar 

  50. J. Haldi, “25 Integer Programming Problems,” Working Paper No. 43, Graduate School of Business, Stanford University (1964).

    Google Scholar 

  51. K. L. Hiebert, “An Evaluation of Mathematical Software Which Solves Nonlinear Least Squares Problems,” Sandia Report, SAND80–0479 (1980), Sandia National Laboratories.

    Google Scholar 

  52. K. L. Hiebert, “A Comparison of Nonlinear Least Squares Software,” Sandia Technical Report, SAND79–0483 (1979), Sandia National Laboratories.

    Google Scholar 

  53. K. Hillstrom, “A Simulation Test Approach to the Evaluation and Comparison of Unconstrained Nonlinear Optimization Algorithms,” Argonne National Laboratory Report No. ANL-76–20 (February 1976).

    Google Scholar 

  54. D. M. Himmelblau, Applied Nonlinear Programming McGraw-Hill, New York (1972).

    Google Scholar 

  55. J. K. Ho and B. Loute, “A Set of Staircase Linear Programming Problems,” Applied Mathematics Dept., Brookhaven National Laboratory Upton, New York, 11973 (1979).

    Google Scholar 

  56. W. Hock and K. Schittkowski, “Test Examples for the Solution of Nonlinear Programming Problems, Part 1,” Preprint No. 44, Institut fur Angewandte Mathematik and Statistik, Universitat Wurzburg, W. Germany (1979).

    Google Scholar 

  57. W. Hock and K. Schittkowski, “Test Examples for the Solution of Nonlinear Programming Problems, Part 2,” Preprint No. 45, Institut fur Angewandte Mathematik and Statistik, Universitat Wurzburg, W. Germany (1979).

    Google Scholar 

  58. A. Hoffman, M. Mannos, D. Sokolowsky, and N. Wiegmann, “Computational Experience in Solving Linear Programs,” J. SIAM Vol. 1 (1953), pp. 17–33.

    Google Scholar 

  59. K. L. Hoffman and D. R. Shier, “A Test Problem Generator for Discrete Linear L1 Approximation Problems,” ACM TOMS Vol. 6, No. 4 (1980), pp. 587–593.

    Article  Google Scholar 

  60. R. H. F. Jackson, “Measures of Similarities for Comparing Test Problems,” presented at the 10th International Conference on Mathematical Programming, Montreal, Canada (1979).

    Google Scholar 

  61. R. H. F. Jackson and J. M. Mulvey, “A Critical Review of Comparisons of Mathematical Programming Algorithms and Software (19531977)” J. Research of the National Bureau of Standards, Vol. 83, No. 6 (November 1978).

    Google Scholar 

  62. D. Karney and D. Klingman, “Implementation and Computational Study of In-Core, Out-of-Core Primal Network Code,” JORSA, Vol. 24, No. 6 (November-December 1976), pp. 1056–1077.

    Google Scholar 

  63. R. Keeney and H. Raiffa, Decision Making with Multiple Objectives: Value and Preference Tradeoffs John Wiley and Sons (1976).

    Google Scholar 

  64. D. Klingman, A. Napier, and G. Ross, “A Computational Study of the Effects of Problem Dimensions and Solution Times for Transportation Problems,” Research Report #CS135, Center for Cybernetic Studies, Graduate School of Business, University of Texas (October 1973).

    Google Scholar 

  65. D. Klingman, A. Napier, and J. Stutz, “NETGEN: A Program for Generalizing Large-Scale Assignment, Transportation, and Minimum Cost-Flow Network Problems,” Management Science Vol. 20 (1974), pp. 814–821.

    Article  Google Scholar 

  66. J. S. H. Kornbluth, “A Survey of Goal Programming,” Omega Vol. 1 (1976), pp. 193–205.

    Article  Google Scholar 

  67. L. Lasdon and D. Waren, “Survey of Nonlinear Programming Applications,” Operations Research Vol. 28, No. 5 (September 1980), pp. 1029–1074.

    Article  Google Scholar 

  68. C. Lemarechal and R. Mifflin, Nonsmooth Optimization Pergamon Press, New York, 1978.

    Google Scholar 

  69. G. Lidor, “Construction of Nonlinear Programming Test Problems with Known Solution Characteristics,” to appear in the Proceedings of the Conference on Testing and Validating Algorithms and Software, Boulder, CO (1981).

    Google Scholar 

  70. B. W. Lin and R. L. Rardin, “The RIP Random Integer Programming Test Problem Generator,” Georgia Institute of Technology, Atlanta, Ga. (June 1980).

    Google Scholar 

  71. B. W. Lin and R. L. Rardin, “Controlled Experimental Design for Statistical Comparison of Integer Programming Algorithms,” Mgt. Science Vol. 25, No. 12 (1979), pp. 1258–1271.

    Article  Google Scholar 

  72. F. L. Lootsma, “Performance Evaluation of Nonlinear Programming Codes from the Viewpoint of a Decision Maker,” in L. D. Fosdick (ed.) Performance Evaluation of Numerical Software North Holland, Amsterdam (1979), pp. 285–297.

    Google Scholar 

  73. J. N. Lyness and C. Greenwell, “A Pilot Scheme for Minimization Software Evaluation,” Argonne Natl. Lab., Tech. Report II, TM-323 (1977).

    Google Scholar 

  74. J. N. Lyness, “Performance Profiles and Software Evaluation,” in Fosdick, L. D. (ed.), Performance and Evaluation of Numerical Software North-Holland Press (1979).

    Google Scholar 

  75. G. Lyon and R. B. Stillman, “A FORTRAN Analysis,” NBS Technical Note 849 (1974), National Bureau of Standards, Washington, D.C. 20234.

    Google Scholar 

  76. J. May and R. Smith, “The Definition and Generation of Geometrically Random Linear Constraint Sets,” Tech. Report No. 80–6, Dept. of Industrial and Operations Engineering, College of Engineering, University of Michigan, Ann Arbor, MI (October 1980).

    Google Scholar 

  77. W. M. Michaels and R. P. O’Neill, “A Mathematical Programming Generator: MPGENR,” ACM Transactions of Mathematical Software Vol. 6 (1980), pp. 31–40.

    Article  Google Scholar 

  78. P. F. McCoy and J. A. Tomlin, “Some Experiments on the Accuracy of Three Methods of Updating the Inverse in the Simplex Method,” Technical Report No. SOL 72–2, Stanford University, Stanford, California (December 1974).

    Google Scholar 

  79. A Miele and S. Gonzalez, “On the Comparative Evaluation of Algorithms for Mathematical Programming Problems,” Nonlinear Programming 3, Ed., O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Academic Press, New York (1978), pp. 337–359.

    Google Scholar 

  80. J. H. Moore and A. B. Whinston, “Experimental Methods in Quadratic Programming,” Management Science Vol. 13, No. 1 (September 1966).

    Google Scholar 

  81. J. J. More, “Implementation and Testing of Optimization Software,” in Fosdick, L. D. (ed.) Performance Evaluation and Testing of Numerical Software (1979) North-Holland Press.

    Google Scholar 

  82. J. A. Nelder, “Experimental Design and Statistical Evaluation,” in Fosdick, L. D. (ed.) Performance and Evaluation of Numerical Software North-Holland Press (1979).

    Google Scholar 

  83. R. P. O’Neill, “A Comparison of Real-World Linear Programs and Their Randomly-Generated Analogs,” to appear in the Proceedings of the Conference on Testing and Validating Algorithms and Software, sponsored by the Committee on Algorithms of the Mathematical Programming Society, Boulder, CO (January 1981).

    Google Scholar 

  84. L. J. Osterweil, “TOOLPACK An Integrated System of Tools for Mathematical Software Development,” to appear in the Proceedings of the Conference on Testing and Validating Algorithms and Software, held in Boulder, CO (January 1981).

    Google Scholar 

  85. L. J. Osterweil and L. D. Fosdick, “DAVE-A Validation, Error, Detection, and Documentation System for FORTRAN Programs” Software Practice 888 Experience, Vol. 6 (September 1976), pp. 473–506.

    Article  Google Scholar 

  86. A. M. Ostrowski, Solution of Equations and Systems of Equations Academic Press, New York (1960).

    Google Scholar 

  87. U. Pape, “Implementation and Efficiency of Moore-Algorithms for the Shortest Route Problem,” Mathematical Programming, Vol. 7 (1974), pp. 212–222.

    Article  Google Scholar 

  88. B. N. Parlett and Y. Wong, “The Influence of the Compiler on the Cost of Mathematical Software,” ACM TOMS Vol. 1 (1975), pp. 3536

    Article  Google Scholar 

  89. V. Pereyra and R. D. Russell, “Difficulties of Comparing Complex Mathematical Software: General Comments and the BVODE Case,” Simon Fraser University, Dept. of Mathematics, Burnaby B. C., Canada.

    Google Scholar 

  90. C. C. Peterson, “Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R888D Projects,” Imagement Science Vol. 13 (1967), pp. 736–750.

    Google Scholar 

  91. W. J. Riley and R. L. Sielken, “Which Options Provide the Quickest Solution?” to appear in the Proceedings of the Conference on Testing 888 Validating Algorithms 888 Software, held in Boulder, CO (1981).

    Google Scholar 

  92. J. B. Rosen, “Global Minimization of a Linearly Constrained Concave Function by Partition of the Feasible Region,” (Appendix B), Technical Report 81–11, Computer Science Dept., University of Minnesota, Minneapolis, MN 55455 (1981).

    Google Scholar 

  93. M. J. Rijckaert, “Computational Aspects of Geometric Programming,” in Design and Implementation of Optimization Software, ed. H. J. Greenberg, NATO Advanced Study Institute Series, Series E: Applied Science, No. 28, pp. 481–506.

    Google Scholar 

  94. M. J. Rijckaert and X. M. Martens, “Comparison of Generalized Geometric Programming Algorithms,” JOTA Vol. 26, No. 2 (October 1978).

    Google Scholar 

  95. B. G. Ryder, “The FORTRAN Verifier: User’s Guide,” Bell Laboratories, Computing Science Technical Report #12 (May 1973).

    Google Scholar 

  96. T. L. Saaty, “A Scaling Method for Priorities in Hierarchical Structures,” J. Math. Psych. Vol. 15 (1977), pp. 234–281.

    Article  Google Scholar 

  97. E. Sandgren, “The Utility of Nonlinear Programming Algorithms,” Ph.D. Dissertation, Purdue University, Lafayette, Indiana (December 1977).

    Google Scholar 

  98. E. Sandgren, “A Statistical Review of the Sandgren-Ragsdell Comparison Study,” to appear in the Proceedings of the Conference on Testing 888 Validating Algorithms 888 Software, held in Boulder, CO (1981).

    Google Scholar 

  99. E. Sandgren and K. M. Ragsdell, “The Utility of Nonlinear Programming Algorithms: A Comparative Study-Parts 1 888 2,” ASME Journal of Mechanical Design Vol. 102, No. 3 (July 1980), pp. 540–551.

    Article  Google Scholar 

  100. K. Schittkowski, (1978) “A Numerical Comparison of Optimization Software Using Randomly Generated Test Problems,” Rechenzentrum Preprint No. 43, University of Wurgburg, West Germany.

    Google Scholar 

  101. F. Schlick and L. Nazareth, “A Performance Profile Study of Three Unconstrained Optimization Routines,” in W. White, Computers and Mathematical Programming National Bureau of Standards, Special Publication 502 (February 1978).

    Google Scholar 

  102. D. Shanno and K. Phua, “Effective Comparison of Unconstrained Optimization Techniques,” Management Science Vol. 22, No. 3 (November 1975), pp. 321–330.

    Article  Google Scholar 

  103. D. R. Shier, “A Computational Study of Floyd’s Algorithm,” to appear in Computers and Operations Research 1981.

    Google Scholar 

  104. D. R. Shier, S. J. Neupauer, P. B. Saunders, “A Collection of Test Problems for Discrete Linear L1 Data Fitting,” Natl. Bur. Stds. Tech. Report NBSIR 79–1920, Washington, D.C. (July 1979).

    Google Scholar 

  105. R. L. Staha, “Constrained Optimization Via Moving Exterior Truncations,” Ph.D. Thesis, University of Texas, Austin, Texas (1973).

    Google Scholar 

  106. W. R. Stewart, “A Computational Comparison of Five Heuristic Algorithms for the Euclidean Traveling Salesman Problem,” to appear in the Proceedings of the Conference on Testing 888 Validating Algorithms 888 Software, held in Boulder, CO (1981).

    Google Scholar 

  107. U. Suhl, “Implementation of an Algorithm: Performance Considerations and a Case Study,” to appear in the Proceedings of the Conference on Testing 888 Validating Algorithms 888 Software, sponsored by the Committee on Algorithms of the Mathematical Programming Society, Boulder, CO (January 1981).

    Google Scholar 

  108. C. A. Trauth and R. E. Woolsey, “Integer Linear Programming: A Study in Computational Efficiency,” Management Science Vol. 15, No. 11 (1969), pp. 481–493.

    Article  Google Scholar 

  109. W. B. Van Dam and J. Telgen, “Randomly Generated Polytopes for Testing Mathematical Programming Algorithms,” Report 7929/0, Erasmus University, P.O. Box 1738, Rotterdam, The Netherlands.

    Google Scholar 

  110. G. Van der Hoek and M. W. Dijkshoorn, A Numerical Comparison of Self-Scaling Variable Metric Algorithms,“ Report 7910/0, Erasmus University, P.O. Box 1738, Rotterdam, The Netherlands.

    Google Scholar 

  111. P. N. Wahi and G. H. Bradley, “Integer Programming Test Problems,” Report #28, Administrative Sciences, Yale University, New Haven, Connecticut (1969).

    Google Scholar 

  112. A. D. Waren and L. S. Lasdon, “The Status of Nonlinear Programming Software,” Operations Research Vol. 27, No. 3 (1979), pp. 431–456.

    Article  Google Scholar 

  113. K. L. Weldon, “One-to-One Graphical Strategies in Multiwarrate Data Analysis,” Manuscript (1981).

    Google Scholar 

  114. P. Wolfe and L. Cutler, “Experiments in Linear Programming,” in R. Graves and P. Wolfe (eds.), Recent Advances in Mathematical Programming McGraw-Hill, New York (1963), pp. 177–200.

    Google Scholar 

  115. S. Zionts and J. Wallenius, “An Interactive Programming Method for Solving Multiple Criteria Problem,” Management Science Vol. 22 (1976), pp. 652–663.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Bureau of Standards, Center for Applied Mathematics, Washington, D. C., 20234, USA

    K. L. Hoffman & R. H. F. Jackson

Authors
  1. K. L. Hoffman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. H. F. Jackson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering/Applied Science, Princeton University, 08544, Princeton, NJ, USA

    John M. Mulvey

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hoffman, K.L., Jackson, R.H.F. (1982). In Pursuit of a Methodology for Testing Mathematical Programming Software. 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_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95406-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11495-6

  • Online ISBN: 978-3-642-95406-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation