Computational complexity of the exterior point simplex algorithm
Sophia Voulgaropoulou (),
Nikolaos Samaras () and
Angelo Sifaleras ()
Additional contact information
Sophia Voulgaropoulou: University of Macedonia
Nikolaos Samaras: University of Macedonia
Angelo Sifaleras: University of Macedonia
Operational Research, 2019, vol. 19, issue 2, No 1, 297-316
Abstract:
Abstract In this paper, we investigate the computational behavior of the exterior point simplex algorithm. Up until now, there has been a major difference observed between the theoretical worst case complexity and practical performance of simplex-type algorithms. Computational tests have been carried out on randomly generated sparse linear problems and on a small set of benchmark problems. Specifically, 6780 linear problems were randomly generated, in order to formulate a respectable amount of experiments. Our study consists of the measurement of the number of iterations that the exterior point simplex algorithm needs for the solution of the above mentioned problems and benchmark dataset. Our purpose is to formulate representative regression models for these measurements, which would play a significant role for the evaluation of an algorithm’s efficiency. For this examination, specific characteristics, such as the number of constraints and variables, the sparsity and bit length, and the condition of matrix A, of each linear problem, were taken into account. What drew our attention was that the formulated model for the randomly generated problems reveal a linear relation among these characteristics.
Keywords: Exterior point simplex algorithm; Regression analysis; Computational complexity; Linear relation; 90C27; 65K05; 90C05; 90B10; 91A90 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s12351-017-0291-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.
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:operea:v:19:y:2019:i:2:d:10.1007_s12351-017-0291-z
Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351
DOI: 10.1007/s12351-017-0291-z
Access Statistics for this article
Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis
More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().