 Fractional row bound for quadratic knapsack

Conditioning on selecting item $i$ leaves capacity $B-w_i$. Its fractional knapsack problem bounds that item's total interaction with the other selected items. Thus the ordered-pair quadratic objective is at most ${\sum }_i(v_i+q_i)x_i$. Remove overweight items before defining their residual-capacity problems.