Convex Relaxations and Approximations of Chance-Constrained AC-OPF Problems

IEEE Transactions on Power Systems - United States
doi 10.1109/tpwrs.2018.2874072
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

On Two-Stage Convex Chance Constrained Problems

2005English

Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2011English

Multipoint Linear Approximations for Stochastic Chance Constrained Optimization Problems With Integer Design Variables

2000English

Convex Relaxations for Consensus and Non-Minimal Problems in 3D Vision

2019English

Convex Methods for Rank-Constrained Optimization Problems

2015English

Partial Sample Average Approximation Method for Chance Constrained Problems

Optimization Letters
ControlOptimization
2018English

Genetic Algorithm Based Technique for Solving Chance Constrained Problems

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2008English

Scenario Approximations of Chance Constraints

English

Semidefinite Programming Relaxations Through Quadratic Reformulation for Box-Constrained Polynomial Optimization Problems

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy