164 search results - page 1 / 33 » Stochastic MINLP optimization using simplicial approximation |
CCE
2007
13 years 5 months ago
2007
CCE
2004
13 years 5 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
SARA
2009
Springer
14 years 9 days ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
SIAMJO
2011
13 years 22 days ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
CCE
2004
13 years 5 months ago
2004
This paper presents a sequential two-stage strategy for the stochastic synthesis of chemical processes in which flexibility and ability to adjust manipulated variables are taken i...