Premium
Performance evaluation of a family of criss–cross algorithms for linear programming
Author(s) -
Bonates Tibérius,
Maculan Nelson
Publication year - 2003
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/1475-3995.00392
Subject(s) - algorithm , linear programming , simplex algorithm , set (abstract data type) , computer science , criss cross algorithm , simplex , mathematics , mathematical optimization , linear fractional programming , programming language , combinatorics
In this article we evaluate a family of criss–cross algorithms for linear programming problems, comparing the results obtained by these algorithms over a set of test problems with those obtained by the simplex algorithms implemented in the XPRESS commercial package. We describe the known criss–cross variants existing in the literature and introduce new versions obtained with a slight modification based on the original criss–cross algorithm. Moreover, we consider some computational details of our implementation and describe the set of test problems used.