Extending the fundamental theorem of linear programming for strict inequalities

DOI10.1145/3452143.3465538MaRDI QIDQ6666552zbMATH OpenFDO

Authors Jasper Nalbach, Erika Ábrahám, Gereon Kremer

Publication date 20 January 2025

Full work available at URL https://doi.org/10.1145/3452143.3465538

zbMATH Keywords

linear arithmeticlinear programmingsimplexSMT solving

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
• A General Approach to Removing Degeneracies
• An exact rational mixed-integer programming solver
• Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals
• Consistency, redundancy, and implied equalities in linear systems
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 3982906 (Why is no real title available?)
• scientific article; zbMATH DE number 1240224 (Why is no real title available?)
• scientific article; zbMATH DE number 2079347 (Why is no real title available?)
• scientific article; zbMATH DE number 3022422 (Why is no real title available?)
• Iterative refinement for linear programming
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• OpenSMT2: an SMT solver for multi-core and cloud computing
• Theorie der einfachen Ungleichungen.

Cited in

(3)

• FMplex: a novel method for solving linear real arithmetic problems
• FMplex: exploring a bridge between Fourier-Motzkin and simplex
• Algorithms for optimally shifting intervals under intersection graph models

This page was built for publication: Extending the fundamental theorem of linear programming for strict inequalities

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