Variable Elimination in Linear Constraints

DOI10.1093/COMJNL/36.5.463MaRDI QIDQ3140557zbMATH OpenOpenAlexFDO

Authors Vijay Chandru

Publication date 31 January 1994

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/36.5.463

zbMATH Keywords

Variable elimination

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Automated Reasoning
• Variable Elimination for Disequations in Generalized Linear Constraint Systems
• scientific article; zbMATH DE number 35420
• scientific article; zbMATH DE number 1507955
• On Fourier's algorithm for linear arithmetic constraints

Cited in

(15)

• Eliminating columns in the simplex method for linear programming
• A linear programming primer: from Fourier to Karmarkar
• Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
• Variable Elimination for Disequations in Generalized Linear Constraint Systems
• Conflict Resolution
• An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ
• Reachability and optimal control for linear hybrid automata: a quantifier elimination approach
• scientific article; zbMATH DE number 35420 (Why is no real title available?)
• scientific article; zbMATH DE number 1507955 (Why is no real title available?)
• Fourier algorithm revisited
• Automated Reasoning
• Minimal sign representation of Boolean functions: algorithms and exact results for low dimensions
• On Fourier's algorithm for linear arithmetic constraints
• Fourier elimination for compiling constraint hierarchies
• A novel linear optimization presolve technique based on Fourier-Motzkin elimination

This page was built for publication: Variable Elimination in Linear Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140557)