On rates of convergence and asymptotic normality in the multiknapsack problem

On rates of convergence and asymptotic normality in the multiknapsack problem

0.00 Avg rating0 Votes
Article ID: iaor1993323
Country: Netherlands
Volume: 51
Issue: 3
Start Page Number: 349
End Page Number: 358
Publication Date: Oct 1991
Journal: Mathematical Programming (Series A)
Authors: ,
Keywords: programming: integer
Abstract:

In Meanti et al. an almost sure asymptotic characterization has been derived for the optimal solution value as function of the knapsack capacities, when the profit and requirement coefficients of items to be selected from are random variables. In this paper the authors establish a rate of convergence for this process using results from the theory of empirical processes.

Reviews

Required fields are marked *. Your email address will not be published.