• Publications
  • Influence
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Expand
  • 764
  • 87
  • PDF
Simultaneous optimization models for heat integration—II. Heat exchanger network synthesis
Abstract In this paper, a mixed integer nonlinear programming (MINLP) model is presented which can generate networks where utility cost, exchanger areas and selection of matches are optimizedExpand
  • 752
  • 56
Systematic Methods of Chemical Process Design
1. Introduction to Process Design. I. PRELIMINARY ANALYSIS AND EVALUATION OF PROCESSES. 2. Overview of Flowsheet Synthesis. 3. Mass and Energy Balances. 4. Equipment Sizing and Costing. 5. EconomicExpand
  • 1,085
  • 52
Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques
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-Approximation, Generalized BendersExpand
  • 551
  • 28
  • PDF
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using either of the two methods. Expand
  • 390
  • 26
  • PDF
A combined penalty function and outer-approximation method for MINLP optimization
An improved outer-approximation algorithm for MINLP optimization has been recently proposed which is aimed at the solution of problems where convexity conditions may not hold. Expand
  • 634
  • 26
State-of-the-art review of optimization methods for short-term scheduling of batch processes
This paper provides an up-to-date review of the state-of-the-art in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. Expand
  • 676
  • 23
  • PDF
An LP/NLP based branch and bound algorithm for convex MINLP optimization problems
Abstract This paper is aimed at improving the solution efficiency of convex MINLP problems in which the bottleneck lies in the combinatorial search for the 0–1 variables. An LP/NLP based branch andExpand
  • 389
  • 23
Optimal process design under uncertainty
A rigorous mathematical formulation is presented for the problem of optimal design under uncertainty. This formulation involves a nonlinear infinite programming problem in which an optimization isExpand
  • 358
  • 22