Comparison of MINLP formulations for global superstructure optimization
نویسندگان
چکیده
Abstract Superstructure optimization is a powerful but computationally demanding task that can be used to select the optimal structure among many alternatives within single optimization. In chemical engineering, such problems naturally arise in process design, where different need considered simultaneously minimize specific objective function (e.g., production costs or global warming impact). Conventionally, superstructure are either formulated with Big-M Convex Hull reformulation approach. However, for containing nonconvex functions, it not clear whether these yield most efficient formulations. We therefore compare conventional problem formulations less common ones (using equilibrium constraints, step multiplications of binary and continuous variables model disjunctions) using three case studies. First, minimalist derive conjectures about their computational performance. These then further investigated by two more complex literature benchmarks. Our analysis shows approaches tend result smaller size, while keeping relaxations comparably tight—despite introduction additional nonconvexities. For studies, we demonstrate all benefit from eliminating reduced-space formulation. encourage also consider introduce nonconvexities reduce number variables.
منابع مشابه
A Differential Evolution Approach for Global Optimization of Minlp Problems
The global optimization of mixed integer non-linear programming (MINLP) problems is an active research area in many engineering fields. In this work, Differential Evolution (DE), a hybrid Evolutionary Computation method, is used for the optimization of nonconvex MINLP problems and a comparison is made among the algorithms based on hybrid of Simplex & Simulated Annealing (MSIMPSA), Genetic Algor...
متن کاملGlobal Optimization of MINLP Problems in Process Synthesis and Design
Abstract : Two new methodologies for the global optimization of MINLP models, the Special structure Mixed Integer Nonlinear BB, SMIN– BB, and the General structure Mixed Integer Nonlinear BB, GMIN– BB, are presented. Their theoretical foundations provide guarantees that the global optimum solution of MINLPs involving twice–differentiable nonconvex functions in the continuous variables can be id...
متن کاملMinlp Optimization of Steel Frames
ABSTRACT: The paper presents the discrete dimension optimization of unbraced rigid steel plane frames. The optimization of steel frames was carried out by the Mixed-Integer Non-linear Programming (MINLP) approach. The MINLP is a combined discrete-continuous optimization technique. It performs the discrete optimization of discrete decisions simultaneously with the continuous optimization of cont...
متن کاملMINLP Optimization of Cooling Towers
This paper presents a mixed-integer nonlinear programming (MINLP) model for the optimal design of mechanical counter-flow cooling towers, subjected to standard design constraints. The objective function consists of the minimization of the total annual cost, which includes the capital cost of the cooling tower (that depends on the filling material and the air flowrate) and the operating cost (th...
متن کاملUsing redundancy to strengthen the relaxation for the global optimization of MINLP problems
In this paper we present a strategy to improve the relaxation for the global optimization of nonconvex MINLPs. The main idea consists in recognizing that each constraint or set of constraints has a meaning that comes from the physical interpretation of the problem. When these constraints are relaxed part of this meaning is lost. Adding redundant constraints that recover that physical meaning st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization and Engineering
سال: 2022
ISSN: ['1389-4420', '1573-2924']
DOI: https://doi.org/10.1007/s11081-021-09707-y