[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [Help-glpk] binary boolean

**From**: |
Andrew Makhorin |

**Subject**: |
Re: [Help-glpk] binary boolean |

**Date**: |
Sat, 05 May 2012 23:59:22 +0400 |

>* 3. Yet another description (as pointed out by Erwin and Michael)*
>* *
>* z >= x*
>* *
>* z >= y*
>* *
>* z <= x+y*
>* *
>* It is a good description, because all inequalities are facet-defined*
>* (until the mip instance includes other constraints).*
>* *
This case is a CNF description, because
z >= x can be written as z + (1 - x) >= 1
z >= y can be written as z + (1 - y) >= 1
z <= x+y can be written as x + y + (1 - z) >= 1
so it is equivalent to the case 1, where one of the constriants is
redundant.

**[Help-glpk] binary boolean**, *Zvonko Bregar*, `2012/05/03`
**Re: [Help-glpk] binary boolean**, *Erwin Kalvelagen*, `2012/05/03`
**Re: [Help-glpk] binary boolean**, *Yaron Kretchmer*, `2012/05/03`
**Re: [Help-glpk] binary boolean**, *Andrew Makhorin*, `2012/05/04`
**Re: [Help-glpk] binary boolean**, *Yaron Kretchmer*, `2012/05/04`
**Re: [Help-glpk] binary boolean**, *Andrew Makhorin*, `2012/05/05`
**Re: [Help-glpk] binary boolean**,
*Andrew Makhorin* **<=**
**Re: [Help-glpk] binary boolean**, *Michael Hennebry*, `2012/05/06`
**Re: [Help-glpk] binary boolean**, *Andrew Makhorin*, `2012/05/05`
**Re: [Help-glpk] binary boolean**, *Yaron Kretchmer*, `2012/05/05`
**Re: [Help-glpk] binary boolean**, *Michael Hennebry*, `2012/05/04`