![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
This article presents a solution technique to generate the exhaustive set of efficient solutions of a bicriteria integer quadratic programming problem. An integer quadratic programming problem with one of the objective functions as the principal objective is considered. By varying the minimum acceptable values of the second objective. a sequence of constrained single objective integer quadratic programming problems is solved by ranking the integer feasible solutions of a related integer linear programming problem. These solutions help in generating the complete set of efficient solutions. In ranking the integer feasible solutions we start with an optimal feasible solution of the related integer linear programming problem and we use post-optimality procedures to find the next best integer feasible solutions.