Integral approximation of rays and verification of feasibility

DOI10.1023/B:REOM.0000032108.23609.BCMaRDI QIDQ1826440zbMATH OpenFDO

Authors Waltraud Huyer, Arnold Neumaier

Publication date 6 August 2004

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:REOM.0000032108.23609.BC

zbMATH Keywords

algorithmglobal optimizationlinear programsystem of linear equations and inequalities

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Algorithms with automatic result verification (65G20) Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10)

Recommendations

• Validated infeasible interior-point predictor-corrector methods for linear programming
• Certifying feasibility and objective value of linear programs
• Exact solutions to linear programming problems
• scientific article; zbMATH DE number 1206063
• scientific article; zbMATH DE number 2079347

Cited in

(3)

• Sensitivity of ray paths to initial conditions
• Certifying feasibility and objective value of linear programs
• Preservation of external rays in non-autonomous iteration

Describes a project that uses

Uses Software

• COCONUT
• INTOPT_90

This page was built for publication: Integral approximation of rays and verification of feasibility

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