Danielle A. Ripsman

Ph.D. in Management Science & Engineering
Operations Research | Healthcare Operations | Analytics & Optimization

Teaching Experience

MSCI 331: Introduction to Optimization (2023), Instructor
Sole instructor (options section): 112 upper-year undergraduates, 2 TAs, 7-10PM weekly classes + weekly tutorial. Student course perceptions: 4.29/5 average across the four instructor characteristics.

Teaching Assistant Experience

MSCI 251: Probability and Statistics for Engineers 1 (2019, 2020*, 2021, 2022*, 2023)
MSCI 734: Network Models (2023)
MSCI 703: Applied Optimization (2022)
MSCI 435: Advanced Optimization Techniques (2022)
MSCI 401 & 402: Capstone Design Project (2019)
Work Report Marking (2018)
MSCI 436: Decision Support Systems (2017)
MSCI 331: Introduction to Optimization (2017)

Distinctions

Sandford Fleming Foundation TA Award

In 2020 (denoted by a *), I was awarded the Sandford Fleming Foundation TA award for MSCI 251. My duties included adapting a weekly R programming lab (which I had originally prepared the curriculum for and taught live in 2019) to an online format, teaching, preparing instructions, videos, and grading. I was again given this award for the in-person 2022 year.

Teaching Materials

Title slide of Walking the Corners

Walking the Corners: The Simplex Method, Duality, and the Art of Choosing a Pivot

An interactive, undergraduate-level lecture made for the Optimal Lab at Johns Hopkins (2026). Starting from a small bakery problem, it builds the geometry of linear programming, derives the dual as a game of bounding the profit, works through the simplex tableau, lifts the problem into 3D, and races four pivot rules against each other, including on the Klee–Minty cube. It closes with a research question: can a policy learn to pick pivots?

Step through with the arrow keys or a clicker; press f for fullscreen.
Opening page of the revised simplex tutorial

The Revised Simplex Method and Its Pivot Rules

A self-paced, interactive tutorial (2026) on how the simplex method runs inside a real LP solver. It covers BTRAN, FTRAN, LU factorization and the one-column basis update, treats dual simplex as the mirror image of primal, and compares five pivot rules: Dantzig, greatest increment, Bland, Devex and steepest edge. Worked examples and step-through demos in 2D and 3D show exactly where the rules part ways.

Mentorship

During my time at the University of Waterloo, I had the privilege of mentoring undergraduate researchers on various optimization and healthcare projects.

Gatik Gola 2023

Project: worked on implementations for my proposed voxel sampling project

Karina Wilk 2023

Project: pushed forward the pipeline connecting our lab's optimization problems to our local cancer centre

William Kwong 2021-2022

Project: designed an interface for the seamless running of sampling protocols for fluence map optimization

Tiantian Li 2021

Project: looked into adapting existing, open-source radiation therapy tools to optimization software

Gogilan Selvarajah 2019

Project: worked on sliding window IMRT visualization

Jessie Yeung 2018

Project: worked on IMRT sliding window modeling