Abstract
An algorithm is presented here for bicriterion linear programs which generates either all efficient points or a subset of such efficient points corresponding to a decision-maker's specified space of objective weights. The computational requirements of the algorithm are quite low; in fact only a series of divisions and comparisons are needed for the determination of adjacent efficient extreme points. As a by-product, the range of objective weights corresponding to each efficient extreme point is also generated. This additional information is used to characterize the set of all efficient points as a union of maximal efficient faces.
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.
