Friday, 16:15 - 16:40 h, Room: H 2013


Jim Ostrowski
Dominance-strengthened symmetry breaking constraints in the unit commitment problem

Coauthor: Jianhui Wang


Adding symmetry-breaking to a highly symmetric instance of a MILP problem can
reduce the size of the problem's feasible region considerably. The same can be
said for good dominance constraints. In this talk we will examine the impact of
using dominance arguments to strengthen symmetry breaking constraints for the
Unit Commitment (UC) problem. Symmetry is present in (traditional formulations
of) the UC problem when there are several generators of the same type. We show
that by adding dominance strengthened cuts, the number of feasible solutions
that need to be considered only grows polynomially as the number of generators
increases (so long as the number of unique generators is fixed).


Talk 3 of the invited session Fri.3.H 2013
"Symmetry issues in integer programming" [...]
Cluster 11
"Integer & mixed-integer programming" [...]


  cash loans . If you have already decided to take Levitra, be sure to consult a doctor, you don't have any contraindications and act strictly due to a prescription.