This paper presents an overview of mixed-integer nonlinear programming techniques by first providing a unified treatment of the Branch and Bound, Outer-Approximation, Generalized …
IE Grossmann - Optimization and engineering, 2002 - Springer
This paper has as a major objective to present a unified overview and derivation of mixed- integer nonlinear programming (MINLP) techniques, Branch and Bound, Outer …
CS Adjiman, CA Schweiger, CA Floudas - Handbook of Combinatorial …, 1998 - Springer
The use of networks allows the representation of a variety of important engineering problems. The treatment of a particular class of network applications, the process synthesis …
This paper addresses two major issues related to the convergence of generalized Benders decomposition which is an algorithm for the solution of mixed integer linear and nonlinear …
The branch and bound principle has been established as an effective computational tool for solving linear integer programming problems. In the present dissertation the feasibility of …
Many optimization problems involve integer or discrete variables and can be modelled as Mixed Integer Nonlinear Programming problems (MINLPs). These variables can variously …
Filling a void in chemical engineering and optimization literature, this book presents the theory and methods for nonlinear and mixed-integer optimization, and their applications in …
P Kesavan, PI Barton - Computers & Chemical Engineering, 2000 - Elsevier
Branch and bound (BB) is the primary deterministic approach that has been applied successfully to solve mixed-integer nonlinear programming (MINLPs) problems in which the …
OK Gupta, A Ravindran - 1983 - asmedigitalcollection.asme.org
Branch and bound has been widely recognized as an effective method in solving linear integer programming problems. This paper presents a study on the feasibility of the branch …