Abstract
AbstractDue to the real‐life issue of decision making in the presence of uncertainty and multiple conflicting objectives, it is of interest to solve optimization problems that incorporate these two aspects. To address this type of problem, we undertake the computation of highly robust efficient solutions to uncertain multiobjective linear programs with objective‐wise uncertainty in the cost matrix coefficients, and we address unbounded feasible regions as well as unbounded uncertainty sets. We provide methods for checking whether or not the highly robust efficient set is empty, computing highly robust efficient points, and determining whether a given solution of interest is highly robust efficient. An application in the area of bank management is included.
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.