A constraint satisfaction problem (CSP) involves finding values, selected from a finite domain, for all variables such that all constraints on the variables are satisfied. A constraint satisfaction optimisation problem (CSOP) is a CSP that has some objective function defined in terms of some or all of the variables. We present an algorithm where we employ local consistency techniques in a pre-processing phase, in order to decrease the domain sizes of the variables. This results in a simplified CSOP to be solved by an existing algorithm.Partial constraint satisfaction involves finding values for all variables such that a maximal subset of the constraints is satisfied. We expand our pre-processing algorithm to the partial CSOP case.