Operations Research and Financial Engineering

Studied is the transportation sector of the economy from a technology and policy planning perspective. The focus is on the methodologies and analytical tools that underpin policy formulation, capital and operations planning, and real-time operational decision making within the transportation industry. Case studies of innovative concepts such as dynamic "value pricing", real-time fleet management and control, GPS-based route guidance systems, automated transit networks and the emergence of Smart Driving / Autonomous Cars. Prerequisite: ORF 245 or permission of instructor. Two lectures, one precept.

A course covering one or more advanced topics in operations research and financial engineering. Subjects may vary from year to year.

A course covering one or more advanced topics in operations research and financial engineering. Subjects may vary from year to year.

A formal report on research involving analysis, synthesis, and design, directed toward improved understanding and resolution of a significant problem. The research is conducted under the supervision of a faculty member, and the thesis is defended by the student at a public examination before a faculty committee. The senior thesis is equivalent to a year-long study and is recorded as a double course in the Spring.

A one-semester project that fulfills the departmental independent work requirement for concentrators. Topics are chosen by students in consultation with members of the faculty. A written report is required at the end of the term.

Under the direction of a faculty member, Ph.D. and M.S.E. students carry out research, write a report each, and present the results. Of these, 509 is normally taken during the first year of study. Doctoral students should complete 510 one semester prior to taking the general examination.

Under the direction of a faculty member, Ph.D. and M.S.E. students carry out research, write a report each, and present the results. Of these, 509 is normally taken during the first year of study. Doctoral students should complete 510 one semester prior to taking the general examination.

Theoretical concepts underlying linear programming, with computer implementations of some of the different methods. The topics covered include duality theory, the simplex method, interior point methods, related numerical issues, and modeling paradigms.

Graduate introduction to probability theory beginning with a review of measure and integration. Topics include random variables, expectation, characteristic functions, law of large numbers, central limit theorem, conditioning, martin- gales, Markov chains, and Poisson processes.

This course is an introduction to deep learning theory. Using tools from mathematics (e.g. probability, functional analysis, spectral asymptotics and combinatorics) as well as physics (e.g. effective field theory, the 1/n expansion, and the renormalization group) we cover topics in approximation theory, optimization, and generalization.

An introduction to the microstructure of modern electronic financial markets and high frequency trading strategies. Topics include market structure and optimization techniques used by various market participants, tools for analyzing limit order books at high frequency, and stochastic dynamic optimization strategies for trading with minimal market impact at high and medium frequency. The course makes essential use of high-frequency futures data, accessed using the Kdb+ database language. Graduate credit requires completion of extended and more sophisticated homework assignments.

An introduction to nonasymptotic methods for the study of random structures in high dimension that arise in probability, statistics, computer science, and mathematics. Emphasis is on developing a common set of tools that has proved to be useful in different areas. Topics may include: concentration of measure; functional, transportation cost, martingale inequalities; isoperimetry; Markov semigroups, mixing times, random fields; hypercontractivity; thresholds and influences; Stein's method; suprema of random processes; Gaussian and Rademacher inequalities; generic chaining; entropy and combinatorial dimensions; selected applications.