Operations Research Major
This program prepares students for careers in industry or a variety of graduate and professional programs.
Prerequisite Grade Requirement
To enrol in a course offered by the Department of Mathematics, a student must obtain a grade of C- or better in each prerequisite course. Some courses may require higher prerequisite grades. Check the MATH courseβs Calendar description for details.
Students will not normally be permitted to enrol in any course for which a D grade or lower was obtained in any prerequisite. No student may complete, for further credit, any course offered by the Department of Mathematics which is a prerequisite for a course the student has already completed with a grade of C- or higher, without permission of the department.
Program Requirements
The program requires the completion of 120 units which includes a Faculty of Science requirement of a minimum of 28 upper division units, and additional upper division units to total a minimum of 44 upper division units (excluding EDUC 401, 407).
The specific program requirements are divided into three parts: required lower division courses, required upper division courses, and completion of an interdisciplinary requirement.
In addition to the program requirements set out below, general university and Faculty of Science regulations must be met.
Computing science courses that are completed in the operations research major program will count towards the requirement that 12 units must be completed from outside of the Faculty of Science.
A minimum program 2.00 cumulative grade point average (CGPA) must be obtained on the overall major program requirements, as well as a minimum program 2.00 grade point average in the upper division major courses.
Lower Division Requirements
Students complete a minimum total of 33 units, including either one of
A rigorous introduction to computing science and computer programming, suitable for students who already have substantial programming background. Topics include: fundamental algorithms and problem solving; abstract data types and elementary data structures; basic object-oriented programming and software design; elements of empirical and theoretical algorithmics; computation and computability; specification and program correctness; and history of computing science. Prerequisite: CMPT 120: Introduction to Computing Science and Programming I. Students with credit for CMPT 125, 128, 130, 135 or higher may not take CMPT 126 for further credit. Quantitative/Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 3:30β4:20 p.m.
|
Burnaby |
|
D101 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 10:30β11:20 a.m.
|
Burnaby |
D102 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 11:30 a.m.β12:20 p.m.
|
Burnaby |
D103 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 12:30β1:20 p.m.
|
Burnaby |
D104 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 1:30β2:20 p.m.
|
Burnaby |
D105 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 2:30β3:20 p.m.
|
Burnaby |
An introduction to computing science and computer programming, suitable for students wishing to major in Engineering Science or a related program. This course introduces basic computing science concepts, and fundamentals of object oriented programming. Topics include: fundamental algorithms and problem solving; abstract data types and elementary data structures; basic object-oriented programming and software design; elements of empirical and theoretical algorithmics; computation and computability; specification and program correctness; and history of computing science. The course will use a programming language commonly used in Engineering Science. Prerequisite: BC Math 12 (or equivalent, or any of MATH 100, 150, 151, 154, or 157). Students with credit for CMPT 125, 126, 130 or CMPT 200 or higher may not take for further credit. Quantitative/Breadth-Science.
or both of
An elementary introduction to computing science and computer programming, suitable for students with little or no programming background. Students will learn fundamental concepts and terminology of computing science, acquire elementary skills for programming in a high-level language and be exposed to diverse fields within, and applications of computing science. Topics will include: pseudocode, data types and control structures, fundamental algorithms, computability and complexity, computer architecture, and history of computing science. Treatment is informal and programming is presented as a problem-solving tool. Prerequisite: BC Math 12 or equivalent is recommended. Students with credit for CMPT 102, 125, 126, 128 or 130 may not take this course for further credit. Quantitative/Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Anne Lavergne |
Jan 5 β Apr 11, 2016: Tue, 2:30β4:20 p.m.
Jan 5 β Apr 11, 2016: Thu, 2:30β3:20 p.m. |
Burnaby Burnaby |
|
D101 |
Anne Lavergne |
Jan 5 β Apr 11, 2016: Wed, 11:30 a.m.β12:20 p.m.
|
Burnaby |
D102 |
Anne Lavergne |
Jan 5 β Apr 11, 2016: Wed, 11:30 a.m.β12:20 p.m.
|
Burnaby |
D103 |
Anne Lavergne |
Jan 5 β Apr 11, 2016: Wed, 12:30β1:20 p.m.
|
Burnaby |
D104 |
Anne Lavergne |
Jan 5 β Apr 11, 2016: Wed, 12:30β1:20 p.m.
|
Burnaby |
D105 |
Anne Lavergne |
Jan 5 β Apr 11, 2016: Wed, 1:30β2:20 p.m.
|
Burnaby |
D106 |
Anne Lavergne |
Jan 5 β Apr 11, 2016: Wed, 1:30β2:20 p.m.
|
Burnaby |
A rigorous introduction to computing science and computer programming, suitable for students who already have some background in computing science and programming. Intended for students who will major in computing science or a related program. Topics include: fundamental algorithms; elements of empirical and theoretical algorithmics; abstract data types and elementary data structures; basic object-oriented programming and software design; computation and computability; specification and program correctness; and history of computing science. Prerequisite: CMPT120. Co-requisite: CMPT127. Students with credit for CMPT 126, 135 or CMPT 200 or higher may not take for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Bobby Chan |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 3:30β4:20 p.m.
|
Burnaby |
or both of
An introduction to computing science and computer programming, using a systems oriented language, such as C or C++. This course introduces basic computing science concepts. Topics will include: elementary data types, control structures, functions, arrays and strings, fundamental algorithms, computer organization and memory management. Prerequisite: BC Math 12 (or equivalent, or any of MATH 100, 150, 151, 154, or 157). Students with credit for CMPT 102, 120, 126, or 128 may not take this course for further credit. Quantitative/Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Karol Swietlicki |
Jan 5 β Apr 11, 2016: Mon, Wed, 8:30β9:20 a.m.
Jan 5 β Apr 11, 2016: Fri, 8:30β9:20 a.m. |
Surrey Surrey |
|
D101 |
Karol Swietlicki |
Jan 5 β Apr 11, 2016: Wed, 9:30β10:20 a.m.
|
Surrey |
D102 |
Karol Swietlicki |
Jan 5 β Apr 11, 2016: Wed, 10:30β11:20 a.m.
|
Surrey |
D103 |
Karol Swietlicki |
Jan 5 β Apr 11, 2016: Wed, 11:30 a.m.β12:20 p.m.
|
Surrey |
A second course in systems-oriented programming and computing science that builds upon the foundation set in CMPT 130 using a systems-oriented language such as C or C++. Topics: a review of the basic elements of programming; introduction to object-oriented programming (OOP); techniques for designing and testing programs; use and implementation of elementary data structures and algorithms; introduction to embedded systems programming. Prerequisite: CMPT 130. Students with credit for CMPT 125 or 126 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Scott Kristjanson |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 10:30β11:20 a.m.
|
Surrey |
|
D101 |
Scott Kristjanson |
Jan 5 β Apr 11, 2016: Mon, 11:30 a.m.β12:20 p.m.
|
Surrey |
D102 |
Scott Kristjanson |
Jan 5 β Apr 11, 2016: Mon, 12:30β1:20 p.m.
|
Surrey |
D103 |
Scott Kristjanson |
Jan 5 β Apr 11, 2016: Mon, 1:30β2:20 p.m.
|
Surrey |
and all of
Introduction to a variety of practical and important data structures and methods for implementation and for experimental and analytical evaluation. Topics include: stacks, queues and lists; search trees; hash tables and algorithms; efficient sorting; object-oriented programming; time and space efficiency analysis; and experimental evaluation. Prerequisite: (MACM 101 and either (CMPT 125 and 127) or CMPT 135) or (ENSC 251 and ENSC 252). Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Geoffrey Tien |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 9:30β10:20 a.m.
|
Burnaby |
|
D101 |
Geoffrey Tien |
Jan 5 β Apr 11, 2016: Tue, 9:30β10:20 a.m.
|
Burnaby |
D102 |
Geoffrey Tien |
Jan 5 β Apr 11, 2016: Tue, 10:30β11:20 a.m.
|
Burnaby |
D103 |
Geoffrey Tien |
Jan 5 β Apr 11, 2016: Tue, 11:30 a.m.β12:20 p.m.
|
Burnaby |
D104 |
Geoffrey Tien |
Jan 5 β Apr 11, 2016: Tue, 12:30β1:20 p.m.
|
Burnaby |
D105 |
Geoffrey Tien |
Jan 5 β Apr 11, 2016: Wed, 10:30β11:20 a.m.
|
Burnaby |
D106 |
Geoffrey Tien |
Jan 5 β Apr 11, 2016: Wed, 11:30 a.m.β12:20 p.m.
|
Burnaby |
D107 |
Geoffrey Tien |
Jan 5 β Apr 11, 2016: Wed, 12:30β1:20 p.m.
|
Burnaby |
Introduction to counting, induction, automata theory, formal reasoning, modular arithmetic. Prerequisite: BC Math 12 (or equivalent), or any of MATH 100, 150, 151, 154, 157. Quantitative/Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Brad Bart |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 10:30β11:20 a.m.
|
Burnaby |
|
D101 |
Brad Bart |
Jan 5 β Apr 11, 2016: Tue, 1:30β2:20 p.m.
|
Burnaby |
D102 |
Brad Bart |
Jan 5 β Apr 11, 2016: Tue, 2:30β3:20 p.m.
|
Burnaby |
D103 |
Brad Bart |
Jan 5 β Apr 11, 2016: Tue, 3:30β4:20 p.m.
|
Burnaby |
D104 |
Brad Bart |
Jan 5 β Apr 11, 2016: Tue, 4:30β5:20 p.m.
|
Burnaby |
D105 |
Brad Bart |
Jan 5 β Apr 11, 2016: Wed, 2:30β3:20 p.m.
|
Burnaby |
D106 |
Brad Bart |
Jan 5 β Apr 11, 2016: Wed, 3:30β4:20 p.m.
|
Burnaby |
D107 |
Brad Bart |
Jan 5 β Apr 11, 2016: Wed, 4:30β5:20 p.m.
|
Burnaby |
Brad Bart |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 1:30β2:20 p.m.
|
Burnaby |
|
D201 |
Brad Bart |
Jan 5 β Apr 11, 2016: Thu, 9:30β10:20 a.m.
|
Burnaby |
D202 |
Brad Bart |
Jan 5 β Apr 11, 2016: Thu, 10:30β11:20 a.m.
|
Burnaby |
D203 |
Brad Bart |
Jan 5 β Apr 11, 2016: Thu, 1:30β2:20 p.m.
|
Burnaby |
D204 |
Brad Bart |
Jan 5 β Apr 11, 2016: Thu, 2:30β3:20 p.m.
|
Burnaby |
D205 |
Brad Bart |
Jan 5 β Apr 11, 2016: Thu, 3:30β4:20 p.m.
|
Burnaby |
D206 |
Brad Bart |
Jan 5 β Apr 11, 2016: Fri, 9:30β10:20 a.m.
|
Burnaby |
D207 |
Brad Bart |
Jan 5 β Apr 11, 2016: Fri, 10:30β11:20 a.m.
|
Burnaby |
Steve Pearce |
Jan 5 β Apr 11, 2016: Tue, 10:30β11:20 a.m.
Jan 5 β Apr 11, 2016: Thu, 9:30β11:20 a.m. |
Surrey Surrey |
|
D301 |
Steve Pearce |
Jan 5 β Apr 11, 2016: Wed, 2:30β3:20 p.m.
|
Surrey |
D302 |
Steve Pearce |
Jan 5 β Apr 11, 2016: Wed, 3:30β4:20 p.m.
|
Surrey |
D303 |
Steve Pearce |
Jan 5 β Apr 11, 2016: Wed, 4:30β5:20 p.m.
|
Surrey |
D304 |
Steve Pearce |
Jan 5 β Apr 11, 2016: Wed, 5:30β6:20 p.m.
|
Surrey |
A continuation of MACM 101. Topics covered include graph theory, trees, inclusion-exclusion, generating functions, recurrence relations, and optimization and matching. Prerequisite: MACM 101 or (ENSC 251 and one of MATH 232 or MATH 240). Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Karen Yeats |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 12:30β1:20 p.m.
|
Burnaby |
|
Abraham Punnen |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Surrey |
|
OPO1 | TBD | ||
OP02 | TBD |
Introduction to methods of operations research: linear and nonlinear programming, simulation, and heuristic methods. Applications to transportation, assignment, scheduling, and game theory. Exposure to mathematical models of industry and technology. Emphasis on computation for analysis and simulation. Prerequisite: MATH 150 or 151 or 154 or 157. Students with credit for MATH 208 may not take this course for further credit. Writing/Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Tamon Stephen |
Jan 5 β Apr 11, 2016: Mon, 2:30β4:20 p.m.
Jan 5 β Apr 11, 2016: Wed, 2:30β3:20 p.m. |
Surrey Surrey |
Rectangular, cylindrical and spherical coordinates. Vectors, lines, planes, cylinders, quadric surfaces. Vector functions, curves, motion in space. Differential and integral calculus of several variables. Vector fields, line integrals, fundamental theorem for line integrals, Green's theorem. Prerequisite: MATH 152; or MATH 155 or MATH 158 with a grade of at least B. Recommended: It is recommended that MATH 240 or 232 be taken before or concurrently with MATH 251. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Luis Goddyn |
Jan 5 β Apr 11, 2016: Mon, Wed, 4:30β5:50 p.m.
|
Burnaby |
|
OP01 | TBD |
Basic laws of probability, sample distributions. Introduction to statistical inference and applications. Corequisite: MATH 152 or 155 or 158. Students wishing an intuitive appreciation of a broad range of statistical strategies may wish to take STAT 100 first. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Distance Education | |||
Tim Swartz |
Jan 5 β Apr 11, 2016: Mon, Wed, 9:30β10:20 a.m.
Jan 5 β Apr 11, 2016: Fri, 9:30β10:20 a.m. |
Burnaby Burnaby |
|
Derek Bingham |
Jan 5 β Apr 11, 2016: Tue, 8:30β10:20 a.m.
Jan 5 β Apr 11, 2016: Thu, 8:30β9:20 a.m. |
Surrey Surrey |
|
OP01 | TBD | ||
OP09 | TBD |
This course is a continuation of STAT 270. Review of probability models, procedures for statistical inference from survey results and experimental data. Statistical model building. Elementary design of experiments and regression methods. Introduction to categorical data analysis. Prerequisite: STAT 270. Prerequisite or corequisite MATH 232 or MATH 240. This course may not be taken for credit by students who have credit for STAT 330 prior to Fall 2003. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Boxin Tang |
Jan 5 β Apr 11, 2016: Mon, 2:30β4:20 p.m.
Jan 5 β Apr 11, 2016: Wed, 2:30β3:20 p.m. |
Burnaby Burnaby |
|
D101 |
Boxin Tang |
Jan 5 β Apr 11, 2016: Mon, 8:30β9:20 a.m.
|
Burnaby |
D102 |
Boxin Tang |
Jan 5 β Apr 11, 2016: Mon, 9:30β10:20 a.m.
|
Burnaby |
D103 |
Boxin Tang |
Jan 5 β Apr 11, 2016: Wed, 1:30β2:20 p.m.
|
Burnaby |
and one of
Designed for students specializing in mathematics, physics, chemistry, computing science and engineering. Topics as for Math 151 with a more extensive review of functions, their properties and their graphs. Recommended for students with no previous knowledge of Calculus. In addition to regularly scheduled lectures, students enrolled in this course are encouraged to come for assistance to the Calculus Workshop (Burnaby), or Math Open Lab (Surrey). Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least B+, or MATH 100 with a grade of at least B-, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 151, 154 or 157 may not take MATH 150 for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Distance Education | |||
Justin Gray |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 8:30β9:20 a.m.
Jan 5 β Apr 11, 2016: Tue, 8:30β9:20 a.m. |
Burnaby Burnaby |
|
Jeremy Chiu |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
Jan 5 β Apr 11, 2016: Wed, 1:30β2:20 p.m. |
Surrey Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Designed for students specializing in mathematics, physics, chemistry, computing science and engineering. Logarithmic and exponential functions, trigonometric functions, inverse functions. Limits, continuity, and derivatives. Techniques of differentiation, including logarithmic and implicit differentiation. The Mean Value Theorem. Applications of differentiation including extrema, curve sketching, Newton's method. Introduction to modeling with differential equations. Polar coordinates, parametric curves. Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least A, or MATH 100 with a grade of at least B, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 154 or 157 may not take MATH 151 for further credit. Quantitative.
Designed for students specializing in the biological and medical sciences. Topics include: limits, growth rate and the derivative; elementary functions, optimization and approximation methods, and their applications; mathematical models of biological processes. Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least B, or MATH 100 with a grade of at least C, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 151 or 157 may not take MATH 154 for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Petr Lisonek |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
OP01 | TBD |
Designed for students specializing in business or the social sciences. Topics include: limits, growth rate and the derivative; logarithmic exponential and trigonometric functions and their application to business, economics, optimization and approximation methods; functions of several variables. Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least B, or MATH 100 with a grade of at least C, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 151 or 154 may not take MATH 157 for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Weiran Sun |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
Natalia Kouzniak |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 12:30β1:20 p.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
and one of
Riemann sum, Fundamental Theorem of Calculus, definite, indefinite and improper integrals, approximate integration, integration techniques, applications of integration. First-order separable differential equations and growth models. Sequences and series, series tests, power series, convergence and applications of power series. Prerequisite: MATH 150 or 151; or MATH 154 or 157 with a grade of at least B. Students with credit for MATH 155 or 158 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Brenda Davison |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
Veselin Jungic |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Designed for students specializing in the biological and medical sciences. Topics include: the integral, partial derivatives, differential equations, linear systems, and their applications; mathematical models of biological processes. Prerequisite: MATH 150, 151 or 154; or MATH 157 with a grade of at least B. Students with credit for MATH 152 or 158 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Luis Goddyn |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
Natalia Kouzniak |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 9:30β10:20 a.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Theory of integration and its applications; introduction to multivariable calculus with emphasis on partial derivatives and their applications; introduction to differential equations with emphasis on some special first-order equations and their applications to economics and social sciences; continuous probability models; sequences and series. Prerequisite: MATH 150 or 151 or 154 or 157. Students with credit for MATH 152 or 155 may not take MATH 158 for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Luis Goddyn |
Jan 5 β Apr 11, 2016: Mon, 4:30β5:20 p.m.
Jan 5 β Apr 11, 2016: Wed, 4:30β6:20 p.m. |
Burnaby Burnaby |
|
OP01 | TBD |
and one of
Linear equations, matrices, determinants. Introduction to vector spaces and linear transformations and bases. Complex numbers. Eigenvalues and eigenvectors; diagonalization. Inner products and orthogonality; least squares problems. An emphasis on applications involving matrix and vector calculations. Prerequisite: MATH 150 or 151; or MACM 101; or MATH 154 or 157, both with a grade of at least B. Students with credit for MATH 240 make not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Marni Julie Mishna |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
JF Williams |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 2:30β3:20 p.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Linear equations, matrices, determinants. Real and abstract vector spaces, subspaces and linear transformations; basis and change of basis. Complex numbers. Eigenvalues and eigenvectors; diagonalization. Inner products and orthogonality; least squares problems. Applications. Subject is presented with an abstract emphasis and includes proofs of the basic theorems. Prerequisite: MATH 150 or 151; or MACM 101; or MATH 154 or 157, both with a grade of at least B. Students with credit for MATH 232 cannot take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Michael Monagan |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
OPO1 | TBD |
* with a B grade or better
Upper Division Requirements
Students will complete a minimum of 31 units, including all of
Linear programming modelling. The simplex method and its variants. Duality theory. Post-optimality analysis. Applications and software. Additional topics may include: game theory, network simplex algorithm, and convex sets. Prerequisite: MATH 150, 151, 154, or 157 and MATH 240 or 232. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Ladislav Stacho |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 2:30β3:20 p.m.
|
Burnaby |
|
D101 |
Jan 5 β Apr 11, 2016: Thu, 9:30β10:20 a.m.
|
Burnaby |
|
D102 |
Jan 5 β Apr 11, 2016: Thu, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
D103 |
Jan 5 β Apr 11, 2016: Thu, 4:30β5:20 p.m.
|
Burnaby |
Inventory theory, Markov decision process and applications, queuing theory, forecasting models, decision Analysis and games, probabilistic dynamic programming, simulation modeling, project planning using PERT/CPM, sequencing and scheduling. Prerequisite: STAT 270. Pre-/Co-requisite: MATH 308. Quantitative.
Problems from operations research will be presented and discussed in class. Students will also work on a problem of their choice and present their solution in report form as well as a presentation. Prerequisite: MATH 308 and STAT 285. Writing/Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Tamon Stephen |
Jan 5 β Apr 11, 2016: Tue, Thu, 10:30 a.m.β12:20 p.m.
|
Surrey |
and four of
Model building using integer variables, computer solution, relaxations and lower bounds, heuristics and upper bounds, branch and bound algorithms, cutting plane algorithms, valid inequalities and facets, branch and cut algorithms, Lagrangian duality, column generation of algorithms, heuristics algorithms and analysis. Prerequisite: MATH 308. Quantitative.
Applications of network flow models; flow decomposition; polynomial algorithms for shortest paths, maximum flows and minimum costs flows; convex cost flows; generalized flows, multi-commodity flows. Prerequisite: MATH 308. Recommended: MATH 345. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Abraham Punnen |
Jan 5 β Apr 11, 2016: Mon, 2:30β4:20 p.m.
Jan 5 β Apr 11, 2016: Wed, 2:30β3:20 p.m. |
Surrey Surrey |
Theory and application of linear regression. Normal distribution theory. Hypothesis tests and confidence intervals. Model selection. Model diagnostics. Introduction to weighted least squares and generalized linear models. Prerequisite: STAT 285 and MATH 251. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Jiguo Cao |
Jan 5 β Apr 11, 2016: Mon, 10:30 a.m.β12:20 p.m.
Jan 5 β Apr 11, 2016: Wed, 10:30β11:20 a.m. |
Surrey Surrey |
|
D902 |
Jiguo Cao |
Jan 5 β Apr 11, 2016: Wed, 9:30β10:20 a.m.
|
Surrey |
Review of discrete and continuous probability models and relationships between them. Exploration of conditioning and conditional expectation. Markov chains. Random walks. Continuous time processes. Poisson process. Markov processes. Gaussian processes. Prerequisite: STAT 330,or all of: STAT 285,MATH 208, and MATH 251. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Richard Lockhart |
Jan 5 β Apr 11, 2016: Wed, 11:30 a.m.β12:20 p.m.
Jan 5 β Apr 11, 2016: Fri, 10:30 a.m.β12:20 p.m. |
Burnaby Burnaby |
|
D101 |
Richard Lockhart |
Jan 5 β Apr 11, 2016: Wed, 8:30β9:20 a.m.
|
Burnaby |
D102 |
Richard Lockhart |
Jan 5 β Apr 11, 2016: Wed, 9:30β10:20 a.m.
|
Burnaby |
D103 |
Richard Lockhart |
Jan 5 β Apr 11, 2016: Fri, 9:30β10:20 a.m.
|
Burnaby |
and at least two additional courses from Table I below
Quality of an estimator: unbiasedness, asymptotic unbiasedness, consistency, means squared error, uniform minimum variance. Confidence interval. Tests of hypotheses. Estimation for complete data. Estimation for grouped data. Estimation for modified data: Kaplan-Meier estimator, variances and confidence intervals of the empirical estimator, kernel density estimator. Parameter estimation. Variance of the estimators and confidence intervals. Model selection: graphical procedures, goodness-of-fit test, likelihood ratio test. Interpolation and smoothing. Covers part of the syllabus for Exam C of the Society of Actuaries and Exam 4 of the Casualty Actuarial Society. Prerequisite: ACMA 320. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Yi Lu |
Jan 5 β Apr 11, 2016: Tue, 11:30 a.m.β1:20 p.m.
Jan 5 β Apr 11, 2016: Thu, 11:30 a.m.β12:20 p.m. |
Burnaby Burnaby |
|
D101 |
Yi Lu |
Jan 5 β Apr 11, 2016: Wed, 3:30β4:20 p.m.
|
Burnaby |
Statistical computing in R and SAS. Data management: reading, editing and storing statistical data; querying databases with SQL. Data exploration and representation: summarizing data with tables, graphs and other statistical tools. Data simulation: model-based and empirical. The SAS component of the course will give students a good start for writing the SAS programming certification exams. Prerequisite: STAT 285 or STAT 302 or STAT 305 or equivalent. Quantitative.
Topics in areas of probability and statistics not covered in the regular undergraduate curriculum of the department. Prerequisite: dependent on the topic covered.
An introduction to the major sample survey designs and their mathematical justification. Associated statistical analyses. Prerequisite: STAT 350. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Steven Thompson |
Jan 5 β Apr 11, 2016: Mon, 4:30β6:20 p.m.
Jan 5 β Apr 11, 2016: Wed, 4:30β5:20 p.m. |
Burnaby Burnaby |
|
E101 |
Steven Thompson |
Jan 5 β Apr 11, 2016: Wed, 3:30β4:20 p.m.
|
Burnaby |
E102 |
Steven Thompson |
Jan 5 β Apr 11, 2016: Wed, 5:30β6:20 p.m.
|
Burnaby |
Introduction to standard methodology for analyzing categorical data including chi-squared tests for two- and multi-way contingency tables, logistic regression, and loglinear (Poisson) regression. Prerequisite: STAT 302 or STAT 305 or STAT 350. Students with credit for the former STAT 402 or 602 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Thomas Loughin |
Jan 5 β Apr 11, 2016: Mon, 12:30β2:20 p.m.
Jan 5 β Apr 11, 2016: Wed, 12:30β1:20 p.m. |
Burnaby Burnaby |
|
D102 |
Thomas Loughin |
Jan 5 β Apr 11, 2016: Mon, 9:30β10:20 a.m.
|
Burnaby |
D103 |
Thomas Loughin |
Jan 5 β Apr 11, 2016: Wed, 3:30β4:20 p.m.
|
Burnaby |
D104 |
Thomas Loughin |
Jan 5 β Apr 11, 2016: Wed, 4:30β5:20 p.m.
|
Burnaby |
D105 |
Thomas Loughin |
Jan 5 β Apr 11, 2016: Wed, 5:30β6:20 p.m.
|
Burnaby |
Introduction to linear time series analysis including moving average, autoregressive and ARIMA models, estimation, data analysis, forecasting errors and confidence intervals, conditional and unconditional models, and seasonal models. Prerequisite: STAT 285 or STAT 302 or STAT 305 or equivalent. This course may not be taken for further credit by students who have credit for ECON 484. Quantitative.
Topics in areas of probability and statistics not covered in the regular undergraduate curriculum of the department. Prerequisite: Dependent on the topic covered.
and at least one from Table II below
This course is an introduction to the modelling, analysis, and computer simulation of complex systems. Topics include analytic modelling, discrete event simulation, experimental design, random number generation, and statistical analysis. Prerequisite: CMPT 225, (MACM 101 or (ENSC 251 and ENSC 252)) and STAT 270.
Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms. Prerequisite: CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Pavol Hell |
Jan 5 β Apr 11, 2016: Tue, 2:30β4:20 p.m.
Jan 5 β Apr 11, 2016: Thu, 2:30β3:20 p.m. |
Burnaby Burnaby |
A presentation of the problems commonly arising in numerical analysis and scientific computing and the basic methods for their solutions. Prerequisite: MATH 152 or 155 or 158, and MATH 232 or 240, and computing experience. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Steven Ruuth |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 12:30β1:20 p.m.
|
Burnaby |
|
D101 |
Jan 5 β Apr 11, 2016: Tue, 9:30β10:20 a.m.
|
Burnaby |
|
D102 |
Jan 5 β Apr 11, 2016: Tue, 10:30β11:20 a.m.
|
Burnaby |
|
D103 |
Jan 5 β Apr 11, 2016: Tue, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
D104 |
Jan 5 β Apr 11, 2016: Thu, 9:30β10:20 a.m.
|
Burnaby |
|
D105 |
Jan 5 β Apr 11, 2016: Thu, 10:30β11:20 a.m.
|
Burnaby |
|
D106 |
Jan 5 β Apr 11, 2016: Thu, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
D107 |
Jan 5 β Apr 11, 2016: Tue, 4:30β5:20 p.m.
|
Burnaby |
Structures and algorithms, generating elementary combinatorial objects, counting (integer partitions, set partitions, Catalan families), backtracking algorithms, branch and bound, heuristic search algorithms. Prerequisite: MACM 201 (with a grade of at least B-). Recommended: knowledge of a programming language. Quantitative.
Fundamental concepts, trees and distances, matchings and factors, connectivity and paths, network flows, integral flows. Prerequisite: MACM 201 (with a grade of at least B-). Quantitative.
Graph coloring, Hamiltonian graphs, planar graphs, random graphs, Ramsey theory, extremal problems, additional topics. Prerequisite: MATH 345. Quantitative.
* students must meet the entry requirements for the actuarial science program to enrol in this course
β see ECON courses for prerequisites
Interdisciplinary Requirement
With advisor approval, students also complete at least 15 units from application areas with advisor approval. Application courses are chosen from ACMA, BUEC, BUS, ECON, MACM, MATH, REM and STAT courses. Courses used for Option A cannot be used to fulfil this requirement. If the operations research major is completed as part of a second bachelor's degree, then the interdisciplinary requirement may be waived if the previous degree contains an approved major. Approvals are given individually. Those majors that are approved will not be limited to the disciplines listed above.
Faculty of Science Degree Requirements
In addition to the above requirements, students must also satisfy Faculty of Science degree requirements to complete a minimum of 120 units including additional upper division units to total a minimum of 44 upper division units.
Writing, Quantitative, and Breadth Requirements
Students admitted to Ά‘ΟγΤ°AV beginning in the fall 2006 term must meet writing, quantitative and breadth requirements as part of any degree program they may undertake. See for university-wide information.
WQB Graduation Requirements
A grade of C- or better is required to earn W, Q or B credit
Requirement |
Units |
Notes | |
W - Writing |
6 |
Must include at least one upper division course, taken at Ά‘ΟγΤ°AV within the student’s major subject | |
Q - Quantitative |
6 |
Q courses may be lower or upper division | |
B - Breadth |
18 |
Designated Breadth | Must be outside the student’s major subject, and may be lower or upper division 6 units Social Sciences: B-Soc 6 units Humanities: B-Hum 6 units Sciences: B-Sci |
6 |
Additional Breadth | 6 units outside the student’s major subject (may or may not be B-designated courses, and will likely help fulfil individual degree program requirements) Students choosing to complete a joint major, joint honours, double major, two extended minors, an extended minor and a minor, or two minors may satisfy the breadth requirements (designated or not designated) with courses completed in either one or both program areas. |
Residency Requirements and Transfer Credit
The University’s residency requirement stipulates that, in most cases, total transfer and course challenge credit may not exceed 60 units, and may not include more than 15 units as upper division work.
Elective Courses
In addition to the courses listed above, students should consult an academic advisor to plan the remaining required elective courses.