FIT5216 · Monash University
Modelling discrete optimisation problems
- Credit points
- 6
- Level
- 5
- Workload
- ≈ 12 h / week
- Faculty
- Information Technology
What it covers
This unit introduces the fundamentals of modelling for discrete optimisation, focusing on how to rigorously express a discrete optimisation problem in a manner that is can be solved. Topics covered will include decision variables, basic constraints, modelling with sets, modelling with functions, multiple modelling viewpoints, modelling time, common modelling patterns, model translation, and debugging discrete optimisation models. We will examine complex real world problems and see how they can be translated so that they can be solved by modern discrete optimisation technology.
Assessment
| Task | Type | Weight |
|---|---|---|
| Assignment 1 | Exercise | 5% |
| Assignment 2 | Project | 10% |
| Assignment 3 | Project | 20% |
| Scheduled final assessment (2 hours and 10 minutes) | Examination | 60% |
| Workshop participation | Exercise | 5% |
| Mid-semester testhurdle | Quiz / Test | 0% |
Hurdle tasks must be passed regardless of your overall mark.
When and where
| Teaching period | Campus | Mode |
|---|---|---|
| First semester | Clayton | On-campus |