Lagrangean decomposition using an improved Nelder-Mead approach for Lagrangean multiplier update

Computers and Chemical Engineering

Volumn 30, Issue 5, 2006, Pages 778-789

  Wu, Dan ^a   Ierapetritou, Marianthi ^a  

^a The State University of New Jersey   (United States)

Author keywords

Lagrangean decomposition; Nelder Mead algorithm; Scheduling; Uncertainty

Indexed keywords

ALGORITHMS; LARGE SCALE SYSTEMS; LSI CIRCUITS; OPTIMIZATION; PROBLEM SOLVING; UNCERTAIN SYSTEMS;

LAGRANGEAN DECOMPOSITION; NELDER-MEAD ALGORITHMS; OBJECTIVE FUNCTIONS; UNCERTAINTIES;

LAGRANGE MULTIPLIERS;

ALGORITHMS; LAGRANGE MULTIPLIERS; LARGE SCALE SYSTEMS; LSI CIRCUITS; OPTIMIZATION; PROBLEM SOLVING; UNCERTAIN SYSTEMS;

EID: 33645868996     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2005.12.008     Document Type: Article

References (32)

1. Bilde, and Krarup. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals Discrete Mathematics 1 (1977) 79-97
2. Benders J.F. Partitioning procedures for solving mixed variables programming problems. Numberische Mathematik 4 (1962) 238
3. Crowder H. Computational improvements for subgradient optimization. Symposia mathematica vol. XIX (1976), Academic Press, London
4. Dantzig G.B. Linear programming and extensions (1963), Princeton University Press, Princeton, NJ
5. Dantzig G.B. Linear programming under uncertainty. Management Science 1 (1955) 197-206
6. Diaby M., Bahl H.C., Karwan M.H., and Zionts S. A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Science 9 (1992) 1329
7. Equi L., Giorgio G., Maziale S., and Weintraub A. A combined transportation and scheduling problem. European Journal of Operational Research 97 (1997) 94
8. Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operational Research 26 1 (1978) 992-1009
9. Fisher M.L. Optimal solution of scheduling problems using lagrange multipliers: Part I. Operational Research 21 (1973) 1114-1127
10. Fisher M.L., and Hochbaum D.S. Database location in a computer network. Journal of ACM 27 (1980) 718-735
11. Fisher M.L. The Lagrangean relaxation method for solving integer programming problems. Management Science 27 (1981) 1
12. Fisher M.L., and Kedia P. Optimal solution of set sconvering/partitioning problems using dual heuristics. Management Science 39 (1990) 67-88
13. Geoffrion A.M. Lagrangean relaxation and its uses in integer programming. Mathematics Programming Studies 2 (1974) 82
14. Graves S.C. Using Lagrangean techniques to solve hierarchical production planning problems. Management Science 28 (1982) 260
15. Guignard M., and Kim S. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Program 39 (1987) 215-228
16. Guignard M., and Rosenwein M.B. An application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks 20 (1990) 345-359
17. Guignard M. Lagrangean relaxation: A short course. Belgian Journal of Operational Research 35 3-4 (1995) 95
18. Guignard M. Lagrangean relaxation. Top 11 2 (2003) 151-228
19. Gupta A., and Maranas C. A hierarchical Lagrangean relaxation procedure for solving midterm planning problems. Indian Engineering of Chemical Research 38 (1999) 1937-1947
20. Held M., and Karp R.M. The traveling salesman problem and minimum spanning trees. Operational Research 18 (1970) 1138-1162
21. Ierapetritou M.G., and Floudas C.A. Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes. Indian Engineering of Chemical Research 37 (1998) 4341
22. Kelley J.E. The cutting-plane method for solving convex programs. Journal of SIAM 8 (1960) 703-712
23. Kelley C.T. Iterative methods for optimization (1999), Society for Industrial and Applied Mathematics, Philadelhia
24. Lemarechal, C. (1974). An Algorithm for Minimizing Convex Functions. In Proceedings IFIP'74 Congress (pp. 552-556). North Holland.
25. Marin A., and Pelegrin B. The return plant location problem: Modeling and resolution. European Journal of Operational Research 104 (1998) 375
26. Nelder J.A., and Mead R. A Simplex method for function minimization. Computer Journal (1965) 308-313
27. Orero S.O., and Irving M.R. A combination of the genetic algorithm and Lagrangian relaxation decomposition techniques for the generation unit commitment problem. Electric Power System Research 43 (1997) 149-156
28. Polyak B.T. A general method of solving extremum problems. Soviet Mathematics Doklady 8 (1967) 593-597
29. Rana K., and Vickson R.G. Routing container ships using Lagrangean relaxation and decomposition. Transaction Science 25 3 (1991)
30. Thizy J.M., and Wassenhove L.N.V. Lagrangean relaxation for the multi-iterm capacitated lot-sizing problem: A heuristic implementation. IIE Transaction 17 (1985) 308
31. Wu D., and Ierapetritou M.G. Decomposition approaches for the efficient solution of the short-term scheduling problems. Computational Chemical Engineering 27 (2003) 1261-1276
32. Zowe, J. (1985). Nondifferentiable optimization. In K. Schittkowski, Computational Mathematical Program, NATO ASI Series F: Computer and Systems Science (vol. 15, pp. 323-356). Springer-Verlag.