MATH 2200J Applications of Mathematics
This course includes topics in the theory of optimization. The topics include themaximization and/or minimization of univariate functions (using such methods asexhaustive search, interval search, random search, and Fibonacci search), and multivariate functions (using techniques such as the method of steepest descent). The linear programming problem is introduced and the simplex method is used for solving it. Topics are covered in the context of decision-making. (Previously NJCU Course MATH-220)