A Feasibility Pump for Mixed Integer Nonlinear Programs

We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within … Read more

Using Particle Swarm Optimization for Mixed Integer Non-linear Programming in Process Synthesis

Process synthesis problems can be mathematically represented as mixed-integer nonlinear programming (MINLP) models, which are often irregular, large and non-convex and difficult to get the overall optimum by traditional method. In this paper, a new method named particle swarm optimization (PSO) is used to solve MINLP problems. By introduced penalty function and used sigmoid function, … Read more

Solving large MINLPs on computational grids

We consider the solution of Mixed Integer Nonlinear Programming (MINLP) problems by a parallel implementation of nonlinear branch-and-bound on a computational grid or meta-computer. Computational experience on a set of large MINLPs is reported which indicates that this approach is efficient for the solution of large MINLPs. Citation Numerical Analysis Report NA/200, Department of Mathematics, … Read more

Integrating SQP and branch-and-bound for Mixed Integer Nonlinear Programming

This paper considers the solution of Mixed Integer Nonlinear Programming (MINLP) problems. Classical methods for the solution of MINLP problems decompose the problem by separating the nonlinear part from the integer part. This approach is largely due to the existence of packaged software for solving Nonlinear Programming (NLP) and Mixed Integer Linear Programming problems. In … Read more