Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 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.

Citations to this Article [8 citations]

The following is the list of published articles that have cited the current article.

  • Juntao Fei, and Yuzheng Yang, “System Identification of MEMS Vibratory Gyroscope Sensor,” Mathematical Problems in Engineering, vol. 2011, pp. 1–12, 2011. View at Publisher · View at Google Scholar
  • Demetrius V. Shapot, and Alexander M. Lukatskii, “Solution Building for Arbitrary System of Linear Inequalities in an Explicit Form,” American Journal of Computational Mathematics, vol. 02, no. 01, pp. 1–11, 2012. View at Publisher · View at Google Scholar
  • Jiwoong Choi, and In-Chan Choi, “Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints,” International Journal of Computer Mathematics, vol. 91, no. 12, pp. 2470–2482, 2014. View at Publisher · View at Google Scholar
  • Yen-I Chiang, Chang-Chun Lin, and Shih-Wei Lin, “Efficient model and heuristic for the intermodal terminal location problem,” Computers and Operations Research, vol. 51, pp. 41–51, 2014. View at Publisher · View at Google Scholar
  • Sumathi, and Gangadharan, “Selection of constraints with a new approach in linear programming problems,” Applied Mathematical Sciences, vol. 8, no. 25-28, pp. 1311–1321, 2014. View at Publisher · View at Google Scholar
  • Luis Enrique Sucar, Alejo Mosso-Vázquez, Marco Antonio Cruz-Chávez, and David Juárez-Romero, “A KKT simplex method for efficiently solving linear programs for grasp analysis based on the identification of nonbinding constraints,” Computacion y Sistemas, vol. 18, no. 2, pp. 225–242, 2014. View at Publisher · View at Google Scholar
  • Adam Cutbill, and G. Gary Wang, “Mining constraint relationships and redundancies with association analysis for optimization problem formulation,” Engineering Optimization, pp. 1–20, 2015. View at Publisher · View at Google Scholar
  • Sebastian Koch, Jochen Gönsch, and Claudius Steinhardt, “Dynamic programming decomposition for choice-based revenue management with flexible products,” Transportation Science, vol. 51, no. 4, pp. 1046–1062, 2017. View at Publisher · View at Google Scholar