Capacity planning under clinical trials uncertainty in continuous pharmaceutical manufacturing, 2: Solution method

Industrial and Engineering Chemistry Research

Volumn 51, Issue 42, 2012, Pages 13703-13711

  Sundaramoorthy, Arul ^a   Li, Xiang ^a,b   Evans, James M B ^a   Barton, Paul I ^a  

^a Massachusetts Institute of Technology Cambridge   (United States)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY VARIABLES; CAPACITY PLANNING; CLINICAL TRIAL; CONTINUOUS VARIABLES; CONVENTIONAL ALGORITHMS; DECOMPOSITION ALGORITHM; DECOMPOSITION STRATEGY; LARGE-SCALE PROBLEM; MIXED-INTEGER LINEAR PROGRAMMING; MODEL SIZE; MULTI-PERIOD; PHARMACEUTICAL MANUFACTURING; PROBLEM STRUCTURE; SCALABLE SOLUTION; SOLUTION METHODS; SOLUTION TIME;

EXPERIMENTS; MANUFACTURE;

ALGORITHMS;

EID: 84867832035     PISSN: 08885885     EISSN: 15205045     Source Type: Journal    
DOI: 10.1021/ie3003254     Document Type: Article

References (18)

1. Maravelias, C. T.; Grossmann, I. E. Simultaneous planning for new product development and batch manufacturing facilities Ind. Eng. Chem. Res. 2001, 40, 6147-6164
2. Levis, A. A.; Papageorgiou, L. G. A hierarchical solution approach for multi-site capacity planning under uncertainty in the pharmaceutical industry Comput. Chem. Eng. 2004, 28, 707-725
3. Birge, J. R.; Louveaux, F. Introduction to Stochastic Programming; Springer: New York, 1997.
4. Benders, J. F. Partitioning procedures for solving mixed-variables programming problems Numer. Math. 1962, 4, 238-252
5. Van Slyke, R. M.; Wets, R. L-shaped linear programs with applications to optimal control and stochastic programming SIAM J. Appl. Math. 1969, 17, 638-663
6. Fisher, M. L. The Lagrangian relaxation method for solving integer programming problems Manage. Sci. 1981, 27, 1-18
7. Geoffrion, A. M. Generalized Benders decomposition J. Opt. Theory Appl. 1972, 10, 237-260
8. Fisher, M. L. An applications oriented guide to Lagrangian relaxation Interfaces 1985, 15, 10-21
9. Karuppiah, R.; Grossmann, I. E. A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures J. Global Opt. 2008, 41, 163-186
10. Khajavirad, A.; Michalek, J. J. A deterministic Lagrangian-based global optimization approach for quasiseparable nonconvex mixed-integer nonlinear programs J. Mech. Des. 2009, 131, 051009-1-051009-8
11. Li, X.; Tomasgard, A.; Barton, P. I. Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs J. Opt. Theory Appl. 2011, 151, 425-454
12. Li, X.; Armagan, E.; Tomasgard, A.; Barton, P. I. Stochastic pooling problem for natural gas production network design and operation under uncertainty AIChE J. 2011, 57, 2120-2135
13. Li, X.; Tomasgard, A.; Barton, P. I. Decomposition strategy for the stochastic pooling problem. J. Global Opt. 2011, DOI: 10.1007/s10898-011-9792-0.
14. McCormick, G. P. Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems Math. Program. 1976, 10, 147-175
15. Scott, J. K.; Stuber, M. D.; Barton, P. I. Generalized McCormick relaxations J. Global Opt. 2011, 51, 569-606
16. Bertsekas, D. P. Nonlinear Programming, Second Edition; Athena Scientific: Cambridge, MA, 1999.
17. Balas, E.; Jeroslow, R. Canonical cuts on the unit hypercube SIAM J. Appl. Math. 1972, 23, 61-69
18. Kesavan, P.; Allgor, R. J.; Gatzke, E. P.; Barton, P. I. Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs Math. Prog., Ser. A 2004, 100, 517-535