又一个对偶问题

 二分图最大权匹配的对偶问题二分图最小权覆盖

也就是对于给定的若干个不等式  lx[i1]+ly[j1]>=c1

                                                   lx[i2]+ly[j2]>=c2

                                                   lx[i3]+ly[j3]>=c2

                                                       ...........

问你 lx[i1]+ly[j1]+lx[i2]+ly[j2]+lx[i3]+ly[j3]+....+的最小值