Expanding the flexibility of goal programming via preference modelling techniques

The standard goal programming model only allows linear continuous preference functions to be modelled. In this paper methods for formulating other possible preference structures, such as discontinuities and varying penalty levels dependent on the distance from the goals are proposed. Techniques for ensuring minimal model growth and ease of solution are discussed. An example to illustrate these methods is given.