(self, other)
return self.value + np.sum(sup_sum)
Largest possible value other can have based on the emanating cone from this point
Largest possible value other can have based on the emanating cone from this point
Largest possible value other can have based on the emanating cone from this point
def find_sup(self, other):
      """ Largest possible value other can have based on the emanating cone from this point """
      diff = other-self.where
      sup_sum = diff*(diff > 0)*self.sup_plus + diff*(diff < 0)*self.sup_minus
      return self.value + np.sum(sup_sum)
def find_sup ( self , other ) : diff = other - self . where sup_sum = diff * ( diff > 0 ) * self . sup_plus + diff * ( diff < 0 ) * self . sup_minus return self . value + np . sum ( sup_sum )