| |
Apr 19, 2024
|
|
|
|
|
IND 6120 - Operations Research3 lecture hours 0 lab hours 3 credits
Course Description
This course presents the principles and the practice of operations research and its role in decision-making. It focuses on mathematical programming techniques such as linear programming (the simplex method, concepts of duality and sensitivity analysis), integer programming (including transportation and assignment problems), decision theory, and network optimization models. (prereq: none)
Course Learning Outcomes
Upon successful completion of this course, the student will be able to:
- Formulate and solve linear programming models
- Identify, formulate, and solve transportation and assignment problems
- Develop and solve network models
- Understand decision theory and perform decision trees in solving business decision problems
- Identify and develop operational research models from the verbal description of the system; use appropriate software to solve these models and present both orally and in writing
Prerequisites by Topic
Course Topics
- Linear programming: examples, solving on a spreadsheet
- Linear programming (simplex method): algebraic form, tabular form, other model forms
- Simplex method: matrix form, fundamental insight, revised simplex method
- Duality, primal-dual relationships, sensitivity analysis
- Other algorithms for linear programming
- Transportation and assignment problems
- Integer programming
- Network optimization: shortest-path, minimum spanning tree, maximum flow, minimum cost
- Decision analysis
- Case studies (applications of LP in various sectors)
- Journal article review
- Other topics-nonlinear programming
Coordinator
Dr. Subha Kumpaty, Dr. Aaron Armstrong
Add to Portfolio (opens a new window)
|
|
Skip to Main Content
