Please use this identifier to cite or link to this item: https://ruomo.lib.uom.gr/handle/7000/633
Title: Improving a primal–dual simplex-type algorithm using interior point methods
Authors: Glavelis, T.
Ploskas, N.
Samaras, N.
Type: Article
Subjects: FRASCATI::Natural sciences::Computer and information sciences
FRASCATI::Natural sciences::Mathematics::Applied Mathematics
Keywords: Linear programming
interior point methods
exterior point algorithm
computational study
Issue Date: 2018
Source: Optimization
Volume: 67
Issue: 12
First Page: 2259
Last Page: 2274
Abstract: Interior point methods and simplex-type algorithms are the most widelyused algorithms for solving linear programming problems. The simplex algorithm has many important applications. Hence, even small improvements in simplex-type algorithms could result in noticeable practical impact. This paper presents a hybrid algorithm that combines the strengths of interior point methods and exterior point simplex algorithms. It applies an interior point method for a few iterations leading to significant improvement of the objective function value. At this point, the proposed algorithm uses an exterior point simplex algorithm to find an optimal solution. A crucial point is the selection of the interior point that will be used by the exterior point simplex algorithm to calculate a direction to the feasible region. The goal of the proposed implementation is twofold: (i) improve the performance of the exterior point algorithm, and (ii) find an optimal basic solution starting from an interior point (purification process). The latter goal is very important since an optimal basic solution can be used to solve closely related linear programming problems (warm-start) and linear programming relaxations of integer programming problems. Computational results on a set of benchmark problems (Netlib, Kennington, Mészáros) are presented to demonstrate the efficiency of the proposed hybrid algorithm. The results show that the proposed algorithm is 1.53× faster than the exterior point simplex algorithm.
URI: https://doi.org/10.1080/02331934.2018.1523906
https://ruomo.lib.uom.gr/handle/7000/633
ISSN: 0233-1934
Electronic ISSN: 1029-4945
Other Identifiers: 10.1080/02331934.2018.1523906
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
hybridpdipsa.pdf349,57 kBAdobe PDFView/Open


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