This paper presents a modelling framework for discrete optimization problems that relies on
a logic representation in which mixed-integer logic is represented through disjunctions, and …

Raman and Grossmann [Raman, R., & Grossmann, IE (1994). Modeling and computational
techniques for logic based integer programming. Computers and Chemical Engineering, 18 …

This paper deals with the branch and bound solution of synthesis problems that are
modeled as mixed-integer linear programming (MILP) problems. Logic relations between …

This monograph is based on a series of lectures given by the author at the first Advanced
Research Institute on Discrete Applied Mathematics, held at Rutgers University. It …

This paper discusses alternative methods for constructing a 0–1 integer programming
problem from a propositional calculus problem and the use of the resulting mathematical …

Extended mathematical programs are collections of functions and variables joined together
using specific optimization and complementarity primitives. This paper outlines a …

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 …

Discrete‐continuous optimization problems are commonly modeled in algebraic form as
mixed‐integer linear or nonlinear programming models. Since these models can be …

Discrete-continuous non-linear optimization models are frequently used to formulate
problems in process system engineering. Major modeling alternatives and solution …

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 …