𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cutting planes for programs with disjunctive constraints

✍ Scribed by G. Owen

Publisher
Springer
Year
1973
Tongue
English
Weight
256 KB
Volume
11
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Solving convex programs with infinitely
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
✍ Soon-Yi Wu; S.-C. Fang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 541 KB

One of the major computational bottlenecks of using the conventional cutting plane approach to solve convex programming problems with infinitely many linear constraints lies in finding a global optimizer of a nonlinear and nonconvex program. This paper presents a relaxed scheme to generate a new cut