Title: An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
Authors: Alves, Maria João 
Clímaco, João 
Issue Date: 2000
Citation: European Journal of Operational Research. 124:3 (2000) 478-494
Abstract: We propose an interactive reference point approach for multiple objective (mixed) integer linear programming problems that exploits the use of branch-and-bound techniques for solving the scalarizing programs. At each dialogue phase, the decision maker must specify a criterion reference point or just choose an objective function he/she wants to improve in respect to the previous efficient (nondominated) solution. In the latter case, a directional search is performed adjusting automatically the reference point used at each stage. Tchebycheff mixed-integer scalarizing programs are successively solved by branch-and-bound. Postoptimality techniques have been developed enabling the algorithm to profit from previous computations to solve the next scalarizing programs. The previous branch-and-bound tree is used as a starting point and operations of simplification and branching are then performed to obtain a new efficient solution. Computational results have shown that this approach is effective for carrying out directional or local searches for efficient solutions.
URI: http://hdl.handle.net/10316/5505
Rights: openAccess
Appears in Collections:FEUC- Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat 
file10fc7d88e1be4f8c83e34898e17de6ef.pdf317.09 kBAdobe PDFView/Open
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.