A bilinear approach to the pooling problem†
From MaRDI portal
Publication:4327911
DOI10.1080/02331939208843786zbMath0817.90073OpenAlexW1968097460MaRDI QIDQ4327911
Les R. Foulds, Dag Haugland, Kurt O. Jørnsten
Publication date: 27 March 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843786
Related Items (29)
Natural gas production network infrastructure development under uncertainty ⋮ A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints ⋮ Pooling problems with polynomial-time algorithms ⋮ A relaxation method for nonconvex quadratically constrained quadratic programs ⋮ An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms ⋮ Large-scale standard pooling problems with constrained pools and fixed demands ⋮ A multi-commodity flow formulation for the generalized pooling problem ⋮ Strong formulations for the pooling problem ⋮ A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem ⋮ Complexity analysis and algorithm design of pooling problem ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness ⋮ Decomposition strategy for the stochastic pooling problem ⋮ Two-phase generalized reduced gradient method for constrained global optimization ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem ⋮ A cost minimization heuristic for the pooling problem ⋮ Stochastic perturbation of reduced gradient \& GRG methods for nonconvex programming problems ⋮ Relaxations and discretizations for the pooling problem ⋮ An application of Lipschitzian global optimization to product design ⋮ Linepack planning models for gas transmission network under uncertainty ⋮ New multi-commodity flow formulations for the pooling problem ⋮ Design of planar articulated mechanisms using branch and bound ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ The computational complexity of the pooling problem ⋮ Feasibility and cost minimisation for a lithium extraction problem ⋮ Impact of compressor failures on gas transmission network capability ⋮ Generalized bilinear programming: An application in farm management ⋮ A new Lagrangean approach to the pooling problem
Cites Work
This page was built for publication: A bilinear approach to the pooling problem†
