Exact Penalization in Stochastic Programming—Calmness and Constraint Qualification
We deal with the conditions which ensure exact penalization in stochastic programming problems under finite discrete distributions. We give several sufficient conditions for problem calmness including graph calmness, existence of an error bound, and generalized Mangasarian-Fromowitz constraint quali...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Asia University
2014-01-01
|
Series: | Advances in Decision Sciences |
Online Access: | http://dx.doi.org/10.1155/2014/569458 |