On multiple simple recourse models
نویسنده
چکیده
We consider multiple simple recourse (MSR) models, both continuous and integer versions, which generalize the corresponding simple recourse (SR) models by allowing for a refined penalty cost structure for individual shortages and surpluses. It will be shown that (convex approximations of) such MSR models can be represented as explicitly specified continuous SR models, and thus can be solved efficiently by existing algorithms.
منابع مشابه
Convex simple integer recourse models
We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead. Based on an explicit formula for the objective function, we derive a complete description of the class of probability density functions such that the objective functio...
متن کاملConvex Approximations for Totally Unimodular Integer Recourse Models: A Uniform Error Bound
We consider a class of convex approximations for totally unimodular (TU) integer recourse models and derive a uniform error bound by exploiting properties of the total variation of the probability density functions involved. For simple integer recourse models this error bound is tight and improves the existing one by a factor 2, whereas for TU integer recourse models this is the first nontrivia...
متن کاملConvex approximations for a class of mixed-integer recourse models
We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the secondstage value function of such problems to the expected simple integer recourse (SIR) shortage function. This allows to construct convex approximations for MIR problems by the same approach used for SIR models.
متن کاملSimple integer recourse models: convexity and convex approximations
We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead. Based on an explicit formula for the objective function, we derive a complete description of the class of probability density functions such that the objective functio...
متن کاملConvex approximations for simple integer recourse models by perturbing the underlying distributions
We present a class of convex approximations of the expected value function of a simple recourse problem with fixed technology matrix and integer second-stage variables. These approximations are obtained by perturbing the distributions of the right-hand side parameters. The resulting distributions are special instances of the class of distributions that yield convex expected value functions. A c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 62 شماره
صفحات -
تاریخ انتشار 2005