In stochastic programming (SP), a common constraint is of the form $$ \mathbb{P}(f(x,\xi) \leq 0) \geq \alpha. $$ If \(f\) is affine in \(x\) and \(\xi\), then we have the chance constraint of the form $$ \mathbb{P}(A(\xi)x + b(\xi)+ c \leq 0) \geq \alpha $$ for \(A\in \mathbb{R}^{m \times n} \). In this case, we can represent the joint constraint with \(m\) individual constraints of the form $$ \mathbb{P}(a_i^T(\xi)x + b_i(\xi) + c \leq 0) \geq \alpha. $$ To confirm, we can do this because each dimension is independent? How can I better see this?

Also, if \(f\) were not linear in \(x\) and \(\xi\), then we are unable to separate the joint constraint into constraint components, right? A simple, introductory reference on this idea would be much appreciated!

asked 19 Dec '17, 15:51

jjjjjj's gravatar image

accept rate: 0%

edited 19 Dec '17, 16:06

Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported



Asked: 19 Dec '17, 15:51

Seen: 128 times

Last updated: 19 Dec '17, 16:06

OR-Exchange! Your site for questions, answers, and announcements about operations research.