نتایج جستجو برای: minlp
تعداد نتایج: 854 فیلتر نتایج به سال:
Many optimization problems involve integer and continuous variables that can be modeled as mixed integer nonlinear programming (MINLP) problems. This has led to a wide range of applications, in particular in some engineering areas. Here, we provide a brief overview on MINLP, and present a simple idea for a future nonconvex MINLP solution technique.
Primal heuristics are an important component of state-of-the-art codes for mixed integer nonlinear programming (MINLP). In this article we give a compact overview of primal heuristics for MINLP that have been suggested in the literature of recent years. We sketch the fundamental concepts of different classes of heuristics and discuss specific implementations. A brief computational experiment sh...
Process synthesis often involves the solution of large nonlinear discretecontinuous optimization problems, which are usually formulated as mixedinteger nonlinear programming (MINLP) or generalized disjunctive programming (GDP) problems and solved with MINLP solvers. This paper presents an efficient solution method for these problems named successive relaxed MINLP (SR-MINLP), where the model for...
This paper presents scaled quadratic cuts based on scaling the second-order Taylor expansion terms for the decomposition methods Outer Approximation (OA) and Partial Surrogate Cuts (PSC) used for solving convex Mixed Integer Nonlinear Programing (MINLP). The scaled quadratic cut is proved to be a stricter and tighter underestimation for the convex nonlinear functions than the classical supporti...
This paper presents a structural synthesis using the Mixed-Integer Non-Linear Programming (MINLP) approach. The MINLP is a combined discrete/continuous optimization technique, where discrete binary 0-1 variables are defined for optimization of discrete alternatives and continuous variables for optimization of parameters. The MINLP optimization to a structural synthesis is performed through thre...
The multiperiod blending problem involves binary variables and bilinear terms, yielding a nonconvex MINLP. In this work we present two major contributions for the global solution of the problem. The first one is an alternative formulation of the problem. This formulation makes use of redundant constraints that improve the MILP relaxation of the MINLP. The second contribution is an algorithm tha...
Optimization of Mixed-Integer Non-Linear Programming (MINLP) supports important decisions in applications such as Chemical Process Engineering. But current solvers have limited ability for deductive reasoning or the use of domain-specific theories, and the management of integrality constraints does not yet exploit automated reasoning tools such as SMT solvers. This seems to limit both scalabili...
Recently, the so-called ψ-learning approach, the Support Vector Machine (SVM) classifier obtained with the ramp loss, has attracted attention from the computational point of view. A Mixed Integer Nonlinear Programming (MINLP) formulation has been proposed for ψ-learning, but solving this MINLP formulation to optimality is only possible for datasets of small size. For datasets of more realistic ...
The analytical target cascading (ATC) methodology for optimizing hierarchical systems has demonstrated convergence properties for continuous, convex formulations. However, many practical problems involve both continuous and discrete design variables, resulting in mixed integer nonlinear programming (MINLP) formulations. While current ATC methods have been used to solve such MINLP formulations i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید