Hybrid method for linear programming

DOI10.1007/978-3-031-79119-2_1MaRDI QIDQ6965359zbMATH OpenFDO

Authors Vitali Pirau, Roland Hildebrand

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-79119-2_1

zbMATH Keywords

interior-point methodlinear programmingsimplex method

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49) Interior-point methods (90C51)

Cites work

• A mathematical view of interior-point methods in convex optimization
• A new efficient primal dual simplex algorithm
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A primal-dual interior point method whose running time depends only on the constraint matrix
• Experiments in mixed-integer linear programming
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
• Interior point methods 25 years later
• Interior-point methods
• Linear Programming
• Measures of global sensitivity in linear programming: applications in banking sector
• Primal-Dual Interior-Point Methods for Self-Scaled Cones

This page was built for publication: Hybrid method for linear programming

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