Abstract
AbstractThis paper investigates the notion of nondominance in goal programming (GP). Nondominance in the standard sense of a vector maximum (VM) problem is not always desirable. A definition of “GP-nondominance” and a test for determining whether an optimal GP solution is GP-nondominated are provided. It is demonstrated that one or more GP-nondominated solutions can be found by exploring the alternative optima of the GP solution. A formulation for determining the set of GP-nondominated solutions is provided and examples are used to illustrate the concept of GP nondominance.
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 callMore From: INFOR: Information Systems and Operational Research
Disclaimer: 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.
