Return
An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
DOI:10.1016/S0377-2217(99)00183-6.png)
Abstract
En 中文
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 serving 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 tatter 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. (C) 2000 Elsevier Science B.V. All rights reserved.
Keywords:
multi criteria analysis
mixed-integer linear programming
reference points
Tchebycheff metric
branch-and-bound
sensitivity analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
Portable, consumer‐grade pulse oximeters are accurate for home and medical use: Implications for use in the COVID‐19 pandemic and other resource‐limited environments
JACEP Open
IF0

