Abstract: We review and develop different tractable approximations to individual chance constrained problems in robust optimization on a varieties of uncertainty sets and show their interesting connections with bounds on the conditional-value-at-risk (CVaR) measure. We extend the idea to joint chance constrained problems and provide a new formulation that improves upon the standard approach. Numerical results on a network resource allocation problem with uncertain demand is reported.