OR 640 - Global Optimization and Computational Intelligence

Institution:

George Mason University

Subject:

Description:

Credits: 3 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. Prerequisites MATH 203 or equivalent, and knowledge of a scientific programming language. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.gmu.edu

Phone Number:

(703) 993-1000

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.