MATH 441: Deterministic Optimization
Important: For the most up-to-date information, refer to the official George Mason Course Catalog
General Information
Credits: 3
Description:
Survey of deterministic methods for solving real-world decision problems. Programming model and simplex method of solution, duality and sensitivity analysis, transportation and assignment problems, shortest path and maximal flow problems, project networks including PERT and CPM, introduction to integer and nonlinear programming, dynamic programming, and game theory. Emphasizes modeling and problem solving. Offered by Mathematics. Limited to three attempts. Equivalent to OR 441.
Registration Restrictions:
Required Prerequisites: (MATH 203C, 203XS or 203T).
C Requires minimum grade of C.
XS Requires minimum grade of XS.
Schedule Type: Lecture
Grading:
This course is graded on the Undergraduate Regular scale.
This course is graded on the Undergraduate Regular scale.