Finiteness theorems in stochastic integer programming

Details Finiteness theorems in stochastic integer programming Finiteness theorems in stochastic integer programming

2005-02-03

arxiv.org/abs/math/0502078v1

Mathematics

Optimization and Control

36 pp

Scientific paper

We study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finitely many ``building blocks'', independent of the number of scenarios, and we give an effective procedure to compute these building blocks. The paper includes an introduction to Nash-Williams' theory of better-quasi-orderings, which is used to show termination of our algorithm. We also apply this theory to finiteness results for Hilbert functions.

Affiliated with

Also associated with

No associations

Rating

Finiteness theorems in stochastic integer programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finiteness theorems in stochastic integer programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finiteness theorems in stochastic integer programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-528085