In this assignment, you will solve the online allocation problemthat you have seen in class by using duality. The problem is thefollowing:
· There are m resources, x1 , …, xm with fixedcapacities b1, …, bm
Demand requests arrive sequentially, noted j = 1…N, withrequirements ai, i=1…m and profit p
We want to make accept/reject decisions without knowing futuredemands
We have the historical data of N demands in the file“demand.csv”:
Part A:
In this question, you will formulate the problem as a linearprogram. To do so, you will transform the LP to standard form:
max cTx
Ax <= b
x >= 0
while cT represents the profit of accepting each demand,
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured