Abstract
This chapter discusses Paretian efficiency in goal programming. A collectivity is in an optimum state if no person of that collectivity can improve his situation without worsening the situation of any other person of that collectivity. This kind of optimality is known asParetian efficiency. Paretian efficiency is a condition required to guarantee the rationality of any solution provided by any approach. The concept of Pareto optimality plays a crucial role for the different approaches developed within the multiple criteria decision making paradigm. The elements in the set of Paretian efficient solutions are feasible solutions such that no other feasible solution can achieve the same or better performance for all the objectives and be strictly better for at least one objective. Within goal programming (GP), Paretian efficiency is a convenient condition that must satisfy a solution. If a GP solution is nonefficient or inferior, this means that at least the achievement of one of the goals can be improved without worsening the achievement of the others.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
