Abstract
Mathematical Programming System (MPS) format is a widely accepted standard for defining LPs. The vast majority of solvers takes as input an LP problem in MPS format. The given LP problem can be either a benchmark problem, i.e., a problem that is publicly available, or a randomly generated LP problem. This chapter presents the MPS format and two codes in MATLAB that can be used to convert an MPS file to MATLAB’s matrix format (MAT) and vice versa. Moreover, codes that can be used to create randomly generated sparse or dense LPs are also given. Finally, the most well-known benchmark libraries for LPs are also presented.
This is a preview of subscription content, log in via an institution.
References
Netlib Repository. (2017). Netlib LP test set. Available online at: http://www.netlib.org/lp/data/ (Last access on March 31, 2017).
Netlib Repository. (2017). Kennington LP test set. Available online at: http://www.netlib.org/lp/data/kennington/ (Last access on March 31, 2017).
Netlib Repository. (2017). infeas section of the Netlib LP test set. Available online at: http://www.netlib.org/lp/infeas/ (Last access on March 31, 2017).
Mészáros, C. (2017). The misc section of the Mészáros LP test set. Available online at: http://www.sztaki.hu/~meszaros/public_ftp/lptestset/misc/ (Last access on March 31, 2017).
Mészáros, C. (2017). The problematic section of the Mészáros LP test set. Available online at: http://www.sztaki.hu/~meszaros/public_ftp/lptestset/problematic/ (Last access on March 31, 2017).
Mészáros, C. (2017). The new section of the Mészáros LP test set. Available online at: http://www.sztaki.hu/~meszaros/public_ftp/lptestset/New/ (Last access on March 31, 2017).
Mészáros, C. (2017). The stochlp section of the Mészáros LP test set. Available online at: http://www.sztaki.hu/~meszaros/public_ftp/lptestset/stochlp/ (Last access on March 31, 2017).
Mittelmann, H. (2017). The Mittelmann LP test set. Available online at: http://plato.asu.edu/ftp/lptestset/ (Last access on March 31, 2017).
Paparrizos, K., Samaras, N., & Stephanides, G. (2000). A method for generating random optimal linear problems and a comparative computational study. In Proceedings of the 13th National Conference Hellenic Operational Research Society, 30 November–2 December, University of Piraeus, Greece, 785–794 (In Greek).
Ordez, F., & Freund, R. M. (2003). Computational experience and the explanatory value of condition measures for linear optimization. SIAM Journal on Optimization, 14(2), 307–333.
Author information
Authors and Affiliations
3.1 Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Ploskas, N., Samaras, N. (2017). Linear Programming Benchmark and Random Problems. In: Linear Programming Using MATLAB® . Springer Optimization and Its Applications, vol 127. Springer, Cham. https://doi.org/10.1007/978-3-319-65919-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-65919-0_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65917-6
Online ISBN: 978-3-319-65919-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)