01:711:295Introductory Topics in Operations Research (3) |
01:711:447Discrete Mathematical Models and Optimization (3) Basic concepts and tools of discrete mathematics for operations research, engineering, and the sciences. Major topics: graphs and algorithms, counting, Boolean functions, elements of discrete optimization. Prerequisites: 01:640:135-136 or 151-152, or permission of instructor. |
01:711:453Theory of Linear Optimization (3) Topics include convex sets, polyhedra, Farkas lemma, canonical forms, simplex algorithm, duality theory, revised simplex method, primal-dual methods, complementary slackness theorem, maximal flows, transportation problems, 2-person game theory. Prerequisite: 01:640:250. Credit not given for both this course and 01:640:354 or 453. |
01:711:465Integer Programming (3) Discrete optimization models, linear programming relaxations of integer programs, structured integer problems, enumerative methods, cutting planes, preprocessing techniques, nonlinear binary optimization. Prerequisites: 01:198:111; 01:640:354 or 01:711:453. |
01:711:481Case Studies in Applied Operations Research (3) Applications of operations research to real-life problems, typical operations research problems in business, industry, and government; model formulation and interpretation; determination of relevant parameters; formulation of mathematical programming models. Prerequisites: 01:640:354 or 01:711:453; 01:640:424; 01:711:465. |
01:711:495Advanced Topics in Operations Research (3) |
