๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of Test Problems for Concave Minimization Under Linear and Nonlinear Constraints

โœ Scribed by K. Moshirvaziri

Book ID
110423250
Publisher
Springer
Year
1998
Tongue
English
Weight
902 KB
Volume
98
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Variations on a cutting plane method for
Variations on a cutting plane method for solving concave minimization problems with linear constraints
โœ A. Victor Cabot ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th