Nondominated Tradeoffs and Termination in Interactive Multiple Objective Linear Programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

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.
Original languageEnglish
Title of host publicationImproving Decision Making in Organisations
Subtitle of host publicationProceedings of the Eighth International Conference on Multiple Criteria Decision Making, Held at Manchester Business School, University of Manchester, UK, August 21st-26th, 1988
Pages410-423
DOIs
Publication statusPublished - 31 Dec 1989
MoE publication typeA4 Article in a conference publication
EventInternational Conference on Multiple Criteria Decision Making - Manchester, United Kingdom
Duration: 21 Aug 198826 Aug 1988
Conference number: 8

Conference

ConferenceInternational Conference on Multiple Criteria Decision Making
Abbreviated titleMCDM
CountryUnited Kingdom
CityManchester
Period21/08/198826/08/1988

Fingerprint

Dive into the research topics of 'Nondominated Tradeoffs and Termination in Interactive Multiple Objective Linear Programming'. Together they form a unique fingerprint.

Cite this