21-257 Models and Methods for Optimization

9 units, Carnegie Mellon University

Introduces basic methods of operations research and is intended primarily for Business Administration and Economics majors. Review of linear systems linear programming, including the simplex algorithm, duality, and sensitivity analysis the transportation problem the critical path method the knapsack problem, traveling salesman problem, and an introduction to set covering models. Three 50 minute lectures, one 50 minute recitation

Prerequisites: 06-262 or 18-202 or 21-256 or 21-241 or 21-242 or 21-240

Courseweave needs JavaScript to show sections, workloads and planning tools.