Global Optimization and Constraint Satisfaction

DOI10.1007/B94062zbMATH Open1255.90077OpenAlexW2624301280MaRDI QIDQ5897041FDOQ5897041

Authors: Christian Jansson 

Publication date: 2 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94062

zbMATH Keywords

linear programmingsensitivity analysisinterval arithmeticbranch-and-boundrigorous error bounds

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited In (6)

• Convergence and error bound for perturbation of linear programs
• Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
• Safe and tight linear estimators for global optimization
• A posteriori error bounds in linear programming aggregation
• Error bounds for initial value problems by optimization
• Rigorous Error Bounds for the Optimal Value in Semidefinite Programming

Uses Software

• PROFIL/BIAS
• INTOPT_90

This page was built for publication: Global Optimization and Constraint Satisfaction

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