By means of penalty functions, difficult equality constraints can be r
eadily handled in direct search optimisation. Three examples are used
to test the viability of the approach. The range over which the values
of the, penalty function factors can be taken to obtain convergence t
o the global optimum is sufficiently large to make the use of penalty
functions an attractive means of dealing with difficult equality const
raints.