Journal ArticleDOI
Modelling and computational techniques for logic based integer programming
R. Raman,Ignacio E. Grossmann +1 more
Reads0
Chats0
TLDR
In this article, the authors present a model for discrete optimization problems that relies on a logic representation in which mixed-integer logic is represented through disjunctions, and integer logic through propositions.About:
This article is published in Computers & Chemical Engineering.The article was published on 1994-07-01. It has received 503 citations till now. The article focuses on the topics: Logic optimization & Integer programming.read more
Citations
More filters
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Journal ArticleDOI
An algorithmic framework for convex mixed integer nonlinear programs
Pierre Bonami,Lorenz T. Biegler,Andrew R. Conn,Gérard Cornuéjols,Ignacio E. Grossmann,Carl D. Laird,Jon Lee,Andrea Lodi,François Margot,Nicolas Sawaya,Andreas Wächter +10 more
TL;DR: A class of hybrid algorithms, of which branch-and-bound and polyhedral outer approximation are the two extreme cases, are proposed and implemented and Computational results that demonstrate the effectiveness of this framework are reported.
Journal ArticleDOI
Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques
TL;DR: In this article, a unified overview and derivation of mixed-integer nonlinear programming (MINLP) techniques, such as Branch and Bound, Outer-Approximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems that are expressed in algebraic form is presented.
Journal ArticleDOI
Enterprise‐wide optimization: A new frontier in process systems engineering
TL;DR: In this article, the authors present a new emerging area that lies at the interface of chemical engineering and operations research, and has become a major goal in the process industries due to the increasing pressures for remaining competitive in the global marketplace.
Journal ArticleDOI
Global optimization for the synthesis of integrated water systems in chemical processes
TL;DR: A new deterministic spatial branch and contract algorithm is proposed for optimizing such systems, in which piecewise under- and over-estimators are used to approximate the non-convex terms in the original model to obtain a convex relaxation whose solution gives a lower bound on the global optimum.
References
More filters
Journal ArticleDOI
Partitioning procedures for solving mixed-variables programming problems
TL;DR: In this article, the 8th International Meeting of the Institute of Management Sciences, Brussels, August 23-26, 1961, the authors presented a paper entitled "The International Journal of Management Science and Management Sciences".
Journal ArticleDOI
A Computational Study of the Job-Shop Scheduling Problem
David Applegate,William J. Cook +1 more
TL;DR: The optimization procedure, combining the heuristic method and the combinatorial branch and bound algorithm, solved the well-known 10×10 problem of J. F. Thomson in under 7 minutes of computation time on a Sun Sparcstation 1.
Journal ArticleDOI
A lift-and-project cutting plane algorithm for mixed 0-1 programs
TL;DR: A cutting plane algorithm for mixed 0–1 programs based on a family of polyhedra which strengthen the usual LP relaxation and shows how to generate a facet of a polyhedron in this family which is most violated by the current fractional point.
Journal ArticleDOI
A combined penalty function and outer-approximation method for MINLP optimization
TL;DR: The results show that although no theoretical guarantee can be given, the proposed method has a high degree of reliability for finding the global optimum in nonconvex problems.
Journal ArticleDOI
Disjunctive programming and a hierarchy of relaxations for discrete optimization problems
TL;DR: A new conceptual framework for the convexification of discrete optimization problems, and a general technique for obtaining approximations to the conveX hull of the feasible set is discussed.