کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
480900 | 1446148 | 2009 | 11 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Lower and upper bounds for linear production games Lower and upper bounds for linear production games](/preview/png/480900.png)
We study the problem of allocating the total profit of a production enterprise among the resource owners, using the game-theoretic framework introduced by Owen [Owen, G., 1975. On the core of linear production games. Mathematical Programming 9, 358–370]. We provide lower (upper) bounds on the values of the game by aggregating over columns (rows) of the LP-problem. By choosing aggregation weights corresponding to optimal solutions of the primal (dual) LP-problem, we can create new games whose core form a superset (subset) of the original core. An estimate of the resulting error, in terms of an ϵϵ-core, is obtained by solving a mixed integer programming problem, and we also suggest an iterative procedure for improving the bounds. Using a set of numerical examples, we investigate how the performance of the aggregation approach depends on the structure of the problem data.
Journal: European Journal of Operational Research - Volume 196, Issue 2, 16 July 2009, Pages 476–486