CS/ECE/ISyE 524 — Introduction to Optimization — Fall 2021
Course planning for the fastest graduation
Shawn Zhong (firstname.lastname@example.org), Evan Wang (email@example.com), Jun Lin (firstname.lastname@example.org)
(A) Issue being addressed in this project
We'd like to solve the course planning problem for the fastest graduation.
The constraints include:
Course dependencies: Some courses need to be taken to enroll in a specific course.
Credit limit: The total credit for a given semester cannot exceed a certain amount.
General requirements: A specific set of classes need to be taken to graduate.
Major requirements: A set of courses need to be taken in a specific major.
(B) What kind of data will you need, where will it come from, and how will you obtain it?
- Web scrapping from UW Madison course website
- Build a simulated data set based on information available on course website
(C) What is the optimization problem underlying this project? (LP, QP, SOCP, MIP, NLP, other?)
This problem should be solvable using an LP solver. If we have more complicated constraints, we can use a MIP solver.
(D) What will you deliver in terms of code, results, outcomes?
We will deliver our code and project report, which will include the results we obtain from different optimization methods.
(E) Other points to be considered.
We can also investigate how double-major affects graduation time.