“…This formulation can be interpreted as a generalized goal programming Ð equivalent to the classical goal programming if all objectives are stabilized, but with the advantage that all solutions of the problem (9) are nondominated with respect to the appropriately defined positive cone, which cannot be guaranteed in classical goal programming. Such a reference point or aspiration-led approach to multi-objective linear programming has been used, for example, in the programming package for multiple-objective analysis and decision support DIDAS-L for linear models (see Rogowski et al (1989); similar forms have been used earlier by many authors (e.g. Wierzbicki, 1980;Nakayama and Sawaragi, 1983;Steuer and Choo, 1983)).…”