𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finiteness Theorems in Stochastic Integer Programming

✍ Scribed by Matthias Aschenbrenner; Raymond Hemmecke

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
495 KB
Volume
7
Category
Article
ISSN
1615-3375

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On stochastic integer programming
On stochastic integer programming
✍ H. -J. Zimmermann; M. A. Pollatschek πŸ“‚ Article πŸ“… 1975 πŸ› Springer 🌐 English βš– 450 KB
Two sensitivity theorems in fuzzy intege
Two sensitivity theorems in fuzzy integer programming
✍ A.S. Asratian; N.N. Kuzjurin πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 224 KB

We consider the problem of estimating optima of covering integer linear programs with 0-1 variables under the following conditions: we do not know exact values of elements in the constraint matrix A but we know what elements of A are zero and what are nonzero, and also know minimal and maximal value

A finiteness proof for modified dantzig
A finiteness proof for modified dantzig cuts in integer programming
✍ V. J. Bowman Jr.; G. L. Nemhauser πŸ“‚ Article πŸ“… 1970 πŸ› John Wiley and Sons 🌐 English βš– 234 KB

where R is the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers and xu is not an integer in the basic solution, the linear constraint is implied. We prove that including these "cuts" in a specified way yields a finite dual simplex a