An Algorithm for Bi-Objective Integer Linear Programming Problem

被引：1
|
作者：
Prerna [1 ]
Sharma, Vikas [1 ]
机构：
[1] Thapar Inst Engn & Technol, Patiala 147004, Punjab, India
来源：
FILOMAT | 2022年 / 36卷 / 16期
关键词：
Integer programming problem; Multi-objective programming problem; Linear programming;
D O I：
10.2298/FIL2216641P
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work is to effectively implement the epsilon-constraint method to produce a complete set of non dominated points. The convergence of the algorithm has been established theoretically. Further a comparative study to some existing algorithm has also been made.
引用
收藏
页码：5641 / 5651
页数：11
相关论文
共 50 条
  • [41] Research on multi-objective linear programming problem with fuzzy coefficients in constraints
    Zhang, Guoli
    Zuo, Hua
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2014, 5 (03) : 403 - 412
  • [42] Integer linear programming models for global routing
    Behjat, Laleh
    Vannelli, Anthony
    Rosehart, William
    INFORMS JOURNAL ON COMPUTING, 2006, 18 (02) : 137 - 150
  • [43] Circuit and Graver walks and linear and integer programming
    Onn, Shmuel
    DISCRETE OPTIMIZATION, 2024, 54
  • [44] Safe bounds in linear and mixed-integer linear programming
    Neumaier, A
    Shcherbina, O
    MATHEMATICAL PROGRAMMING, 2004, 99 (02) : 283 - 296
  • [45] Parametric approach and genetic algorithm for multi objective linear programming with imprecise parameters
    Chakraborty M.
    Ray A.
    OPSEARCH, 2010, 47 (1) : 73 - 92
  • [46] An isometric surface method for integer linear programming
    Niey, YY
    Su, LJ
    Li, C
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (07) : 835 - 844
  • [47] An information theoretic based integer linear programming approach for the discrete search path planning problem
    Berger, Jean
    Lo, Nassirou
    Boukhtouta, Abdeslem
    Noel, Martin
    OPTIMIZATION LETTERS, 2015, 9 (08) : 1585 - 1607
  • [48] Safe bounds in linear and mixed-integer linear programming
    Arnold Neumaier
    Oleg Shcherbina
    Mathematical Programming, 2004, 99 : 283 - 296
  • [49] An information theoretic based integer linear programming approach for the discrete search path planning problem
    Jean Berger
    Nassirou Lo
    Abdeslem Boukhtouta
    Martin Noel
    Optimization Letters, 2015, 9 : 1585 - 1607
  • [50] A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
    Joung, Seulgi
    Lim, Jaeyoong
    Lee, Chungmok
    Shin, Jongyoon
    Jung, Ikkyun
    Park, Sungsoo
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2020, 71 (02) : 250 - 263
12345