Before revision: We study two canonical online optimization problems under capacity/budget constraints , the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) with an infinitesimal assumption.
After revision: We study two canonical online optimization problems under capacity/budget constraints , the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) under an infinitesimal assumption.