In this project our team of four people solved a Integer Linear Programming Problem. We were tasked with solving a problem related to snow removal from Montreal. We had to decide how to create a plan to remove snow from 10 sections of the city into 5 disposal sites. Contraints included capacity and one section can only have one disposal site that it is transported to. The goal was to minimize the cost of the whole process. Cost was based on distance or travel, how much snow had to be removed, and the cost for removing one meter cubed of snow.
ichapman68/LinearProgrammingProject
In this project our team of four people solved a Mixed Integer Linear Programming Problem. We made up a scenario where a company had to transport fresh produce from 3 supplier locations to 8 destinations. We created the utilized a network flow approach to the problem. We used gurobi and python to optimize for the least cost based on time and capaci
Jupyter Notebook