Abstract

We consider a chance constraint Prob{/spl xi/ : A(x, /spl xi/) /spl isin/ K} /spl ges/ 1 - e (x is the decision vector, /spl xi/ is a random perturbation, K is a closed convex cone, and A(/spl middot/,/spl middot/) is bilinear). While important for many applications in optimization and control, chance constraints typically are computationally intractable, which makes it necessary to look for their tractable approximations. We present these approximations for the cases when the underlying conic constraint A(x,/spl xi/)/spl isin/ K is (a) scalar inequality, or (b) conic quadratic inequality, or (c) linear matrix inequality, and discuss the level of conservativeness of the approximations.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.