Abstract
A method for generating the entire efficient set for a multiple objective linear program is developed. The method is based on two characterizations of maximal efficient faces. The first characterization is used to determine the set of maximal efficient faces incident to a given efficient vertex, and the second characterization ensures that previously generated maximal efficient faces are easily recognized (and not regenerated). The efficient set is described as the union of maximal efficient faces. An alternate implicit description of the efficient set as the set of all optimal vectors for a finite set of linear programs is also provided.
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 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.
