An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs

In this paper, we present an exact algorithm to find all extreme supported nondominated points of multiobjective mixed integer programs. The algorithm uses a composite linear objective function and finds all the desired points in a finite number of steps by changing the weights of the objective functions in a systematic way. We develop further variations of the algorithm to improve its computational performance and demonstrate our algorithm's performance on multiobjective assignment, knapsack, and traveling salesperson problems with three and four objectives.

• 저널Management Science · 56(12) · 2302–2315
• 토픽Optimization and Mathematical Programming · Control and Systems Engineering
• DOI10.1287/mnsc.1100.1248
• 저자Özgür Özpeynirci, Murat Köksalan