Abstract
We propose a reference direction based interactive algorithm to solve multiple objective integer linear programming (MOILP) problems. At each iteration of the solution procedure, the algorithm finds (weak) nondominated solutions to the relaxed MOILP problem. Only at certain iterations, if the DM so desires, an additional mixed integer programming problem is solved to find an integer (weak) nondominated solution which is close to the current continuous (weak) nondominated solution to the relaxed MOILP problem. In the proposed algorithm, DM has to provide only the reference point at each iteration. No special software is required to implement the proposed algorithm. The algorithm is illustrated with an example.
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.
