complete data is not available is a fundamental theoretical problem with a slew of applications, including the ad allocation and yield management problems above. Indeed, a simple linear program with one uniform knapsack constraint, the Secretary Problem, was one of the first online problems to be considered and an optimal solution was already obtained by the early 60’s [@Dynkin; @GilbertMosteller]. Although the single knapsack case is currently well-understood under different models of how information is revealed [@BabaioffSurvey], much less is known about problems with multiple knapsacks and only recently algorithms with solution guarantees have been developed [@feldman; @agrawal; @Devanur11].

[*The Model.*]{} We study online packing LP’s in the *random permutation model*. Consider a fixed but unknown LP with $n$ columns $a^1, a^2, \ldots, a^n \in [0,1]^m$, whose associated variables are constrained to be in $[0,1]$, and $m$ packing constraints: $$\begin{aligned}
        {\ensuremath{\textrm{OPT}}}= \max \sum_{t = 1}^n \pi_t x_t \notag \\
        \sum_{t = 1}^n a^t x_t \le B \label{eq:LP} \tag{LP}\\
        x_t \in [0,1] \,. \notag
    \end{aligned}$$ Columns are presented in uniformly random order, and when a column is presented we are required to irrevocably choose the value of its corresponding variable. We assume that the number of columns $n$ is known.[^1] The 