Due to the time constraints place upon this project, not all of the features that were originally planned for were included.

Much time was wasted pursuing a linear approach. The classic "assignment problem" was created using a linear approach. With some coding supporting this, work was undertook to solve the solution in a linear fashion. After much coding and research, the expected 1000 applicants was not feasibly with a linear approach. In fact, testing 16 applicants took more than 10 minutes! A faster way was found, but much time and effort was put into this approach.

Because of the unique algorithm presented, and the span of time to work in, an exact ratio of 1 to 1 is needed. The number of applicants to fill the positions must be the same as the number of positions available in the total regions. The prototype is not able to increase/decrease the number of positions if the applicants and the positions do not match. Also, the prototype will issue a warning letting the user know that the applicants and positions do not match.