Abstract
This paper discusses the geometric programs with joint probabilistic constraints. When the coefficients are normally distributed and independent of each other, we approximate the problem by using piecewise linear function and transform the approximation problem into a geometric program. We prove that this approximation method provides a lower bound, and we use Bonferroni approximation to find an upper bound.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have