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

DOI10.1080/00207160601014148zbMath1128.90040OpenAlexW2018218474MaRDI QIDQ3437363

S. Paulraj, Chenniappan Chellappan, T. R. Natesan

Publication date: 9 May 2007

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160601014148

zbMATH Keywords

optimizationlinear programmingmodel reductionredundant constraintsintercept matrix

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A heuristic algorithm for resource allocation/reallocation problem ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Analysis of hybrid heuristic model reduction algorithms for solving linear programming problems. ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints

Cites Work

• Redundancy in mathematical programming. A state-of-the-art survey
• Finding duplicate rows in a linear programming model
• Advanced preprocessing techniques for linear and quadratic programming
• Robust Reduction of a Class of Large-Scale Linear Programs
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Two direct methods in linear programming

This page was built for publication: A heuristic approach for identification of redundant constraints in linear programming models