M esd Heuristic Search Techniques 16gg8 ESD.77 Main Motivation for heuristic Techniques (1)To deal with local optima and not get trapped in them (2 To allow optimization for systems, where the design variables are not only continuous, but discrete, integer or even boolean xER X;=1, 2, 3, 4, 5 ,X=A, B, C)X;true, false] These techniques do not guarantee that global optimum can be found. Generally Karush-Kuhn-Tucker conditions do not apply o Massachusetts Institute of Technology -Prof. de Weck and Prof Willcox Engineering Systems Division and Dept of Aeronautics and Astronautics2 © Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox Engineering Systems Division and Dept. of Aeronautics and Astronautics Heuristic Search Techniques Heuristic Search Techniques Main Motivation for Heuristic Techniques: (1) To deal with local optima and not get trapped in them (2) To allow optimization for systems, where the design variables are not only continuous, but discrete, integer or even Boolean These techniques do not guarantee that global optimum can be found. Generally Karush-Kuhn-Tucker conditions do not apply. i x ∉ \ xi ={1,2,3,4,5}, xi ={‘A’,’B’,’C’} xi ={true, false} x J