Formalization of Incremental Simplex Algorithm by Stepwise Refinement

DOI10.1007/978-3-642-32759-9_35MaRDI QIDQ4647860zbMATH OpenOpenAlexFDO

Authors Mirko Spasić, Filip Marić

Publication date 8 November 2012

Published in FM 2012: Formal Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32759-9_35

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• An extension of the simplex algorithm for semi-infinite linear programming
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• On the complexity of a pivot step of the revised simplex algorithm
• An improved initial basis for the simplex algorithm
• An integral simplex algorithm for solving combinatorial optimization problems
• A reformulation-linearization technique for optimization over simplices
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A Forward Simplex Method for Staircase Linear Programs
• A finite steps algorithm for solving convex feasibility problems

Cited in

(7)

• Verifying an incremental theory solver for linear arithmetic in Isabelle/HOL
• Formalizing the Face Lattice of Polyhedra
• Formalizing the face lattice of polyhedra
• Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL
• Farkas' Lemma and Motzkin's Transposition Theorem
• An Incremental Simplex Algorithm with Unsatisfiable Core Generation
• Linear Programming

Describes a project that uses

Uses Software

• Isabelle/HOL

This page was built for publication: Formalization of Incremental Simplex Algorithm by Stepwise Refinement

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