Abstract
It is a common feature of many real-life design optimization problems that some design components can only be selected from a finite set of choices. Each choice corresponds to a possibly multidimensional design point representing the specifications of the chosen design component. In this paper we present a method to explore the resulting discrete search space for design optimization. We use the knowledge about the discrete space represented by its minimum spanning tree and find a splitting based on convex relaxation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters 33(1), 42–54 (2005)
Alexandrov, N., Hussaini, M.: Multidisciplinary design optimization: State of the art. In: Proceedings of the ICASE/NASA Langley Workshop on Multidisciplinary Design Optimization, Hampton, Virginia, USA (1997)
Floudas, C.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford (1995)
Fuchs, M., Girimonte, D., Izzo, D., Neumaier, A.: Robust and automated space system design. In: Robust Intelligent Systems, pp. 251–272. Springer, Heidelberg (2008)
Fuchs, M., Neumaier, A.: Autonomous robust design optimization with potential clouds. International Journal of Reliability and Safety 3(1/2/3), 23–34 (2009)
Fuchs, M., Neumaier, A.: A splitting technique for discrete search based on convex relaxation. Journal of Uncertain Systems, Special Issue on Global Optimization and Intelligent Algorithm (2009), accepted, preprint available on-line at: http://www.martin-fuchs.net/publications.php
Huyer, W., Neumaier, A.: Global optimization by multilevel coordinate search. Journal of Global Optimization 14(4), 331–355 (1999)
Huyer, W., Neumaier, A.: SNOBFIT – Stable Noisy Optimization by Branch and Fit. ACM Transactions on Mathematical Software 35(2), Article 9, 25 (2008)
Jones, D., Perttunen, C., Stuckman, B.: Lipschitzian optimization without the Lipschitz constant. Journal of Optimization Theory and Applications 79(1), 157–181 (1993)
Leyffer, S.: Deterministic methods for mixed integer nonlinear programming. Ph.D. thesis, University of Dundee, Department of Mathematics & Computer Science (1993)
Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. Wiley Interscience, Hoboken (1988)
Neumaier, A., Fuchs, M., Dolejsi, E., Csendes, T., Dombi, J., Banhelyi, B., Gera, Z.: Application of clouds for modeling uncertainties in robust space system design. ACT Ariadna Research ACT-RPT-05-5201, European Space Agency (2007)
Parker, R., Rardin, R.: Discrete optimization. Academic Press, London (1988)
Tawarmalani, M., Sahinidis, N.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Mathematical Programming 99(3), 563–591 (2004)
Weisstein, E.: Minimum spanning tree. MathWorld – A Wolfram Web Resource (2008), http://mathworld.wolfram.com/MinimumSpanningTree.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fuchs, M., Neumaier, A. (2010). Discrete Search in Design Optimization. In: Aiguier, M., Bretaudeau, F., Krob, D. (eds) Complex Systems Design & Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15654-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-15654-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15653-3
Online ISBN: 978-3-642-15654-0
eBook Packages: EngineeringEngineering (R0)