Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics and Decision Sciences
Volume 2006, Article ID 76187, 11 pages
http://dx.doi.org/10.1155/JAMDS/2006/76187

A Computational Approach to Pivot Selection in the LP Relaxation of Set Problems

Department of Mathematics, Faculty of Science, Kurdistan University, P.O. Box 416, Sanandaj 66177, Iran

Received 30 January 2006; Revised 17 July 2006; Accepted 10 October 2006

Copyright © 2006 F. Djannaty and B. Rostamy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. F. Djannaty, Network based heuristics for the set covering problem, M.S. thesis, Department of Mathematics and Statistic, Brunel University, Brunel, 1997.
  2. F. Djannaty, “Some useful cost allocation strategies for the shortest route relaxation of the set covering problem,” Electronic Journal of SADIO, vol. 22, no. 5, pp. 12–23, 2002. View at Google Scholar
  3. J. J. Forrest and D. Goldfarb, “Steepest-edge simplex algorithms for linear programming,” Mathematical Programming, vol. 57, no. 3, pp. 341–374, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. D. Goldfarb and J. K. Reid, “A practicable steepest-edge simplex algorithm,” Mathematical Programming, vol. 12, no. 3, pp. 361–371, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. P. M. J. Harris, “Pivot selection methods of the Devex Lp code,” in Computational Practice in Mathematical Programming, vol. 4 of Mathematical Programming Studies, pp. 30–57, North-Holland, Amsterdam, 1975. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. B. L. Kaluzny, Finite Pivot algorithms and feasibility, Msc thesis, School of Computer Science , McGill University, Quebec, 2001.
  7. H. W. Kuhn and R. E. Quandt, “On upper bound for the number of iterations in solving linear Programs,” Operations Research, vol. 12, no. 1, pp. 161–165, 1964. View at Google Scholar · View at Zentralblatt MATH
  8. B. Rostamy, Pivot selection strategies in simplex method, Msc thesis, University of Kurdistan, Kurdistan, 2005.