2018
DOI: 10.1016/j.ifacol.2018.11.727
|View full text |Cite
|
Sign up to set email alerts
|

Mixed-Integer vs. Real-Valued Formulations of Battery Scheduling Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
3

Relationship

3
3

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…Alternatively, absolute value functions may be used, but this would imply solving a real-valued Nonlinear Program (NLP) instead of a Mixed Integer Linear Program (MILP). As shown in Murray, Faulwasser, and Hagenmeyer (2018), the latter generally gives better results for the BATSS problem (Table 1).…”
Section: Model Of Connection To Main Gridmentioning
confidence: 69%
See 1 more Smart Citation
“…Alternatively, absolute value functions may be used, but this would imply solving a real-valued Nonlinear Program (NLP) instead of a Mixed Integer Linear Program (MILP). As shown in Murray, Faulwasser, and Hagenmeyer (2018), the latter generally gives better results for the BATSS problem (Table 1).…”
Section: Model Of Connection To Main Gridmentioning
confidence: 69%
“…There exist nonlinear approaches to model effects such as preventing a simultaneous charging and discharging of the battery (Appino et al 2018). Alternatively, Murray, Faulwasser, and Hagenmeyer (2018); Sass et al (2020) illustrate how such nonlinear battery models can be reformulated with mixed-integer linear approaches. In Bösenberg et al (2015), it is shown that higher cycling rates can reduce battery lifetime, and thus a controller which avoids this can reduce long term maintenance costs.…”
Section: Energy System Modellingmentioning
confidence: 99%
“…These methods typically require communication of the solutions of the decoupled problems between neighbours or to a central coordinator [10]. Although some researchers, [39,55], have attempted to apply these distributed local optimization methods in a heuristic manner, these methods cannot find global minimizers of non-convex problems reliably. This is due to the fact that ADMM, ALADIN, or similar distributed convex optimization method typically rely on strong duality results for augmented Lagrangians [52,54], which fail to hold in the presence of integrality constraints.…”
Section: Introductionmentioning
confidence: 99%
“…These methods typically require communication of the solutions of the decoupled problems between neighbors or to a central coordinator [9]. Although some researchers, [46,34], have attempted to apply these distributed local optimization methods in a heuristic manner, these methods cannot find global minimizers of non-convex problems reliably. This is due to the fact that ADMM, ALADIN, or similar distributed convex optimization method typically rely on strong duality results for augmented Lagrangians [45,43], which fail to hold in the presence of integrality constraints.…”
Section: Introductionmentioning
confidence: 99%