Analysis of MILP Techniques for the Pooling Problem

DOI10.1287/opre.2015.1357zbMath1327.90351OpenAlexW2059271569MaRDI QIDQ3453340

Akshay Gupte, Santanu S. Dey

Publication date: 20 November 2015

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

Full work available at URL: https://semanticscholar.org/paper/fb4b806ad630f4c9ebfa1b235d941b5068de2ede

zbMATH Keywords

nonlinearheuristicintegermulticommoditynetworks/graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (24)

A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints ⋮ Pooling problems with polynomial-time algorithms ⋮ Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem ⋮ Tightening methods based on nontrivial bounds on bilinear terms ⋮ Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness ⋮ Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Error bounds for monomial convexification in polynomial optimization ⋮ Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem ⋮ A polynomially solvable case of the pooling problem ⋮ Relaxations and discretizations for the pooling problem ⋮ New multi-commodity flow formulations for the pooling problem ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ The computational complexity of the pooling problem ⋮ Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy ⋮ Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ Solving certain complementarity problems in power markets via convex programming ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs ⋮ Compact mixed-integer programming formulations in quadratic optimization

Uses Software

• XPRESS
• APOGEE

Cites Work

• A cost minimization heuristic for the pooling problem
• Relaxations and discretizations for the pooling problem
• Global minimization by reducing the duality gap
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Strong formulations for the pooling problem
• Comparison of Discrete and Continuous Models for the Pooling Problem
• Valid Inequalities for the Pooling Problem with Binary Variables
• Pooling Problem: Alternate Formulations and Solution Methods
• Successive Linear Programming at Exxon
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: Analysis of MILP Techniques for the Pooling Problem