A ranking algorithm for bi-objective quadratic fractional integer programming problems. (2nd November 2017)

• Record Type: Journal Article
• Authors: Sharma, Vikas; Dahiya, Kalpana; Verma, Vanita
• Is Part Of: Optimization. Volume 66:Number 11(2017)
• Page Start: 1913
• Page End: 1929
• Publication Date: 2017-11-02
• Subjects: Fractional programming -- multiobjective programming -- integer programming; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2017.1339703
• Languages: English
• ISSNs: 0233-1934

Abstract

Abstract: An algorithm to solve bi-objective quadratic fractional integer programming problems is presented in this paper. The algorithm uses -scalarization technique and a ranking approach of the integer feasible solution to find all nondominated points. In order to avoid solving non-linear integer programming problems during this ranking scheme, the existence of a linear or a linear fractional function is established, which acts as a lower bound on the values of first objective function of the bi-objective problem over the entire feasible set. Numerical examples are also presented in support of the theory.