Abstract
This chapter discusses the relationship between goal programming (GP), multiobjective programming (MOP), and compromise programming (CP). There are important links between GP, MOP, and CP. There is a strong resemblance between GP and CP and under certain circumstances, both approaches are identical, GP and CP represent different multiple criteria decision making issues. Virtually, any of the single, GP, MOP or CP approaches can be considered as a special case of the following general distance function model. Several multiple criteria decision making approaches have a family of distance functions with a general metric as a common root. The decision making disregards individual deviation magnitudes and is only concerned with the total sum of the deviations.
Sign-in/Register to access full text options 
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
