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.
Finally, we point out that the stopping rule proposed above for using in interactive multiple objective linear programming procedures is analogous to verifying the Kuhn-Tucker conditions for optimality in a single objective problem.
Finally, we point out that the stopping rule proposed above for using in interactive multiple objective linear programming procedures is analogous to verifying the Kuhn-Tucker conditions for optimality in a single objective problem.
Original language | English |
---|---|
Title of host publication | Improving Decision Making in Organisations |
Subtitle of host publication | Proceedings of the Eighth International Conference on Multiple Criteria Decision Making, Held at Manchester Business School, University of Manchester, UK, August 21st-26th, 1988 |
Publisher | Springer |
Pages | 410-423 |
ISBN (Print) | 978-3-540-51795-5 |
DOIs | |
Publication status | Published - 31 Dec 1989 |
MoE publication type | A4 Conference publication |
Event | International Conference on Multiple Criteria Decision Making - Manchester, United Kingdom Duration: 21 Aug 1988 → 26 Aug 1988 Conference number: 8 |
Conference
Conference | International Conference on Multiple Criteria Decision Making |
---|---|
Abbreviated title | MCDM |
Country/Territory | United Kingdom |
City | Manchester |
Period | 21/08/1988 → 26/08/1988 |