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

Fast Algorithm for the Cutting Angle Method of Global Optimization

โœ Scribed by L.M. Batten; G. Beliakov

Book ID
110393930
Publisher
Springer US
Year
2002
Tongue
English
Weight
160 KB
Volume
24
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A branch-reduce-cut algorithm for the gl
A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
โœ Myun-Seok Cheon; Shabbir Ahmed; Faiz Al-Khayyal ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 292 KB

We consider probabilistically constrained linear programs with general distributions for the uncertain parameters. These problems involve non-convex feasible sets. We develop a branch-and-bound algorithm that searches for a global optimal solution to this problem by successively partitioning the non