Abstract
Optimisation studies are frequently embedded within the goals of a modelling and simulation project. In some cases this optimisation aspect may simply be a preliminary requirement in the development of the model that is to be subsequently used in the simulation study. In other cases it may constitute the main aspect of the project goals. We refer to these two alternatives as the model refinement problem and the strategy formulation problem, respectively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
9.1. Beale, E.M.L., (1972), A derivation of conjugate gradients, in F.A. Lottsma (Ed.), Numerical Methods for Non-Linear Optimization, Academic Press, London, pp. 39–43.
9.2. Al-Baali, (1985), Descent property and global convergence of the Fletcher-Reeves method with inexact line search, IMA Journal on Numerical Analysis, 5: 121–124.
9.3. Bertsekas, D.P., (1996), Constrained Optimization and Lagrange Multiplier Methods, Athena Scientific, Nashua, NH.
9.4. Bhatnager, S. and Kowshik, H.J., (2005), A discrete parameter stochastic approximation algorithm for simulation optimization, Simulation, 81(11).
9.5. Bonnans, J.F., Gilbert, J.C., Lemaréchal, C., and Sagastizabal, C.A., (2003), Numerical Optimization: Theoretical and Practical Aspects, Springer-Verlag, Berlin.
9.6. Cormen, T.H., Leisserson, C.E., and Rivest, R.L., (1990), Introduction to Algorithms, MIT Press, Cambridge, MA.
9.7. Fletcher, R. and Reeves, C.M., (1964), Function minimization by conjugate gradients, Computer Journal, 7: 149–154.
9.8. Fletcher, R., (1987), Practical Methods of Optimization, 2nd edn., John Wiley, New York.
9.9. Gilbert, J. and Nocedal, J., (1992), Global convergence properties of conjugate gradient methods for optimization, SIAM Journal on Optimization, 2: 21–42.
9.10. Heath, M.T., (2000), Scientific Computing, An Introductory Survey, 2nd edn., McGraw-Hill, New York.
9.11. Lagarias, J.C., Reeds, J.A., Wright, M.H., and Wright, P.E., (1998), Convergence properties of the Nelder-Mead simplex method in low dimensions, SIAM Journal of Optimization, 9: 112–147.
9.12. Law, A.M. and Kelton, D.W., (2000), Simulation Modeling and Analysis, (3rd edn.), McGraw-Hill, New York.
9.13. Lewis, F.L. and Syrmos, V.L., (1995), Optimal Control, 2nd edn., John Wiley and Sons, New York.
9.14. Nelder, J. and Mead, R., (1965), A simplex method for function minimization, Computer Journal, 7: 308–313.
9.15. Nocedal, J. and Wright, S.J., (1999), Numerical Optimization, Springer-Verlag, New York.
9.16. Olafason, S. and Kim, J. (2002), Simulation optimization, in Proceedings of the 2002 Winter Simulation Conference, pp. 79–84.
9.17. Oretega, J.M. and Rheinboldt, W.C., (1970), Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York.
9.18. Pedregal, P., (2004), Introduction to Optimization, Springer-Verlag, New York.
9.19. Pinter, Janos D., Linder, David and Chin, Paulina (2006), Global Optimization toolbox for maple: an introduction with illustrative applications, Optimization Methods and Software, vol 21(4), pp. 565–582.
9.20. Polack, E. and Ribière, G., (1969), Note sur la Convergence de Méthodes de Directions Conjuguées, Revue Française d'Informatique et de Recherche Opérationnelle, 16: 35–43.
9.21. Powell, M.J.D., (1978), Restart procedures for the conjugate gradient method, Mathematical Progress, 12: 241–254.
9.22. Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P., (1999), Numerical Recipes in C, The Art of Scientific Computing, 2nd edn., Cambridge University Press, Cambridge, UK.
9.23. Rubinstein, R. and Shapiro, A., (1993), Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method, John Wiley, New York.
9.24. Rykov, A., (1983), Simplex algorithms for unconstrained optimization, Problems of Control and Information Theory, 12: 195–208.
9.25. Sorenson, H.W., (1969), Comparison of Some Conjugate Directions Procedures for Function Minimization, J Franklin Institute, vol. 288, pp. 421–441.
9.26. Seierstad, A. and Sydstaeter, K., (1987), Optimal Control Theory with Economic Applications, North Holland, Amsterdam.
9.27. Wolfe, P., (1969), Convergence conditions for ascent methods, SIAM Review, 11: 226–235.
9.28. Zabinsky, Z.B., (2003), Stochastic Adaptive Search for Global Optimization, Kluwer Academic, Dordrecht.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Birta, L.G., Arbez, G. (2007). Optimisation. In: Modelling and Simulation. Springer, London. https://doi.org/10.1007/978-1-84628-622-3_9
Download citation
DOI: https://doi.org/10.1007/978-1-84628-622-3_9
Publisher Name: Springer, London
Print ISBN: 978-1-84628-621-6
Online ISBN: 978-1-84628-622-3
eBook Packages: Computer ScienceComputer Science (R0)