Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2010 (2010), Article ID 723402, 16 pages
http://dx.doi.org/10.1155/2010/723402
Research Article

A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems

1Department of Mathematics, Madras Institute of Technology Campus, Anna University, Chromepet, Chennai, Tamil Nadu 600 044, India
2Anna University, Chennai, Tamil Nadu, India

Received 7 January 2010; Revised 15 April 2010; Accepted 21 September 2010

Academic Editor: Joaquim J. Júdice

Copyright © 2010 Paulraj S. and Sumathi P. 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. E. D. Andersen and K. D. Andersen, “Presolving in linear programming,” Mathematical Programming. Series B, vol. 71, no. 2, pp. 221–245, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. M. L. Balinski, “An algorithm for finding all vertices of convex polyhedral sets,” Journal of the Society for Industrial and Applied Mathematics, vol. 9, no. 1, pp. 72–88, 1961. View at Google Scholar · View at Zentralblatt MATH
  3. J. C. G. Boot, “On trivial and binding constraints in programming problems,” Management Science, vol. 8, no. 4, pp. 419–441, 1962. View at Google Scholar
  4. A. L. Brearley, G. Mitra, and H. P. Williams, “Analysis of mathematical programming problems prior to applying the simplex algorithm,” Mathematical Programming, vol. 8, pp. 54–83, 1975. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. A. Boneh, S. Boneh, and R. J. Caron, “Constraint classification in mathematical programming,” Mathematical Programming, vol. 61, no. 1, pp. 61–73, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. R. J. Caron, J. F. McDonald, and C. M. Ponic, “A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary,” Journal of Optimization Theory and Applications, vol. 62, no. 2, pp. 225–237, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. T. Gal, “Weakly redundant constraints and their impact on post optimal analysis,” European Journal of Operational Research, vol. 60, pp. 315–326, 1979. View at Google Scholar
  8. P. O. Gutman and I. Isolovich, “Robust redundancy determination and evaluation of the dual variables of linear programming problems in the presence of uncertainty, on the generalized wolf problem: preprocessing of nonnegative large scale linear programming problems with group constraints,” Technion-Israel Institute of Technology, vol. 68, no. 8, pp. 1401–1409, 2007. View at Google Scholar
  9. H. J. Greenberg, “Consistency, redundancy, and implied equalities in linear systems,” Mathematics and Artificial Intelligence, vol. 17, pp. 37–83, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. M. H. Karwan, V. Lotfi, J. Telgen, and S. Zionts, Eds., Redundancy in Mathematical Programming: A State-of-the-Art Survey, Springer, Berlin, Germany, 1983.
  11. T. H. Mattheis, “An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities,” Operations Research, vol. 21, pp. 247–260, 1973. View at Publisher · View at Google Scholar
  12. J. Lisy, “Metody pro nalezini redundantnich omezeni vulohach linerniho programovani. Ekonomicko MatematicS,” Obzor, vol. 7, no. 3, pp. 285–298, 1971. View at Google Scholar
  13. N. V. Stojković and P. S. Stanimirović, “Two direct methods in linear programming,” European Journal of Operational Research, vol. 131, no. 2, pp. 417–439, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. S. Paulraj, C. Chellappan, and T. R. Natesan, “A heuristic approach for identification of redundant constraints in linear programming models,” International Journal of Computer Mathematics, vol. 83, no. 8-9, pp. 675–683, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. J. Telgen, “Identifying redundant constraints and implicit equalities in system of linear constraints,” Management Science, vol. 29, no. 10, pp. 1209–1222, 1983. View at Google Scholar · View at Zentralblatt MATH
  16. G. L. Thompson, F. M. Tonge, and S. Zionts, “Techniques for removing nonbinding constraints and extraneous variables from linear programming problems,” Management Science, vol. 12, no. 7, pp. 588–608, 1996. View at Google Scholar
  17. S. Zionts, Size of reduction techniques of linear programming and their applications, Dissertation, Carnegie Institute of Technology, 1965.
  18. “Netlib problems,” http://ftp.zib.de/pub/mp-testdata/madlib/node2.html.
  19. J. E. Beasley, “Distributing test problems by electronic mail,” Journal of Operational Research Society, vol. 41, pp. 1069–1107, 1990. View at Google Scholar