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...

In this paper we propose a novel continuous time model based on state task network for the problem of scheduling m products in n continuous processing units with simultaneous arrival of liquid inputs and multiple intermediate upliftment dates. The units can process only one product line at a time and are buffered by fixed capacity storage tanks. An optimization model for the problem tries to ba...

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...

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.

This study develops a mixed integer nonlinear programming (MINLP) model to design supply chains. In view of the limitations of many available strategic supply chain design models, this model involves three major supply chain stages, including procurement, production, and distribution, and their interactions; it takes into account bill of materials constraints for modeling complex supply chain i...

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...

The optimal scheduling of crude-oil operations in refineries has been studied by various groups during the past decade leading to different mixed integer linear programming (MILP) or mixed integer nonlinear programming (MINLP) formulations. This paper presents a new continuous-time formulation, called single-operation sequencing (SOS) model, which can be used to solve the crude-oil operations p...

This contribution proposes a Mixed Integer Non Linear Programming (MINLP) formulation for optimal design of a catalytic distillation column based on a generic nonequilibrium model (NEQ). The solution strategy for the global optimization combines Simulated Annealing (SA) and Sequential Quadratic Programming (SQP) in order to minimize the objective function. The solution of this MINLP problem yie...

this paper presents a simple methodology for cost estimation of a near optimal heat exchanger network, which comprises mixed materials of construction. intraditional pinch technology and mathematical programming it is usually assumed that all heat exchangers in a network obey a single cost model. this implies that all heat exchangers  in a network are of the same type and use the same materials...

In this paper we address the development of an MINLP optimization model for the synthesis of paraxylene separation processes based on crystallization technology. A superstructure is proposed that considers different alternative designs and operating conditions for the recovery of a high purity paraxylene product from a feed stream containing other xylene isomers and ethylbenzene. The goal is to...