Modification of Recourse Data for Mixed-Integer Recourse Models
نویسنده
چکیده
We consider modification of the recourse data, consisting of the second-stage parameters and the underlying distribution, as an approximation technique for solving two-stage recourse problems. This approach is applied to several specific classes of mixed-integer recourse problems; in each case, the resulting recourse problem is much easier to solve.
منابع مشابه
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.
متن کاملA convex approximation for mixed-integer recourse models
We develop a convex approximation for two-stage mixed-integer recourse models and we derive an error bound for this approximation that depends on all total variations of the probability density functions of the random variables in the model. We show that the error bound converges to zero if all these total variations converge to zero. Our convex approximation is a generalization of the one in C...
متن کاملA convex approximation for mixed-integer recourse models
We develop a convex approximation for two-stage mixed-integer recourse models and we derive an error bound for this approximation that depends on all total variations of the probability density functions of the random variables in the model. We show that the error bound converges to zero if all these total variations converge to zero. Our convex approximation is a generalization of the one in C...
متن کاملStochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish closedness of the constraint set mapping with the underlying probability measure as parameter. In the case of finite probability spaces, the models are shown to be equivalent to large-scale, block-structured, mixedinteger...
متن کاملSimplification of recourse models by modification of recourse data
We consider modification of the recourse data, consisting of the second-stage parameters and the underlying distribution, as an approximation technique for solving two-stage recourse problems. This approach is applied to several specific classes of recourse problems; in each case, the resulting recourse problem is much easier to solve. Modification of recourse data is shown to be the common pri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005