# An algorithm for solving multiple objective integer linear programming problem

RAIRO - Operations Research - Recherche Opérationnelle (2002)

- Volume: 36, Issue: 4, page 351-364
- ISSN: 0399-0559

## Access Full Article

top## Abstract

top## How to cite

topAbbas, Moncef, and Chaabane, Djamal. "An algorithm for solving multiple objective integer linear programming problem." RAIRO - Operations Research - Recherche Opérationnelle 36.4 (2002): 351-364. <http://eudml.org/doc/245092>.

@article{Abbas2002,

abstract = {In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.},

author = {Abbas, Moncef, Chaabane, Djamal},

journal = {RAIRO - Operations Research - Recherche Opérationnelle},

keywords = {multiple objective programming; integer linear programming; Multiple objective programming},

language = {eng},

number = {4},

pages = {351-364},

publisher = {EDP-Sciences},

title = {An algorithm for solving multiple objective integer linear programming problem},

url = {http://eudml.org/doc/245092},

volume = {36},

year = {2002},

}

TY - JOUR

AU - Abbas, Moncef

AU - Chaabane, Djamal

TI - An algorithm for solving multiple objective integer linear programming problem

JO - RAIRO - Operations Research - Recherche Opérationnelle

PY - 2002

PB - EDP-Sciences

VL - 36

IS - 4

SP - 351

EP - 364

AB - In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.

LA - eng

KW - multiple objective programming; integer linear programming; Multiple objective programming

UR - http://eudml.org/doc/245092

ER -

## References

top- [1] M. Abbas and M. Moulaï, Solving Multiple Objective Integer Linear Programming Problem. Ricerca Operativa 29 (1999) 15-39.
- [2] P. Armand and C. Malivert, Determination of the Efficient Set in Multi-Objective Linear Programming. J. Optim. Theory Appl. 70 (1991) 467-489. Zbl0793.90064MR1124774
- [3] P. Armand, Finding all maximal efficient faces in multi-Objective linear programming. Math. Programming 61 (1993) 357-375. Zbl0795.90054MR1242467
- [4] M.S. Bazaraa and C.M. Shetty, Non linear Programming theory and Algorithms. J. Wiley, New York (1979). Zbl0476.90035MR533477
- [5] H.P. Benson, Finding an initial Efficient Extreme Point for a Linear Multiple Objective Program. J. Oper. Res. Soc. (1981) 495-498. Zbl0454.90075MR614693
- [6] H.P. Benson, Existence of Efficient solutions for vector Maximization Problems. J. Optim. Theory Appl. 26 (1978) 569-580. Zbl0373.90085MR526653
- [7] G.R. Bitran, Linear Multiple Objective Programs with zero-one variables. Math. Programming 13 (1977) 121-139. Zbl0377.90070MR484391
- [8] J.G. Ecker and I.A. Kouada, Finding Efficient Points for Multi-Objective Linear Programs. Math. Programming 8 (1975) 375-377. Zbl0385.90105MR371391
- [9] J.G. Ecker and I.A. Kouada, Finding All Efficient Extreme Points for Multi-Objective Linear Programs. Math. Programming 14 (1978) 249-261. Zbl0385.90105MR469256
- [10] R. Gupta and R. Malhotra, Multi-Criteria Integer Linear Programming Problem. Cahiers Centre Études Rech. Opér. 34 (1992) 51-68. Zbl0774.90070MR1199194
- [11] A.T. Hamdy, Integer Programming, Theory, Applications and Computations. Academic Press (1975). Zbl0316.90042MR416577
- [12] H. Isermann, The Enumeration of the set of all Efficient solutions for a Linear Multiple Objective Program. Oper. Res. Quarterly 28/3 (1977) 711-725. Zbl0372.90086
- [13] D. Klein and E. Hannan, An Algorithm for the Multiple Objective Integer Linear Programming Problem. Eur. J. Oper. Res. 9 (1982) 378-385. Zbl0477.90075MR655095
- [14] J. Philip, Algorithms for the Vector Maximization Problem. Math. Programming 2 (1972) 207-229. Zbl0288.90052MR302205
- [15] B. Roy, Problems and methods with Multiple Objective functions. Math. Programming 2 (1972) 207-229. Zbl0254.90061MR1552721
- [16] R.E. Steuer, Multiple Criteria Optimization theory, Computation and Applications. Wiley, New York (1985). Zbl0663.90085MR836977
- [17] J. Teghem and P.L. Kunsh, A Survey of Techniques for Finding Efficient Solutions. Asia-Pacific J. Oper. Res. 3 (1986) 95-108. Zbl0616.90045
- [18] E.L. Ulungu and J. Teghem, Multi-Objective Combinatorial Optimization Problem: A Survey. J. Multi-Criteria Decision Anal. 3 (1994) 83-104. Zbl0853.90098
- [19] V. Verma, Constrained Integer Linear Fractional Programming Problem. Optimization 21 (1990) 749-757. Zbl0717.90073MR1072476
- [20] P.L. Yu, Multiple Criteria Decision Making. Plenum, New York (1985). Zbl0643.90045MR812059
- [21] M. Zeleny and P.L. Yu, The set of all non-dominated solutions in linear cases and Multi-criteria simplex method. J. Math. Anal. Appl. 49 (1975) 430-468. Zbl0313.65047MR421660
- [22] S. Zionts, Integer Programming with Multiple Objectives. Ann. Discrete Math. 1 (1977) 551-562. Zbl0363.90082

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.