A recursive decision method for termination of linear programs

DOI10.1145/2631948.2631966MaRDI QIDQ2819718zbMATH OpenOpenAlexFDO

Authors Yi Li

Publication date 29 September 2016

Published in Proceedings of the 2014 Symposium on Symbolic-Numeric Computation (Search for Journal in Brave)

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

zbMATH Keywords

linear loopssemi-algebraic setstermination analysis

Mathematics Subject Classification ID

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

Recommendations

• Computer Aided Verification
• Symbolic decision procedure for termination of linear programs
• Termination of Integer Linear Programs
• Termination of linear programs with nonlinear constraints
• An efficient decomposition method for linear programming problems
• scientific article; zbMATH DE number 1053663
• scientific article; zbMATH DE number 1418107
• A New Finite Continuation Algorithm for Linear Programming
• Modification of the recursive solution procedure for a linear programming problem

Cited in

(9)

• Termination of polynomial loops
• Witness to non-termination of linear programs
• Signature-based method of deciding program~termination
• Computer Aided Verification
• Symbolic decision procedure for termination of linear programs
• Termination of Integer Linear Programs
• Termination of linear programs with nonlinear constraints
• Termination of triangular polynomial loops
• Polynomial loops: beyond termination

This page was built for publication: A recursive decision method for termination of linear programs

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