A note on robustness of the min-max solution to multi-objective linear programs Online publication date: Fri, 06-Jan-2017
by Erin K. Doolittle; Garrett M. Dranichak; Karyn Muir; Margaret M. Wiecek
International Journal of Multicriteria Decision Making (IJMCDM), Vol. 6, No. 4, 2016
Abstract: The challenge of using scalarising methods in multi-objective optimisation results from the choice of the method, which may not be apparent, and given that a method has been selected, from the choice of the values of the scalarising parameters. In general, these values may be unknown and the decision maker faces a difficult situation of making a choice possibly under a great deal of uncertainty. Due to its effectiveness, the robust optimisation approach of Ben-Tal and Nemirovski is applied to resolve the uncertainty carried in scalarised multi-objective linear programs (MOLPs). A robust counterpart is examined for six different scalarisations of the MOLP yielding robust (weakly) efficient solutions to the original MOLP. The study reveals that the min-max optimal solution emerges as a robust (weakly) efficient solution for five out of the six scalarisations. The implications of this result are also discussed.
Online publication date: Fri, 06-Jan-2017
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Multicriteria Decision Making (IJMCDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org