Complexity analysis and algorithm design of pooling problem

DOI10.1007/s40305-018-0193-7zbMath1413.90317OpenAlexW2789308580MaRDI QIDQ1660293

Rui Diao, Yu-Hong Dai, Kai Fu

Publication date: 15 August 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-018-0193-7

zbMATH Keywords

complexity analysispooling problemnon-monotonesuccessive linear programming

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items (1)

An optimized approach of venous thrombus embolism risk assessment

Uses Software

• CLP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global minimization by reducing the duality gap
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Strong formulations for the pooling problem
• Valid Inequalities for the Pooling Problem with Binary Variables
• Pooling Problem: Alternate Formulations and Solution Methods
• An Improved Successive Linear Programming Algorithm
• Successive Linear Programming at Exxon
• A bilinear approach to the pooling problem†

This page was built for publication: Complexity analysis and algorithm design of pooling problem