Extending the fundamental theorem of linear programming for strict inequalities

DOI10.1145/3452143.3465538MaRDI QIDQ6666552

Jasper Nalbach, Erika Abraham, Gereon Kremer

Publication date: 20 January 2025

zbMATH Keywords

linear programminglinear arithmeticsimplexSMT solving

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Consistency, redundancy, and implied equalities in linear systems
• Theorie der einfachen Ungleichungen.
• 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
• Iterative refinement for linear programming
• An Exact Rational Mixed-Integer Programming Solver
• SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
• A General Approach to Removing Degeneracies
• Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals

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)