Assignment
COMP 5413 (Optimization Methods)
Spring 2021
Due Date: 12th June 2021
Total Marks: 25*3 = 75
Instructions
In every question, an example has presented in order you to understand the question not for your
reference to verify. You may need to generate different data dimensions randomly to prove that
your system results in optimal solution.
Submission Guidelines
1. One PDF file: It should contain the mathematical model (ILP or LP) for all three questions.
2. Three Python notebook files: Each one should contain Gurobi implementation of each model
that you have designed for each question. Please comment each code block demonstrating its
function.
3. Text Readme File. Assume that the user who will run your program does not have much idea
about the code.
4. Compress files all files mentioned in steps 1-3 and submit the Zip file.
Q1. In a cloud network, D1, D2, D3…., Dn amount of data generates from its N1, N2, N3…., Nn,
nodes respectively. All the data is temporarily stored in a buffer located BL1 and BL2. To keep a
geographical redundancy for a potential system failure, the generated data must store in the cloud
data warehouse located in WL1, WL2, WL3, WL4. Note that the data could be copied from the
buffer location as many times as required. However, sending data from all the buffer locations to
all the data warehouses is accompanied by a different bandwidth threshold and operating costs that
needs to be paid to the third-party internet service providers. As a system engineer, you need to
minimize the time it requires to replicate a copy of all data in every data warehouse location. You
need to model and write code to solve this problem. You also need to document it well for future
reference.
Example,
Node Generated Data
N1 10 mb
N2 20 mb
Buffer Warehouse Bandwidth threshold (mbps) Service providers Cost/mbps
Location Location
WL1 50 2
BL1
WL2 40 3
WL3 50 4
WL1 40 5
BL2 WL2 60 6
WL3 40 2
Example Solution (Optimal): 16500
Q2. A reputed company wants to promote its newly launched product, so they hired a team of a
surveyor to prepare a report for k possible locations. The objective is to reach as many young
people as possible with optimal cost. The survey report shows the number of people, and among
them how many are young in each location. The report also represents the cost involves in
arranging an Adhoc one-day marketing campaign for each location. Therefore, marketing manager
of the company asks you to write a program to select k/3 locations so that it could limit the
operating cost and increase the number of young people. Please assume that k is a multiple of
three. You need to model and write code to solve this problem. You also need to document it well
for future reference.
Example:
Assume k=6
Operating cost threshold = 50
Location Population Young People Campaign Cost
L1 100 50 20
L2 200 100 30
L3 150 75 40
L4 160 80 20
L5 170 85 20
L6 170 90 30
Clearly selecting L2 and L5 is the optimal solution. However, in the real world, the dataset that
you will be dealing with might not be that small.
Q3. In a city, the COVID19 vaccination is controlled by the central city hospital. There are nf , nm,
na, and ng number of types Vf, Vm, Va, and Vg vaccines available in the hospital, respectively. The
hospital authority requested everyone in the city to provide their list of choice within one week
through the hospital's online portal. Those who failed to submit any choice list will be given the
type of vaccine randomly. Please note that the number of all vaccines available is equal to the
number of people in the city, and everyone is required to get vaccinated. The hospital authority
asks you to write a program that could maximize the overall satisfaction of the people. You need
to model and write code to solve this problem. You also need to document it well for future
reference.
Example:
Assuming number of vaccines available nf =1 , nm=1, na=1, and ng=1
Personal ID 1st Choice 2nd Choice 3rd Choice 4th Choice
1 Vf Va Vg Vm
2 Vm Vf Vg Va
3 Va Vm Vf Vg
4 Vm Va Vf Vg
Optimal Solution:
Personal ID Optimal Selection
1 Vg
2 Vm
3 Va
4 Vf
