Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 83, 2006 - Issue 8-9
Submit an article Journal homepage
447
Views
16
CrossRef citations to date
0
Altmetric
Original Articles

A heuristic approach for identification of redundant constraints in linear programming models

S. Paulraj Department of Mathematics, Anna University, Chennai, 600 025, Tamil Nadu, IndiaCorrespondence[email protected]
,
C. Chellappan Ramanujan Computing Centre, Anna University, Chennai, 600 025, Tamil Nadu, India
&
T. R. Natesan Ramanujan Computing Centre, Anna University, Chennai, 600 025, Tamil Nadu, India
Pages 675-683 | Received 25 Jul 2005, Accepted 30 Aug 2006, Published online: 18 Nov 2010

References

  • Anderson , E. D. and Andersen , K. D. 1995 . Presolving in linear programming . Mathematical Programming Series B , 71 : 221 – 245 .
  • Brearley , A. L. , Mitra , G. and Williams , H. P. 1975 . Analysis of mathematical programming problem prior to applying the simplex algorithm . Mathematical Programming , 8 : 54 – 83 .
  • Gowdzio , J. 1997 . Presolve analysis of linear program prior to applying an interior point method . INFORMS: Journal on Computing , 9 : 73 – 91 .
  • Ioslovich , I. 2002 . Robust reduction of a class of large scale linear program . SIAM Journal on Optimization , 12 : 262 – 282 .
  • Karwan , M. H. , Loffi , V. , Telgan , J. and Zionts , S. 1983 . Redundancy in Mathematical Programming: A State of the Art Survey , Berlin : Springer-Verlag .
  • Kuhn , H. W. and Quandt , R. E. 1962 . “ An experimental study of the simplex method ” . In Proceedings of Symposia in Applied Mathematics , Edited by: Metropolis , N. Vol. 15 , 107 – 124 . Providence, RI : American Mathematical Society .
  • Mattheiss , T. H. 1973 . An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities . Operations Research , 21 : 247 – 260 .
  • Meszaros , C. and Suhl , U. H. 2003 . Advanced preprocessing techniques for linear and quadratic programming . OR Spectrum , 25 : 575 – 595 .
  • Stojkovic , N. V. and Stanimirovic , P. S. 2001 . Two direct methods in linear programming . European Journal of Operational Research , 131 : 417 – 439 .
  • Telgan , J. 1983 . Identifying redundant constraints and implicit equalities in system of linear constraints . Management Science , 29 : 1209 – 1222 .
  • Tomlin , J. A. and Wetch , J. S. 1986 . Finding duplicate rows in a linear programming model . Operations Research Letters , 5 : 7 – 11 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.