Abstract
Abstract In this paper a novel global optimisation approach is introduced for solving multiparametric Mixed Integer Linear Programs (mp-MILP), with varying parameters in the objective function and the right-hand side of the constraints. The mp-MILP problem is decomposed into two sub-problems, a Master MINLP problem and a Slave multiparametric global optimization problem. Although the Master problem has to be solved to global optimality, we show that global optimization is not needed for the Slave problem and that it can be replaced by Multi-Parametric Linear Programming. The approach is illustrated with a process synthesis example.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
