Suchergebnisse - "equivalent single‐level mixed‐integer programming problem"

Contingency constrained phasor measurement units placement with n − k redundancy criterion: a robust optimisation approach von Nikkhah, Saeid, Aghaei, Jamshid, Safarinejadian, Behrooz, Norouzi, Mohammad-Ali

“… The resulting bi-level programming model is solved by its evolution to an equivalent single-level mixed-integer programming problem …”
Volltext

Contingency-Constrained Unit Commitment With n - K Security Criterion: A Robust Optimization Approach von Street, A., Oliveira, F., Arroyo, J. M.

“… The resulting model is a particular instance of bilevel programming which is solved by its transformation to an equivalent single-level mixed-integer programming problem …”
Volltext

Contingency-Constrained Unit Commitment With [Formula Omitted] Security Criterion: A Robust Optimization Approach von Street, Alexandre, Oliveira, Fabrício, Arroyo, José M

“… This paper presents a new approach for the contingency-constrained single-bus unit commitment problem. The proposed model explicitly incorporates an [Formula …”
Volltext