Search Results

MATH 670 Methods of Optimization I 3.0 Credits

Provides a rigorous treatment of theory and computational techniques in linear programming and its extensions, including formulation, duality theory, simplex and dual-simplex methods, and sensitivity analysis; network flow problems and algorithms; systems of inequalities, including exploiting special structure in the simplex method and use of matrix decompositions; and applications in game theory and integer programming.

College/Department: College of Arts and Sciences
Repeat Status: Not repeatable for credit

  • Schedule of Classes
  • All Course Descriptions
  • Co-op
  • Academic Advising
  • Admissions
  • Tuition & Fees