Linear Programming Benchmark and Random Problems

Nikolaos Ploskas and Nikolaos Samaras
Additional contact information
Nikolaos Ploskas: University of Macedonia
Nikolaos Samaras: University of Macedonia

Chapter Chapter 3 in Linear Programming Using MATLAB®, 2017, pp 73-134 from Springer

Abstract: 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.

Keywords: Fprintf; Sscanf; Varname; Sixth Field; Mn Cl (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-65919-0_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319659190

DOI: 10.1007/978-3-319-65919-0_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().