Abstract

This paper deals with the problem of finding, for a given nondominated solution, a set of nondominated tradeoffs. Such tradeoffs play a central role in interactive multiple objective linear programming procedures when direction-finding and termination are considered. If the current solution is preferred to all of the tradeoffs, it is optimal, provided that the decision maker’s value (utility) function is assumed to be (globally) pseudo-concave at the moment of consideration. If any of the tradeoffs is a direction of improvemet, a new search direction can be found and the procedure continues as earlier.

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

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.