The efficient set of a linear multicriteria programming problem can be represented by a reverse convex constraint of the form g(z)≤0, where g is a concave function. Consequently, the problem of optimizing some real function over the efficient set belongs to an important problem class of global optimization called reverse convex programming. Since the concave function used in the literature is only defined on some set containing the feasible set of the underlying multicriteria programming problem, most global optimization techniques for handling this kind of reverse convex constraint cannot be applied. The main purpose of our article is to present a method for overcoming this disadvantage. We construct a concave function which is finitely defined on the whole space and can be considered as an extension of the existing function. Different forms of the linear multicriteria programming problem are discussed, including the minimum maximal flow problem as an example.
Multicriteria optimization Optimization over the efficient set Global optimization Reverse convex constraint Minimum maximal flow problem
This is a preview of subscription content, log in to check access.
Le-Thi, H.A., Pham, D.T., Muu, L.D.: Numerical solution for optimization over the efficient set by D.C. optimization algorithms. Oper. Res. Lett. 19, 117–128 (1996)
Muu, L.D., Luc, L.T.: On equivalence between convex maximization and optimization over the efficient set. Vietnam J. Math. 24, 439–444 (1996)
Horst, R., Thoai, N.V.: Utility function programs and optimization over the efficient set in multiple objective decision making. J. Optim. Theory Appl. 92, 469–486 (1997)
Horst, R., Thoai, N.V.: Maximizing a concave function over the efficient or weakly-efficient set. Eur. J. Oper. Res. 117, 239–252 (1999)
Thoai, N.V.: A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem. Eur. J. Oper. Res. 122, 58–68 (2000)
Thoai, N.V.: Conical algorithm in global optimization for optimizing over efficient sets. J. Glob. Optim. 18, 321–336 (2000)
Thoai, N.V.: Convergence and application of a decomposition method using duality bounds for nonconvex global optimization. J. Optim. Theory Appl. 113, 165–193 (2002)
Le-Thi, H.A., Pham, D.T., Thoai, N.V.: Combination between global and local methods for solving an optimization problem over the efficient set. Eur. J. Oper. Res. 142, 258–270 (2002)