We survey recent results on the power of LP relaxations for optimisation problems known as valued constraint satisfaction problems (CSPs) which might be of interest to the counting community.