Zobrazeno 1 - 10
of 245
pro vyhledávání: '"Bienstock, Daniel A."'
Autor:
Bienstock, Daniel, Chen, Tongtong
We study convex optimization problems where disjoint blocks of variables are controlled by binary indicator variables that are also subject to conditions, e.g., cardinality. Several classes of important examples can be formulated in such a way that b
Externí odkaz:
http://arxiv.org/abs/2411.11722
Autor:
Bienstock, Daniel, Villagra, Matias
We present a linear cutting-plane relaxation approach that rapidly proves tight lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF). Our method leverages outer-envelope linear cuts for well-known second-order cone relaxations
Externí odkaz:
http://arxiv.org/abs/2403.08800
Autor:
Bienstock, Daniel, Villagra, Matias
We present a pure linear cutting-plane relaxation approach for rapidly proving tight and accurate lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF) and its multi-period extension with ramping constraints. Our method leverage
Externí odkaz:
http://arxiv.org/abs/2312.04251
We propose an enhancement to wholesale electricity markets whereby the exposure of consumers to increasingly large and volatile consumer payments arising as a byproduct of volatile real-time net loads -- i.e., loads minus renewable outputs -- and pri
Externí odkaz:
http://arxiv.org/abs/2311.17254
The capacity market, a marketplace to exchange available generation capacity for electricity production, provides a major revenue stream for generators and is adopted in several U.S. regions. A subject of ongoing debate, the capacity market is viewed
Externí odkaz:
http://arxiv.org/abs/2311.06426
Autor:
Ferrando, Robert, Pagnier, Laurent, Mieth, Robert, Liang, Zhirui, Dvorkin, Yury, Bienstock, Daniel, Chertkov, Michael
This paper addresses the challenge of efficiently solving the optimal power flow problem in real-time electricity markets. The proposed solution, named Physics-Informed Market-Aware Active Set learning OPF (PIMA-AS-OPF), leverages physical constraint
Externí odkaz:
http://arxiv.org/abs/2304.00062
It is well known that bilevel optimization problems are hard to solve both in theory and practice. In this paper, we highlight a further computational difficulty when it comes to solving bilevel problems with continuous but nonconvex lower levels. Ev
Externí odkaz:
http://arxiv.org/abs/2202.01033
We survey optimization problems that involve the cardinality of variable vectors in constraints or the objective function. We provide a unified viewpoint on the general problem classes and models, and give concrete examples from diverse application f
Externí odkaz:
http://arxiv.org/abs/2106.09606
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained sets admit r
Externí odkaz:
http://arxiv.org/abs/2011.08347
Publikováno v:
4OR - A Quarterly Journal of Operations Research (2020)
Power flow refers to the injection of power on the lines of an electrical grid, so that all the injections at the nodes form a consistent flow within the network. Optimality, in this setting, is usually intended as the minimization of the cost of gen
Externí odkaz:
http://arxiv.org/abs/2007.05334