Abstract
We relax an integer linear vector optimization problem [[Pbar]]. whose vector of variables ia additionally bounded from above. neglecting the upper and lowcr bounds of the basic variables. The relaxation is transformed into an equivalent muliizriteria prcup knapsack problem and this into a shortest path problem on a vectorially valued graph. The efficient points of the relaxation can be calculated from the solutions ol the corresponding group knapsack or shortesr path problem respectively. We derive a sufficient condition for the fact that the efficiency set of the relaxation contains elements feasible and thus efficient for problem [[Pbar]] Besides. criteria for finding the complete solution of the integer linear vector optimization problem by solving the relaxation are developed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
