✦ LIBER ✦
A separable integer programming problem equivalent to its continual version
✍ Scribed by A. Galperin; Z. Waksman
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 514 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
The separable integer programming problem with so called nested constraints is shown to be equivalent to its continual version obtained by piecewise linear continuation of the cost functions. A new approach to solution of the latter based on its successive reduction in size is suggested. When applied to the problem with piecewise linear convex functions it leads to two algorithms for its solution applicable also to the similar integer problem. These algorithms turn out more efficient than those obtained by dynamic programming approach.