Redundancy elimination with a lexicographic solved form

DOI10.1007/BF02284625zbMath0887.90115OpenAlexW2568885726MaRDI QIDQ1380440

Pascal Van Hentenryck, J.-L. Imbert

Publication date: 25 May 1998

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02284625

zbMATH Keywords

syntactic criteriadetection of redundant linear constraints

Mathematics Subject Classification ID

Linear programming (90C05) Iterative numerical methods for linear systems (65F10)

Related Items (4)

Consistency, redundancy, and implied equalities in linear systems ⋮ Optimality-based domain reduction for inequality-constrained NLP and MINLP problems ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Using dual presolving reductions to reformulate cumulative constraints

Uses Software

• PROC MEANS

Cites Work

• Redundancy in mathematical programming. A state-of-the-art survey
• Standard forms for rational linear arithmetic in constraint logic programming.
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Unnamed Item

This page was built for publication: Redundancy elimination with a lexicographic solved form