Mar 28, 2024  
2015-2016 Undergraduate Academic Catalog 
    
2015-2016 Undergraduate Academic Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

MA 343 - Linear Programming

3 lecture hours 0 lab hours 3 credits
Course Description
This course introduces the fundamentals of linear programming methods. Topics include the simplex method, duality and transportation problem. (prereq: MA 383  or MA 231 )
Course Learning Outcomes
Upon successful completion of this course, the student will be able to:
  • Use matrix methods to analyze and solve systems of linear equations
  • Grasp some of the basic ideas underlying linear programming
  • Solve linear programming problems in two variables using a geometric approach
  • Solve linear programming problems using the simplex method
  • Use the primal-dual approach

Prerequisites by Topic
  • College algebra including matrices and determinants

Course Topics
  • Review of matrices and determinants (2 classes)
  • Study and solution of simultaneous linear equations (2 classes)
  • Linear programming leading to the simplex method (5 classes)
  • Simplex method (4 classes)
  • Primal-dual problems (6 classes)
  • The transportation problem (2 classes)
  • Graphs and networks (1 class)
  • Critical path method (2 classes)
  • The maximal flow problem (2 classes)
  • Review and exams (4 classes)

Coordinator
Bruce O’Neill



Add to Portfolio (opens a new window)