Flow, matching and scheduling problems
General Maths Units 3 and 4 (2023+)
Sorry!
This video is for subscribers only.
To view this video please support me by purchasing a (very cheap!) years access.
Videos in this series
Please select a video from the same chapter
Want to skip to the best bits?
Gain access to chapters by taking out a (very reasonable and cheap!) one year plan
This is an update to the video which is formally titles Matching and Allocation Problems in the General Mathematics course from Cambridge but which I think would be better served being called Hungarian algorithm for minimising AND maximising with CAS.
I have been asked so many times if I know a way to use the Hungarian Algorithm to find the maximum and so yes! In this video I show how. Want to know how to use the UDF for the Hungarian Algorithm with the Ti-nSpire? This video shows you how.
Want to see lots of VCAA questions and how they might trip you up with this content? Well, this is the video for you.
LEGAL STUFF (VCAA)
VCE Maths exam question content used by permission, ©VCAA. The VCAA is not affiliated with, and does not endorse, this video resource. VCE® is a registered trademark of the VCAA. Past VCE exams and related content can be accessed at www.vcaa.vic.edu.au
There are no current errors with this video ... phew!
Lesson notes for this video are for subscribers only. Sorry! To gain access, please consider supporting me by taking out a (very reasonable and cheap!) one year plan by [clicking here]
Video tags
hungarian algorithm
vce general maths
general maths
maximising using hungarian algorithm
minimising using hungarian algorithm