𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A shadow price in integer programming for management decision

✍ Scribed by Sehun Kim; Seong-cheol Cho

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
510 KB
Volume
37
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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