Introductory Topics in Operations Research (3)
Discrete 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, and elements of discrete optimization.
Prerequisites: 01:640:135-136 or 151-152, or permission of instructor.
Theory 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, and two-person game theory.
Prerequisite: 01:640:250. Credit not given for both this course and 01:640:354 or 453. Cross-listed with 01:640:453.
Integer Programming (3)
Discrete optimization models, linear programming relaxations of integer programs, structured integer problems, enumerative methods, cutting planes, preprocessing techniques, and nonlinear binary optimization.
Prerequisites: 01:198:111; and 01:640:354 or 01:711:453.
Case 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; and formulation of mathematical programming models.
Prerequisites: 01:640:354 or 01:711:453; 01:640:424; 01:711:465.