The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program

13Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a new exact algorithm, using an augmented weighted Tchebychev norm, for optimizing a linear function on the efficient set of a multiple objective integer linear programming problem. This norm is optimized progressively by improving the value of the linear criteria and going through some efficient solutions. The method produced not only the best efficient solution of the linear objective function but also a subset of nondominated solutions that can help decision makers to select the best decision among a large set of Pareto solutions. © 2012 International Federation of Operational Research Societies.

Cite

CITATION STYLE

APA

Chaabane, D., Brahmi, B., & Ramdani, Z. (2012). The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program. International Transactions in Operational Research, 19(4), 531–545. https://doi.org/10.1111/j.1475-3995.2012.00851.x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free