Minmax regret linear resource allocation problems

For minmax regret versions of some basic resource allocation problems with linear cost functions and uncertain coefficients (interval-data case), we present efficient (polynomial and pseudopolynomial) algorithms. As a by-product, we obtain an O(nlogn) algorithm for the interval data minmax regret continuous knapsack problem.