Convex approximations for complete integer recourse models (Q1434075)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2077960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex approximations for complete integer recourse models |
scientific article; zbMATH DE number 2077960 |
Statements
Convex approximations for complete integer recourse models (English)
0 references
1 July 2004
0 references
The author considers the two-stage integer recourse problem. Convex approximations of the expected value function are constructed. This gives an optimal solution for the class of problems with totally unimodular recourse matrix. For the general case the constructed convex approximation is a lower bound for the expected value function. It is proven that the proposed convex approximation is strictly better than the one obtained using the LP relaxation of the second-stage problem.
0 references
stochastic programming
0 references
integer recourse
0 references
convex approximation
0 references
0.8793203234672546
0 references
0.8746213316917419
0 references
0.86286461353302
0 references
