Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Letters"
DOI: 10.48550/arxiv.2207.03699
Abstract: Discretization-based methods have been proposed for solving nonconvex optimization problems with bilinear terms such as the pooling problem. These methods convert the original nonconvex optimization problems into mixed-integer linear programs (MILPs). In this paper we… read more here.
Keywords: models pooling; milp models; pooling problem; bilinear terms ... See more keywords