Bounds for Probabilistic Programming with Application to a Blend Planning Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operations Research Année : 2022

Bounds for Probabilistic Programming with Application to a Blend Planning Problem

Résumé

In this paper, we derive deterministic inner approximations for single and joint independent or dependent probabilistic constraints based on classical inequalities from probability theory such as the one-sided Chebyshev inequality, Bernstein inequality, Chernoff inequality and Hoeffding inequality (see [31]). The dependent case has been modelled via copulas. New assumptions under which the bounds based approximations are convex allowing to solve the problem efficiently are derived. When the convexity condition can not hold, an efficient sequential convex approximation approach is further proposed to solve the approximated problem. Piecewise linear and tangent approximations are also provided for Chernoff and Hoeffding inequalities allowing to reduce the computational complexity of the associated optimization problem. Extensive numerical results on a blend planning problem under uncertainty are finally provided allowing to compare the proposed bounds with the Second Order Cone (SOCP) formulation and Sample Average Approximation (SAA).
Fichier principal
Vignette du fichier
EJOR_REVISION2.pdf (1.13 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04375429 , version 1 (05-01-2024)

Identifiants

Citer

Shengpeng Wang, Francesca Maggioni, Abdel Lisser. Bounds for Probabilistic Programming with Application to a Blend Planning Problem. European Journal of Operations Research, 2022, 297 (3), pp.964-976. ⟨10.1016/j.ejor.2021.09.023⟩. ⟨hal-04375429⟩
17 Consultations
9 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More