A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs

European Journal of Operational Research

Volumn 180, Issue 3, 2007, Pages 1011-1027

  Sylva, John ^a   Crema, Alejandro ^b  

^a UNIVERSIDAD CENTRAL DE VENEZUELA   (Venezuela)

^b FACULTAD DE CIENCIAS   (Venezuela)

Author keywords

Integer programming; Multiple objective programming; Parametric programming

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; SET THEORY; VECTORS;

INFINITY NORM DISTANCE; MULTIPLE OBJECTIVE PROGRAMMING; NON DOMINATED VECTORS; PARAMETRIC PROGRAMMING;

INTEGER PROGRAMMING;

EID: 33847070033     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.02.049     Document Type: Article

References (17)

1. Alves M.J., and Clímaco J. An interactive reference point approach for multiobjective mixed-integer programming using branch and bound. European Journal of Operational Research 124 3 (2000) 478-494
2. Bitran G.R. Linear multiple objective programs with zero-one variables. Mathematical Programming 13 1 (1977) 121-139
3. Climaco J., Ferreira C., and Captivo M.E. Multicriteria integer programming: An overview of different algorithmic approaches. In: Climaco J. (Ed). Multicriteria Analysis (1997), Springer-Verlag, Berlin 248-258
4. Ecker J.G., Hegner N.S., and Kouada I.A. Generating all maximal efficient faces for multiple objective linear programs. Journal of Optimization Theory and Applications 30 (1980) 353-381
5. Gal T. A general method for determining the set of all efficient solutions to a linear vector maximum problem. European Journal of Operational Research 1 5 (1977) 307-322
6. IBM. Optimization Subroutine Library Release 2.1, 1992.
7. Isermann H. The enumeration of the set of all efficient solutions for a linear multiple objective program. Operational Research Quarterly 28 (1977) 711-725
8. Karaivanova J., Narula S., and Vassilev V. An interactive algorithm for integer programming. European Journal of Operational Research 68 3 (1993) 344-351
9. Klein D., and Hannan E. An algorithm for the multiple objective integer linear programming problem. European Journal of Operational Research 9 4 (1982) 378-385
10. Mavrotas G., and Diakoulaki D. A branch and bound algorithm for mixed zero-one multiple objective linear programming. European Journal of Operational Research 107 3 (1998) 530-541
11. Rasmussen L.M. Zero-one programming with multiple criteria. European Journal of Operational Research 26 1 (1986) 83-95
12. Sayin S. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Mathematical Programming 87 3 (2000) 543-560
13. Sayin S. A procedure to find discrete representations of the efficient set with specified coverage errors. Operations Research 51 3 (2003) 427-436
14. Steuer R.E. Multiple Criteria Optimization-Theory, Computation and Application (1986), John Wiley and Sons
15. Sylva J., and Crema A. A method for finding the set of nondominated vectors for multiple objective integer linear programs. European Journal of Operational Research 158 1 (2004) 46-55
16. Teghem J., and Kunsch P.L.J. A survey of techniques for finding efficient solutions to multi-objective integer linear programming. Asia-Pacific Journal of Operational Research 3 (1986) 95-108
17. Ulungu E.L., and Teghem J. Multi-objective combinatorial optimization problems: A survey. Journal of Multi-Criteria Decision Analysis 3 (1994) 83-104