On the effectiveness of sequential linear programming for the pooling problem

DOI10.1007/s10479-022-05156-7zbMath1514.90217arXiv2002.10899MaRDI QIDQ6103203

K. I. M. McKinnon, Andreas Grothey

Publication date: 26 June 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.10899

zbMATH Keywords

global optimizationnonlinear programmingpooling problemsequential linear programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Resolving degeneracy in quadratic programming
• Global minimization by reducing the duality gap
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Trust Region Methods
• Nonlinear programming without a penalty function.
• The computational complexity of the pooling problem

This page was built for publication: On the effectiveness of sequential linear programming for the pooling problem