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

Analysing probabilistically constrained optimism

โœ Scribed by Michael Lees; Brian Logan; Georgios Theodoropoulos


Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
175 KB
Volume
21
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Probabilistic structural optimization
โœ Professor Dan M Frangopol ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 837 KB
Constrained optimal designs
โœ Carl M.-S. Lee ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 743 KB
Linearly constrained optimization
โœ G. M. Ostrovsky; M. G. Ostrovsky; T. A. Berezinsky ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Springer Vienna ๐ŸŒ English โš– 227 KB
Optimal constrained bidding
โœ R. Engelbrecht-Wiggans ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 346 KB
A branch-reduce-cut algorithm for the gl
โœ 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