.png){kind=icon}
.png){kind=icon}
Return
Optimizing a linear function over the nondominated set of multiobjective integer programs
.png){kind=icon}
OA
AI
DOI：10.1111/itor.12627.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we develop two algorithms to optimize a linear function over the nondominated set of multiobjective integer programs. The algorithms iteratively generate nondominated points and converge to the optimal solution reducing the feasible set. The first algorithm proposes improvements to an existing algorithm employing a decomposition and search procedure in finding a new point. Differently, the second algorithm maximizes one of the criteria throughout the algorithm and generates new points by setting bounds on the linear function value. The decomposition and search procedure in the algorithms is accompanied by problem-specific mechanisms in order to explore the objective function space efficiently. The algorithms are designed to produce solutions that meet a prespecified accuracy level. We conduct experiments on multiobjective combinatorial optimization problems and show that the algorithms work well.
Keywords:
multiple objective programming
integer programming
nondominated set
combinatorial optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K