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.
Highlights
The parameter values of optimization problems in real world are usually uncertain due to prediction errors, estimation errors, or lack of information at the time of decision
We introduce the concept of robust efficient solution to uncertain multiobjective linear programs (UMLPs)
We show that two scalarization methods, the weighted sum method and the -constraint method, can be used to find robust efficient solutions of UMLP with ellipsoidal uncertainty sets and general norm uncertainty sets
Summary
The parameter values of optimization problems in real world are usually uncertain due to prediction errors, estimation errors, or lack of information at the time of decision. Jeyakumar, Li, and Perez [21] introduced the definition of radius of robust feasibility and analyzed the robust weakly efficient solution of a multiobjective linear programming problems with data uncertainty both in the objective function and constraints. They gave numerically tractable optimality conditions for highly robust weakly efficient solutions. We further show that robust efficient solutions for uncertain multiobjective linear programming problems with ellipsoidal uncertainty sets and general uncertainty sets can be found by solving deterministic optimization problems using weighted sum scalarization and can be computed by existing technology of deterministic optimization problems
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.