Abstract
ABSTRACTThis article tackles the optimization of a multi-objective integer indefinite quadratic maximization problem. The proposed algorithm for this class of nonlinear multi-objective problems obtains the whole set of efficient solutions by a Branch-and-Bound method with cuts. At every node of the branching tree, a relaxed problem, where both integrality and efficiency constraints are dropped, is solved by the simplex method. By tests and fathoming rules the algorithm decides, whether the node is fathomed, the relaxed problem is branched into subproblems or cuts are added. After the presentation and validation of the algorithm, a numerical example and computational experiments are provided.
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.
