The page uses Browser Access Keys to help with keyboard navigation. Click to learn moreSkip to Navigation

Different browsers use different keystrokes to activate accesskey shortcuts. Please reference the following list to use access keys on your system.

Alt and the accesskey, for Internet Explorer on Windows
Shift and Alt and the accesskey, for Firefox on Windows
Shift and Esc and the accesskey, for Windows or Mac
Ctrl and the accesskey, for the following browsers on a Mac: Internet Explorer 5.2, Safari 1.2, Firefox, Mozilla, Netscape 6+.

We use the following access keys on our gateway

n Skip to Navigation
k Accesskeys description
h Help
George Mason University
    George Mason University
   
 
 
 
2016-2017 University Catalog 
  
2016-2017 University Catalog

OR 640 - Global Optimization and Computational Intelligence

Credits: 3
Not Repeatable for Credit
Offered by Systems Engineering and Operations Research  
Introduction to global optimization of nonconvex mathematical programs and numerical methods for the solution of such problems. Topics covered include high-level survey of traditional mathematical programming algorithms; critical comparison of metaheuristics and artificial intelligence (AI) algorithms to traditional mathematical programming algorithms; probabilistic search, multistart methods, statistical tests of performance and confidence, simulated annealing, genetic algorithms, neural networks, Tabu search, homotopies and tunneling; the traveling salesman problem, the Steiner problem, Stackelberg-Cournot-Nash mathematical games and other classical nonconvex optimization problems.

Prerequisite(s): MATH 203 or equivalent, and knowledge of a scientific programming language.
Schedule Type: LEC
Hours of Lecture or Seminar per week: 3
Hours of Lab or Studio per week: 0