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

A method of solving extremal problems with constraints on the phase coordinates

โœ Scribed by B.M. Budak; Yu.L. Gaponenko; G.Yu. Malysheva; P.I. Ruban


Publisher
Elsevier Science
Year
1974
Weight
316 KB
Volume
14
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Variations on a cutting plane method for
โœ 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