In the warehouse problem, a merchant trading a commodity tries to find an optimal inventory-trading policy that decides on quantities of purchases and sales during a fixed time horizon in order to maximize their total profit, making use of fluctuations in sale and cost prices. We provide first known polynomial time algorithms for certain generalizations of the problem by analyzing the extreme points of the relevant feasible regions. This is joint work with Prof. Oktay Gunluk from Cornell University.