Please use this identifier to cite or link to this item:
Title: Computational complexity of the exterior point simplex algorithm
Authors: Voulgaropoulou, Sophia
Samaras, Nikolaos
Sifaleras, Angelo
Type: Article
Subjects: FRASCATI::Natural sciences::Mathematics::Applied Mathematics
FRASCATI::Natural sciences::Computer and information sciences
Keywords: Exterior point simplex algorithm
Regression analysis
Computational complexity
Linear relation
Issue Date: 2019
Publisher: Springer
Source: Operational Research
Volume: 19
Issue: 2
First Page: 297
Last Page: 316
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.
ISSN: 1109-2858
Other Identifiers: 10.1007/s12351-017-0291-z
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
Computational_complexity_of_the_Exterior_Point_Simplex_Algorithm.pdf309,56 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.