Results 1 
9 of
9
Advances in Mathematical Programming for Automated Design Integration
 KOREAN J. CHEM. ENG
, 1999
"... This paper presents a review of advances that have taken place in the mathematical programming approach to process design and synthesis. A review is first presented on the algorithms that are available for solving MINLP problems, and its most recent variant, Generalized Disjunctive Programming model ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper presents a review of advances that have taken place in the mathematical programming approach to process design and synthesis. A review is first presented on the algorithms that are available for solving MINLP problems, and its most recent variant, Generalized Disjunctive Programming models. The formulation of superstructures, models and solution strategies is also discussed for the effective solution of the corresponding optimization problems. The rest of the paper is devoted to reviewing recent mathematical programming models for the synthesis of reactor networks, distillation sequences, heat exchanger networks, mass exchanger networks, utility plants, and total flowsheets. As will be seen from this review, the progress that has been achieved in this area over the last decade is very significant.
Optimization Framework for the Synthesis of Chemical Reactor Networks
, 1998
"... The reactor network synthesis problem involves determining the type, size, and interconnections of the reactor units, optimal concentration and temperature profiles, and the heat load requirements of the process. A general framework is presented for the synthesis of optimal chemical reactor networks ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The reactor network synthesis problem involves determining the type, size, and interconnections of the reactor units, optimal concentration and temperature profiles, and the heat load requirements of the process. A general framework is presented for the synthesis of optimal chemical reactor networks via an optimization approach. The possible design alternatives are represented via a process superstructure which includes continuous stirred tank reactors and cross flow reactors along with mixers and splitters that connect the units. The superstructure is mathematically modeled using differential and algebraic constraints and the resulting problem is formulated as an optimal control problem. The solution methodology for addressing the optimal control formulation involves the application of a control parameterization approach where the selected control variables are discretized in terms of time invariant parameters. The dynamic system is decoupled from the optimization and solved as a func...
ADVANCES IN MATHEMATICAL PROGRAMMING FOR THE SYNTHESIS OF PROCESS SYSTEMS
"... This paper presents a review of advances that have taken place in the mathematical programming approach to process design and synthesis. A review is first presented on the algorithms that are available for solving MINLP problems, and its most recent variant, Generalized Disjunctive Programming model ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper presents a review of advances that have taken place in the mathematical programming approach to process design and synthesis. A review is first presented on the algorithms that are available for solving MINLP problems, and its most recent variant, Generalized Disjunctive Programming models. The formulation of superstructures, models and solution strategies is also discussed for the effective solution of the corresponding optimization problems. The rest of the paper is devoted to reviewing recent mathematical programming models for the synthesis of reactor networks, distillation sequences, heat exchanger networks, mass exchanger networks, utility plants, and total flowsheets. As will be seen from this review, the progress that has been achieved in this area over the last decade is very significant. 1.
Linear Programming Formulations for Attainable
"... We propose several linear programming (LP) models for attainable region (AR) analysis by considering a rate vector field in concentration space with an arbitrarily large number of points. One model provides a method to construct candidate ARs using a fully connected network of CSTRs of arbitrary ..."
Abstract
 Add to MetaCart
We propose several linear programming (LP) models for attainable region (AR) analysis by considering a rate vector field in concentration space with an arbitrarily large number of points. One model provides a method to construct candidate ARs using a fully connected network of CSTRs of arbitrary volume.
Hybrid Reaction Modeling for TopDown . . .
, 2008
"... We propose a new modeling framework inspired by chemical reaction processes. Our approach consists in defining the processes and the interactions within the system in term of reactions. Such a definition can be applied to many systems, ranging from biochemical systems to swarm robotics. In particula ..."
Abstract
 Add to MetaCart
We propose a new modeling framework inspired by chemical reaction processes. Our approach consists in defining the processes and the interactions within the system in term of reactions. Such a definition can be applied to many systems, ranging from biochemical systems to swarm robotics. In particular, we aim at exploiting the toolbox developed in the context of hybrid system modeling and simulation. The concept of extended selfassembly is the following: given a set of passive building blocks A, B, C, and D, how to obtain, with a maximal yield, the products X, Y, and Z using a set of N active transporters? What is the smallest set of reactions leading to these products? More importantly, how shall we design the building blocks and their transporters in order to fit this set of reactions? The reaction set may also involve intermediate products and be influenced by external factors. We draw inspiration from the DNA
Latin American Applied Research 30:263284 (2000) ADVANCES IN MATHEMATICAL PROGRAMMING FOR THE SYNTHESIS OF PROCESS SYSTEMS
"... This paper presents a review of advances that have taken place in the mathematical programming approach to process design and synthesis. A review is first presented on the algorithms that are available for solving MINLP problems, and its most recent variant, Generalized Disjunctive Programming model ..."
Abstract
 Add to MetaCart
This paper presents a review of advances that have taken place in the mathematical programming approach to process design and synthesis. A review is first presented on the algorithms that are available for solving MINLP problems, and its most recent variant, Generalized Disjunctive Programming models. The formulation of superstructures, models and solution strategies is also discussed for the effective solution of the corresponding optimization problems. The rest of the paper is devoted to reviewing recent mathematical programming models for the synthesis of reactor networks, distillation sequences, heat exchanger networks, mass exchanger networks, utility plants, and total flowsheets. As will be seen from this review, the progress that has been achieved in this area over the last decade is very significant. 1.
and the Designated Emphasis in Computational and Genomic Biology
, 2010
"... Algebraic methods for biochemical reaction network theory by ..."
c ○ 2013 Society for Industrial and Applied Mathematics Thermodynamic Tree: The Space of Admissible Paths ∗
"... Abstract. Is a spontaneous transition from a state x to a state y allowed by thermodynamics? Such a question arises often in chemical thermodynamics and kinetics. We ask the following more formal question: Is there a continuous path between these states, along which the conservation laws hold, the c ..."
Abstract
 Add to MetaCart
Abstract. Is a spontaneous transition from a state x to a state y allowed by thermodynamics? Such a question arises often in chemical thermodynamics and kinetics. We ask the following more formal question: Is there a continuous path between these states, along which the conservation laws hold, the concentrations remain nonnegative, and the relevant thermodynamic potential G (Gibbs energy, for example) monotonically decreases? The obvious necessary condition, G(x) ≥ G(y), is not sufficient, and we construct the necessary and sufficient conditions. For example, it is impossible to overstep the equilibrium in 1dimensional (1D) systems (with n components and n−1 conservation laws). The system cannot come from a state x to a state y if they are on the opposite sides of the equilibrium even if G(x)>G(y). We find the general multidimensional analogue of this 1D rule and constructively solve the problem of the thermodynamically admissible transitions. We study dynamical systems, which are given in a positively invariant convex polyhedron D and have a convex Lyapunov function G. An admissible path is a continuous curve in D along which G does not increase. For x, y ∈ D, x � y (x precedes y) if there exists an admissible path from x to y and x ∼ y if x � y and y � x. ThetreeofG in D is a quotient space D / ∼. We provide an algorithm for the construction of this tree. In this algorithm, the restriction of G onto the 1skeleton of D (the union of edges) is used. The problem of existence of admissible paths between states is solved constructively. The regions attainable by the admissible paths are described.