A ranking algorithm for bi-objective quadratic fractional integer programming problems

被引：4

作者：

Sharma, Vikas ^{[1
]}

Dahiya, Kalpana ^{[2
]}

Verma, Vanita ^{[3
]}

机构：

[1] Thapar Univ, Sch Math, Patiala, Punjab, India

[2] Panjab Univ, UIET, Chandigarh, India

[3] Panjab Univ, Dept Math, Chandigarh, India

来源：

OPTIMIZATION | 2017年 / 66卷 / 11期

关键词：

Fractional programming; multiobjective programming; integer programming; NON-DOMINATED VECTORS; MULTIOBJECTIVE INTEGER; LINEAR-PROGRAMS; EFFICIENT SET; OPTIMIZATION; POINTS;

D O I：

10.1080/02331934.2017.1339703

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

An algorithm to solve bi-objective quadratic fractional integer programming problems is presented in this paper. The algorithm uses epsilon-scalarization technique and a ranking approach of the integer feasible solution to find all nondominated points. In order to avoid solving nonlinear 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 biobjective problem over the entire feasible set Numerical examples are also presented in support of the theory.

引用

页码：1913 / 1929

页数：17

共 33 条

[1] Optimizing a linear function over an integer efficient set [J].