A Logic-Based Implementation of the LP/NLP Branch and Bound Algorithm
This study addresses discrete optimization problems in Process System Engineering (PSE) by introducing a Logic-Based LP/NLP Branch and Bound (LB LP/NLP BB) algorithm. We extend the LP/NLP BB algorithm to exploit disjunctive structures, enhancing its capabilities for discrete/continuous optimization....
Saved in:
Published in | Computer Aided Chemical Engineering Vol. 53; pp. 3415 - 3420 |
---|---|
Main Authors | , , |
Format | Book Chapter |
Language | English |
Published |
2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This study addresses discrete optimization problems in Process System Engineering (PSE) by introducing a Logic-Based LP/NLP Branch and Bound (LB LP/NLP BB) algorithm. We extend the LP/NLP BB algorithm to exploit disjunctive structures, enhancing its capabilities for discrete/continuous optimization. The proposed logic-based approach reduces combinatorial search efforts, showcasing superior performance compared to non-logic versions. Through a case study and computational results, we demonstrate a substantial reduction in both the number and size of LP problems solved in the logic version. The Logic-Based LP/NLP BB algorithm emerges as a promising tool for tackling large-scale disjunctive problems, offering potential applications superstructure optimization embedded with commercial process simulators. |
---|---|
ISBN: | 9780443288241 0443288240 |
ISSN: | 1570-7946 |
DOI: | 10.1016/B978-0-443-28824-1.50570-6 |