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 Pinter, 1989). 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).

(2022). Bounds for Probabilistic Programming with Application to a Blend Planning Problem [journal article - articolo]. In EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. Retrieved from http://hdl.handle.net/10446/193746

Bounds for Probabilistic Programming with Application to a Blend Planning Problem

Maggioni, Francesca;
2022-01-01

Abstract

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 Pinter, 1989). 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).
articolo
2022
Peng, Shen; Maggioni, Francesca; Lisser, Abdel
(2022). Bounds for Probabilistic Programming with Application to a Blend Planning Problem [journal article - articolo]. In EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. Retrieved from http://hdl.handle.net/10446/193746
File allegato/i alla scheda:
File Dimensione del file Formato  
1-s2.0-S0377221721007980-main.pdf

Solo gestori di archivio

Versione: publisher's version - versione editoriale
Licenza: Licenza default Aisberg
Dimensione del file 614.7 kB
Formato Adobe PDF
614.7 kB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/193746
Citazioni
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact