Prerequisite(s): Approval by a faculty member who agrees to supervise the work. Independent work involving experiments, computer programming, analytical investigation, or engineering design.
A required course for undergraduate students majoring in OR:EMS. Focus on the management and consequences of technology-based innovation. Explores how new industries are created, how existing industries can be transformed by new technologies, the linkages between technological development and the creation of wealth and the management challenges of pursuing strategic innovation.
An introduction to combinatorial optimization, network flows and discrete algorithms. Shortest path problems, maximum flow problems. Matching problems, bipartite and cardinality nonbipartite. Introduction to discrete algorithms and complexity theory: NP-completeness and approximation algorithms.
Convex sets and functions, and operations preserving convexity. Convex optimization problems. Convex duality. Applications of convex optimization problems ranging from signal processing and information theory to revenue management. Convex optimization in Banach spaces. Algorithms for solving constrained convex optimization problems.
Continuation of IEOR E6711, covering further topics in stochastic modeling in the context of queueing, reliability, manufacturing, insurance risk, financial engineering, and other engineering applications. Topics from among generalized semi-Markov processes; processes with a non-discrete state space; point processes; stochastic comparisons; martingales; introduction to stochastic calculus.
Concentration of measure (variance bounds and Poincare inequalities, sub-Gaussian concentration and log-Sobolev inequalities, Lipschitz concentration and transportation inequalities) and Suprema (covering and chaining, Gaussian processes, empirical processes). Applications: statistical learning theory, compressed sensing, random matrices, sampling, optimal transport, Gaussian approximation.
Concentration of measure (variance bounds and Poincare inequalities, sub-Gaussian concentration and log-Sobolev inequalities, Lipschitz concentration and transportation inequalities) and Suprema (covering and chaining, Gaussian processes, empirical processes). Applications: statistical learning theory, compressed sensing, random matrices, sampling, optimal transport, Gaussian approximation.
Concentration of measure (variance bounds and Poincare inequalities, sub-Gaussian concentration and log-Sobolev inequalities, Lipschitz concentration and transportation inequalities) and Suprema (covering and chaining, Gaussian processes, empirical processes). Applications: statistical learning theory, compressed sensing, random matrices, sampling, optimal transport, Gaussian approximation.
Concentration of measure (variance bounds and Poincare inequalities, sub-Gaussian concentration and log-Sobolev inequalities, Lipschitz concentration and transportation inequalities) and Suprema (covering and chaining, Gaussian processes, empirical processes). Applications: statistical learning theory, compressed sensing, random matrices, sampling, optimal transport, Gaussian approximation.
Operations Strategy
Supply chain management, Model design of a supply chain network, inventories, stock systems, commonly used inventory models, supply contracts, value of information and information sharing, risk pooling, design for postponement, managing product variety, information technology and supply chain management; international and environmental issues.
Before registering, the student must submit an outline of the proposed work for approval by the supervisor and the chair of the Department. Advanced study in a specialized field under the supervision of a member of the department staff. May be repeated for credit.