Information and Decision Sciences

IDS 435 Optimization Models and Methods

Credit hours 3 - Undergraduate 4-Graduate
Catalog description Liner, nonlinear, dynamic programming, combinatorial methods. Use of spreadsheet and other software tools. Duality, sensitivity analysis. Models for business operationss and planning, computer systems, transportation, finance.
Key topics
  • Introduction to Operations Research
  • Introduction to linear programming
  • Simplex Algorithm
  • Duality theory
  • Complications to linear programming:
  • Infinite solutions, degeneracy, negativity
  • Sensitivity analysis
  • Parametric programming, convex programming
  • Dual simplex method
  • Goal programming
  • Transportation model
  • Solution techniques, degeneracy, relationship to linear programming
  • Assignment model
  • Relationship to transportation model
  • Interior Point Method
Prerequisites for this course IDS 355 and MATH 205
Course(s) for which this is a prerequisite IDS 436
Required course for None
Elective course for Selective course for IDS Majors
Frequency of offering Fall and Spring
Recent offerings, instructors, syllabi Fall 2004 Lee
Planned offerings Fall 2005
Cross-listings
Archived Syllabi
Comments None