1703.511 Operations Research I
(Prerequisites: an undergraduate course in linear algebra and an undergraduate course in multivariate calculus or permission of the instructor.)
This course is an introduction to mathematical modeling, analysis, and solution procedures applicable to decision-making problems in deterministic environment. Methodologies covered include the simplex and interior point methods of solving linear programming models, project planning, network optimization, assignment and transportation problems, dynamic programming and game theory.Solutions will be obtained using theoretical methods and software packages.
Students in this course will become familiar with the process of Operations Research: learning how to create and validate a mathematical model, as well as the processes and optimization/sub-optimization.They will learn how to determine solutions using linear and dynamic programming.They will also learn how to make an optimal set of assignments, based on a set of costs or demands.They will learn how to determine optimal shipping and inventory policies.Students will also learn how to determine optimal project scheduling plans and strategies in "games." All of the types of modeling covered in this course will be deterministic, that is, lacking any uncertainty.Reliance on the tools in the Calculus and Linear Algebra will be substantial, but we will also examine the reasons why these tools provide us with an optimal solution in each scenario.In addition, we will examine how multiple modeling procedures can be used to arrive at the same result, as well as the benefits and pitfalls of the different techniques.Furthermore, students will learn a procedure called sensitivity analysis, which is used to determine what types of changes are necessary for our optimal solution to become sub-optimal. Use of some of the leading software in the field, which is included in the text, will be required.