A polynomial approximation-based approach for chance-constrained optimization
From MaRDI portal
Publication:4646676
DOI10.1080/10556788.2017.1364737zbMath1416.90025OpenAlexW2749004184MaRDI QIDQ4646676
Publication date: 14 January 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1364737
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Log-concavity and strong log-concavity: a review
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Dual methods for probabilistic optimization problems.
- Chance constrained programming models for refinery short-term crude oil scheduling problem
- An integer programming approach for linear programs with probabilistic constraints
- Sample average approximation method for chance constrained programming: Theory and applications
- Chance-Constrained Programming
- From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- Exact penalty functions in nonlinear programming
- Asymptotic Statistics
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Chance Constrained Programming with Joint Constraints
- Convex Approximations of Chance Constrained Programs
- An Application of Chance Constrained Programming to Portfolio Selection in a Casualty Insurance Firm
- Approximation of convex data
This page was built for publication: A polynomial approximation-based approach for chance-constrained optimization