Totally unimodular multistage stochastic programs

نویسندگان

  • Ruichen Sun
  • Oleg V. Shylo
  • Andrew J. Schaefer
چکیده

We consider totally unimodular multistage stochastic programs, that is, multistage stochastic programs whose extensive-form constraint matrices are totally unimodular. We establish several sufficient conditions and identify examples that have arisen in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Totally unimodular stochastic programs

We consider totally unimodular (TU) stochastic programs, that is, two-stage stochastic programs whose extensive-form constraint matrix is TU. We generalize the notion of total unimodularity to apply to sets of matrices and provide properties of such sets. We provide several sufficient conditions on stochastic programs to be TU. When solving TU stochastic problems using the L-shaped method, it i...

متن کامل

A bidirected generalization of network matrices

We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the same way as the network matrices do from directed graphs. We develop the necessary theory, give binet representations for interesting sets of matrices, characterize totally unimodular binet matrices and discuss the rec...

متن کامل

Working Paper on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs

A general decomposition framework for large convex optimization problems based on augmented Lagrangians is described. The approach is then applied to multistage stochastic programming problems in two di erent ways: by decomposing the problem into scenarios and by decomposing it into nodes corresponding to stages. Theoretical convergence properties of the two approaches are derived and a computa...

متن کامل

A note on complexity of multistage stochastic programs

In Shapiro [2006], estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the conditional sample average approximation method were derived. In this paper we construct an example in the multistage setting that shows that these estimates cannot be significantly improved.

متن کامل

Stability of multistage stochastic programs incorporating polyhedral risk measures

Optimization A Journal of Mathematical Programming and Operations Research Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713646500 Stability of multistage stochastic programs incorporating polyhedral risk measures Andreas Eichhorn a; Werner Römisch a a Department of Mathematics, Humboldt University Berlin, B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Oper. Res. Lett.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2015