A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version … Read more
In this paper we study the relationship between bilevel optimization and bicriteria optimization. Given a bilevel optimization problem, we introduce an order relation such that the optimal solutions of the bilevel problem are the nondominated points with respect to the order relation. In the case where the lower level problem of the bilevel optimization problem … Read more
In multicriteria optimization, several objective functions have to be minimized simultaneously. For this kind of problem, no single solution can adequately represent the whole set of optimal points. We propose a new efficient method for approximating the solution set of a convex quadratic multiobjective programming problem. The method is based on a warm-start interior point … Read more