| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10348329 | Computers & Operations Research | 2011 | 8 Pages |
Abstract
The hybrid-LP uses an efficient pivoting iteration which is computationally comparable to the standard simplex iteration. Another feature is adaptability in finding the advanced starting point by avoiding the boundaries of the feasible region. In addition, the hybrid-LP has the ability to start from a feasible point which may not be a BFS. Our computational experiments demonstrate that the hybrid-LP reduces both the number of iterations and the running time compared to the simplex method on a wide range of test problems.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Camelia Al-Najjar, Behnam Malakooti,