✦ 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
DOI: 10.1002/cpe.1397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relaxations for probabilistically constr

Relaxations for probabilistically constrained programs with discrete random variables

✍ Suvrajeet Sen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 420 KB

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

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