Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem

DOI10.1287/ijoc.4.2.119zbMath0770.90067OpenAlexW2129311357MaRDI QIDQ4030783

Weldon Alexander Lodwick

Publication date: 1 April 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.4.2.119

zbMATH Keywords

postoptimizationbilinearitiesnonlinear constraint setspreoptimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Unit-operation nonlinear modeling for planning and scheduling applications ⋮ An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints ⋮ A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs ⋮ A global optimization algorithm using parametric linearization relaxation ⋮ Reasoning on infeasibility in distributed collaborative computing environment ⋮ A new bound-and-reduce approach of nonconvex quadratic programming problems ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints ⋮ A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems

This page was built for publication: Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem