An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs

Management Science

Volumn 56, Issue 12, 2010, Pages 2302-2315

  Özpeynirci, Özgür ^a   Köksalan, Murat ^b  

^a IZMIR UNIVERSITY OF ECONOMICS   (Turkey)

^b MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Exact algorithm; Multiobjective optimization; Nondominated points

Indexed keywords

COMPOSITE LINEAR; COMPUTATIONAL PERFORMANCE; EXACT ALGORITHMS; FINITE NUMBER; MIXED-INTEGER PROGRAMS; MULTI OBJECTIVE; NONDOMINATED POINTS; OBJECTIVE FUNCTIONS; TRAVELING SALESPERSON PROBLEM;

ALGORITHMS; INTEGER PROGRAMMING;

MULTIOBJECTIVE OPTIMIZATION;

EID: 78650318900     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1100.1248     Document Type: Article

References (15)

1. Aneja, Y. P., K. P. Nair. 1979. Bicriteria transportation problem. Management Sci. 25(1) 73-78.
2. Benson, H. P., E. Sun. 2000. Outcome space partition of the weight set in multiobjective linear programming. Optim. Theory Appl. 105(1) 17-36.
3. Benson, H. P., E. Sun. 2002. A weight decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program. Eur. J. Oper. Res. 139(1) 26-41.
4. Cohon, J. L. 1978. Multiobjective Programming and Planning. Academic Press, New York.
5. Ehrgott, M. 2005. Multicriteria Optimization, 2nd ed. Springer, Berlin.
6. Kalai, G. 1995. Some aspects of the combinatorial theory of convex polytopes. T. Bisztriczky, P. McMullen, R. Schneider, A. I. Weiss, eds. Polytopes, Abstract Convex and Computational. Springer, Berlin, 205-230.
7. Nemhauser, G., L. A. Wolsey. 1988. Integer and combinatorial optimization. John Wiley & Sons, New York.
8. Özpeynirci, Ö. 2008. Approaches for multiobjective combinatorial optimization problems. Ph. D. thesis, Middle East Technical University, Ankara, Turkey.
9. Phelps, S. P., M. Köksalan. 2003. An interactive evolutionary metaheuristic for multiobjective combinatorial optimization. Management Sci. 49(12) 1726-1738.
10. Przybylski, A., X. Gandibleux, M. Ehrgott. 2010. A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J. Comput. 22(3) 371-386.
11. Solanki, R. S., P. A. Appino, J. L. Cohon. 1993. Approximating the noninferior set in multiobjective linear programming problems. Eur. J. Oper. Res. 68(3) 356-373.
12. Steuer, R. E. 1986. Multiple Criteria Optimization: Theory, Computation and Application. John Wiley & Sons, New York.
13. Steuer, R. E. 1989. ADBASE Multiple Objective Linear Programming Package. Department of Management Science and Information Technology, University of Georgia, Athens.
14. Tenfelde-Podehl, D. 2003. A recursive algorithm for multiobjective combinatorial problems with Q criteria. Technical report, University of Graz, Graz, Austria.
15. Visee, M., J. Teghem, M. Pirlot, E. L. Ulungu. 1998. Two-phases method and branch and bound procedures to solve the biobjective knapsack problem. J. Global Optim. 12(2) 139-155.