Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
From MaRDI portal
Recommendations
- Strong convex nonlinear relaxations of the pooling problem
- A bilinear approach to the pooling problem†
- scientific article; zbMATH DE number 1795200
- Relaxations and discretizations for the pooling problem
- On the effectiveness of sequential linear programming for the pooling problem
- A new Lagrangean approach to the pooling problem
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Strong formulations for the pooling problem
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- Maximal Function Pooling with Applications
Cited in
(12)- An accelerating algorithm for globally solving nonconvex quadratic programming
- A bilinear approach to the pooling problem†
- Maximal Function Pooling with Applications
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
- Unit-operation nonlinear modeling for planning and scheduling applications
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- A global optimization algorithm using parametric linearization relaxation
- Domain reduction techniques for global NLP and MINLP optimization
- Reasoning on infeasibility in distributed collaborative computing environment
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs
This page was built for publication: Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030783)
