نتایج جستجو برای: grossmann algorithm

تعداد نتایج: 754213  

2004
P. K. Polisetty E. P. Gatzke

This paper presents a parallel algorithm for obtaining global solutions to general mathematical programming problems with nonconvex constraints involving continuous variables. The proposed algorithm implements an optimization based bound tightening technique (Smith [1996], Ryoo and Sahinidis [1995], Adjiman et al. [2000]) in parallel on the root node of the branch-and-bound tree structure. Upon...

Journal: :Kōtare : New Zealand Notes & Queries 2009

2015
Z Kravanja Ignacio E. Grossmann IGNACIO E. GROSSMANN

This paper describes an improved, user friendly version of the computer package PROSYN a mixed-integer nonlinear programming (MINLP) process synthesizer. PROSYN is an implementation of the modeling and decomposition (M/D) strategy by Kocis and Grossmann (1989) and the outer approximation and equality relaxation algorithm (OA/ER) by Kocis and Grossmann (1987). Main characteristic of the new vers...

Journal: :Archivum histologicum japonicum 1960

Journal: :Kōtare : New Zealand Notes & Queries 2011

Journal: :J. Global Optimization 2013
Scott P. Kolodziej Pedro M. Castro Ignacio E. Grossmann

In this paper, we present the derivation of the multiparametric disaggregation technique by Teles et. al (2001) for solving nonconvex bilinear programs. Both upper and lower bounding formulations corresponding to mixed-integer linear programs are derived using disjunctive programming and exact linearizations, and incorporated into two global optimization algorithms that are used to solve biline...

1998
Dorit S. Hochbaum Walter A. Haas Anna Chen

The open-pit mining problem is to determine the contours of a mine, based on economic data and engineering feasibility requirements in order to yield maximumpossible net income. This practical problem needs to be solved for very large data sets. In practice, moreover, it is necessary to test multiple scenarios taking into account a variety of realizations of geological predictions and forecasts...

2015
J Viswanathan Ignacio E. Grossmann J. Viswanathan

An improved outer-approximation algorithm for MINLP optimization is proposed in this paper which is aimed at the solution of problems where convexity conditions may not hold. The proposed algorithm starts by solving the NLP relaxation. If an integer solution is not found, a sequence of iterations consisting of NLP subproblems and MILP master problems is solved. The proposed MILP master problem ...

2014
MARY M. GROSSMANN ALLEN G. COLLINS DHUGAL J. LINDSAY

MARY M. GROSSMANN, ALLEN G. COLLINS & DHUGAL J. LINDSAY Yokohama City University, 236-0027 Yokohama, Japan Okinawa Institute of Marine Science and Technology (OIST), 904-0495 Onna, Okinawa, Japan National Systematics Laboratory, National Museum of Natural History, MRC-153, Smithsonian Institution, P.O. Box 37012, Washington, DC 20013-7012, USA Japan Agency for Marine–Earth Science and Technolog...

2006
Mohammad Amanullah Cristian Grossmann Marco Mazzotti Manfred Morari Massimo Morbidelli

Moving Bed (SMB) processes Mohammad Amanullah, Cristian Grossmann, , Marco Mazzotti*, Manfred Morari, Massimo Morbidelli 1 Institute of Process Engineering, ETH Zurich, CH-8092 Zurich, Switzerland Automatic Control Laboratory, ETH Zurich, CH-8092 Zurich, Switzerland 3 Institute for Chemical and Bio-Engineering, ETH Zurich, CH-8093, Switzerland * Corresponding author: [email protected]...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید