General Maths Units 3 and 4

Matching and allocation problems (Updated 2024)

Flow, matching and scheduling problems

46:31 Lesson length
17 Chapters
Video thumbnail
Ready to watch the full lesson?

MaffsGuru members enjoy a full year of clear, classroom-style maths videos — plus notes, worksheets, and tools to help you learn and revise with confidence. One simple membership, one-off payment, and no auto-renewal.

Current chapter
Watch progress
0%
Playback speed
1.0×
Course
Flow, matching an…
About this lesson
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 (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

Video details
  • Title Matching and allocation problems (Updated 2024)
  • Section Flow, matching and scheduling problems
  • Course General Maths Units 3 and 4

I would be grateful if you can support my work by subscribing to my YouTube channel.

hungarian algorithm vce general maths general maths maximising using hungarian algorithm minimising using hungarian algorithm
Exam questions
Loading comments…
Chapter index
Select a line to jump to that point in the video.

Chapter navigation is available to members.