Abstract

This paper focuses on possible problems associated with the use of penalty functions in Goal Programming (GP). In this sense we illustrate, with the help of numerical examples, how an assumption of separability amongst decision maker's preferences which underlies these approaches, can produce in the corresponding GP models extremely biased results towards certain goals. A new GP variant is proposed to overcome this type of problem.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call