نتایج جستجو برای: minlp

تعداد نتایج: 854  

Journal: :IBM Journal of Research and Development 2007
Jon Lee

We examine various aspects of modeling and solution via mixedinteger nonlinear programming (MINLP). MINLP has much to offer as a powerful modeling paradigm. Recently, significant advances have been made in MINLP solution software. To fully realize the power of MINLP to solve complex business optimization problems, we need to develop knowledge and expertise concerning MINLP modeling and solution...

2014
Ignacio E. Grossmann Francisco Trespalacios

This work presents a review of the applications of mixed-integer nonlinear programming (MINLP) in process systems engineering (PSE). A review on the main deterministic MINLP solution methods is presented, including an overview of the main MINLP solvers. Generalized disjunctive programming (GDP) is an alternative higher-level representation of MINLP problems. This work reviews some methods for s...

2011
Roohollah Aliakbari Shandiz Nezam Mahdavi-Amiri

We propose an exact penalty approach for solving mixed integer nonlinear programming (MINLP) problems by converting a general MINLP problem to a finite sequence of nonlinear programming (NLP) problems with only continuous variables. We express conditions of exactness for MINLP problems and show how the exact penalty approach can be extended to constrained problems.

2007
M. Ropotar Z. Kravanja

This contribution describes the development of various strategies for the dynamic optimization of a batch reactor in order to obtain a robust model, suitable for nonlinear (NLP) or mixed-integer nonlinear programming (MINLP) problems. Different Orthogonal Collocation on Finite Element (OCFE) schemes and various formulations of the MINLP model have been studied to increase its robustness. It has...

Journal: :Optimization Methods and Software 2009
Pietro Belotti Jon Lee Leo Liberti François Margot Andreas Wächter

Many industrial problems can be naturally formulated using Mixed Integer Nonlinear Programming (MINLP) models and can be solved by spatial Branch&Bound (sBB) techniques. We study the impact of two important parts of sBB methods: bounds tightening and branching strategies. We extend a branching technique originally developed for MILP, reliability branching, to the MINLP case. Motivated by the de...

2003
Michael R. Bussieck Armin Pruessner

Recently, the area of Mixed Integer Nonlinear Programming (MINLP) has experienced tremendous growth and a flourish of research activity. In this article we will give a brief overview of past developments in the MINLP arena and discuss some of the future work that can foster the development of MINLP in general and, in particular, robust solver technology for the practical solution of problems.

2016
Francisco Trespalacios FRANCISCO TRESPALACIOS

Many optimization problems require the modelling of discrete and continuous variables, giving rise to mixed-integer linear and mixed-integer nonlinear programming (MILP / MINLP). An alternative representation of MINLP is Generalized Disjunctive Programming (GDP)1. GDP models are represented through continuous and Boolean variables, and involve algebraic equations, disjunctions, and logic propos...

2011
Pierre Bonami Jon Lee Sven Leyffer Andreas Wächter

Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex Mixed-Integer Nonlinear Programming (MINLP) problems. It is well-known that carrying out branching in a non-simplistic manner can greatly enhance the practicality of B&B in the context of Mixed-Integer Linear Programming (MILP). No detailed study of branching has heretofore been carried out for MI...

2009
S. Kravanja

The paper presents the Mixed-Integer Non-Linear Programming (MINLP) approach to structural optimization. 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 is performed through three steps: i.e. the generation of a...

Journal: :Computers & Chemical Engineering 2015
Lijie Su Lixin Tang Ignacio E. Grossmann

Abstract: In order to improve the efficiency for solving MINLP problems, we present in this paper three computational strategies. These include multiple-generation cuts, hybrid methods and partial surrogate cuts for the Outer Approximation and Generalized Benders Decomposition. The properties and convergence of the strategies are analyzed. Five new MINLP algorithms are described based on the pr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید