.png){kind=icon}
.png){kind=icon}
Return
An interactive analytic center trade-off cutting plane algorithm for multiobjective linear programming
.png){kind=icon}
PRE
AI
DOI：10.1016/S0360-8352(00)00026-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes the use of an interior point algorithm for Multiobjective Linear Programming problems. At each iteration of the algorithm, the decision maker furnishes his precise trade-offs. From these trade-offs, a cut is formed in the objective space. This cut induces a cut in the decision space that defines a half-space of promising points. We compute the analytic center of the restricted feasible region in the decision space and then we calculate the trade-offs of the decision maker at the image of the analytic center in the objective space. Therefore, we obtain a trajectory of analytic centers that converges to the best compromise solution. Since the proposed algorithm moves through the interior of the feasible region, it avoids the combinatorial difficulties of visiting extreme points and is less sensitive to problem size. We illustrate the method through a numerical example and provide computational experience. (C) 2000 Elsevier Science Ltd. All rights reserved.
Keywords:
multiple objective linear programming
interactive methods
trade-off cutting plane
interior point algorithm
method of analytic centers
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.5
Papers:
1.0W
Citations:
3.8W
Organization
No organization information available