This course is intended to focus on understanding, formulating and solving deterministic models in operations research.
Maximum and Minimum Linear Programming problems will be studied graphically and theoretically. The Simplex Method, Sensitivity Analysis
and Duality will be covered and an in-depth analysis of the reasoning on which these topics are based will be given. Instruction in computer
software techniques will be presented to solve Linear Programming problems, using the simplex method and sensitivity analysis. Transportation
Problems, Integer Programming, or Markov Chains will be covered. In order to enhance quantitative reasoning, the course emphasizes the formulation
of mathematical models commonly used by operation research analysts, as well as the theoretical and computer software solutions to these models.
Prerequisite(s): MTH 130 or MTH 150 Credits: 3 (3,0)
Topics include: infinite series, first and second order differential equations and applications,
homogeneous and forced response, Laplace transforms, Taylor series, matrices, Gauss-Elimination method.
Prerequisite(s): MTH 236 Credits: 3 (3,0)
Students will be introduced to the foundations of real analysis through a
rigorous development of the real number system. This will be followed
by a study of limits, continuity, and differentiability of real functions. The
Riemann integral and the Fundamental Theorem of Calculus will be
developed rigorously. Sequences and series of real functions will also
be discussed. Prerequisite(s): MTH 252 and MTH 290 Credits: 3