Robust optimization model for uncertain multiobjective linear programs

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we consider the multiobjective linear programs where coefficients in the objective function belong to uncertainty sets. We introduce the concept of robust efficient solutions to uncertain multiobjective linear programming problems. By using two scalarization methods, the weighted sum method and the ϵ-constraint method, we obtain that the robust efficient solutions for uncertain multiobjective linear programs with ellipsoidal uncertainty sets and general norm uncertainty sets can be computed by some deterministic optimization problems.

Cite

CITATION STYLE

APA

Wang, L., & Fang, M. (2018). Robust optimization model for uncertain multiobjective linear programs. Journal of Inequalities and Applications, 2018. https://doi.org/10.1186/s13660-018-1612-3

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