Year: 1999
Author: Ping-Qi Pan
Journal of Computational Mathematics, Vol. 17 (1999), Iss. 3 : pp. 233–242
Abstract
In this paper, we first propose a perturbation procedure for achieving dual feasibility, which starts with any basis without introducing artificial variables. This procedure and the dual simplex method are then incorporated into a general purpose algorithm; then, a modification of it using a perturbation technique is made in order to handle highly degenerate problems efficiently. Some interesting theoretical results are presented. Numerical results obtained are reported, which are very encouraging through still preliminary.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1999-JCM-9098
Journal of Computational Mathematics, Vol. 17 (1999), Iss. 3 : pp. 233–242
Published online: 1999-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 10
Keywords: Linear programming Simplex method Perturbation Dual feasibility.