Abstract
An efficient interactive solution framework for bicriteria integer programming is developed. The proposed methodology follows the implicit utility maximization approach. The decision maker's underlying utility function is assumed to be pseudoconcave and nondecreasing, and the problem is solved using an interactive branch-and-bound methodology. Several new concepts on bicriteria integer programming that offer great efficiency in the solution process are developed. The framework has been tested extensively, and results with problems having up to 80 variables and 40 constraints are presented. The results show that the methodology is an effective approach to solving practical bicriteria problems.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics
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.
