Abstract
The problem of minimizing a convex function over the difference of two convex sets is called ‘reverse convex program’. This is a typical problem in global optimization, in which local optima are in general different from global optima. Another typical example in global optimization is the optimization problem over the efficient set of a multiple criteria programming problem. In this article, we investigate some special cases of optimization problems over the efficient set, which can be transformed equivalently into reverse convex programs in the space of so-called extreme criteria of multiple criteria programming problems under consideration. A suitable algorithm of branch and bound type is then established for globally solving resulting problems. Preliminary computational results with the proposed algorithm are reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Philip, J.: Algorithms for the vector maximization problem. Math. Program. 2, 207–229 (1972)
Benson, H.P.: Optimization over the efficient set. J. Math. Anal. Appl. 98, 562–580 (1984)
Benson, H.P.: An all-linear programming relaxation algorithm for optimizing over the efficient set. J. Glob. Optim. 1, 83–104 (1991)
Benson, H.P.: A geometrical analysis of the outcome set in multiple objective convex programs with linear criterion functions. J. Glob. Optim. 6, 231–251 (1995)
Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problems. J. Glob. Optim. 13, 1–24 (1998)
Benson, H.P., Lee, D.: Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. J. Optim. Theory Appl. 88, 77–105 (1996)
Dauer, J.P., Fosnaugh, T.A.: Optimization over the efficient set. J. Glob. Optim. 7, 261–277 (1995)
Fülöp, J.: A cutting plane algorithm for linear optimization over the efficient set. In: Komlösi, S., Rapcsàk, T., Schaible, S. (eds.) Generalized Convexity. Lecture Notes in Economics and Mathematical Systems, vol. 405, pp. 374–385. Springer, Berlin (1994)
Horst, R., Thoai, N.V.: Maximizing a concave function over the efficient or Weakly-efficient set. Eur. J. Oper. Res. 117, 239–252 (1999)
Horst, R., Thoai, N.V., Benson, H.P.: Concave minimization via conical partitions and polyhedral outer approximation. Math. Program. 50, 259–274 (1991)
Horst, R., Thoai, N.V., Yamamoto, Y., Zenke, D.: On optimization over the efficient set in linear multicriteria programming. J. Optim. Theory Appl. 134, 433–443 (2007)
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.: A convergent algorithm for solving linear programs with an additional reverse convex constraint. Kibernetika 21, 428–435 (1985)
Muu, L.D., Luc, L.T.: On equivalence between convex maximization and optimization over the efficient set. Vietnam J. Math. 24, 439–444 (1996)
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)
Thoai, N.V.: Decomposition branch and bound algorithm for optimization problems over efficient sets. J. Ind. Manag. Optim. 4, 647–660 (2008)
Yamamoto, Y.: Optimization over the efficient set: overview. J. Glob. Optim. 22, 285–317 (2002)
Steuer, R.E.: Multiple Criteria Optimization: Theory, Computation, Applications. Wiley, New York (1985)
Yu, P.L.: Multiple Criteria Decision Making: Concepts, Techniques and Extensions. Plenum, New York (1985)
Hillestad, R.J.: Optimization problems subject to a budget constraint with economies of scale. Oper. Res. 23, 707–713 (1975)
Hillestad, R.J., Jacobsen, S.E.: Reverse convex programming. Appl. Math. Optim. 6, 63–67 (1980)
Hillestad, R.J., Jacobsen, S.E.: Linear programs with an additional reverse convex constraint. Appl. Math. Optim. 6, 257–269 (1980)
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, 2nd edn. Kluwer, Dordrecht (2000)
Horst, R., Phong, T.Q., Thoai, N.V.: On solving general reverse convex programming problems by a sequence of linear programs and line searches. Ann. Oper. Res. 25, 1–18 (1990)
Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1–43 (1999)
Thoai, N.V.: Canonical DC-programming techniques for solving a convex program with an additional constraint of multiplicative type. Computing 50, 241–253 (1993)
Thuong, N.V., Tuy, H.: A finite algorithm for solving linear programs with an additional reverse convex constraint, nondifferentiable optimization. In: Demyannov, V., Pallaschke, H. (eds.) Lecture Notes in Economics and Mathematical Systems, vol. 225, pp. 291–302. Springer, Berlin (1984)
Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Nonlinear Parametric Optimization. Birkhaeuser, Basel (1983)
Thoai, N.V., Tuy, H.: Convergent algorithms for minimizing a concave function. Math. Oper. Res. 5, 556–566 (1980)
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 2nd edn. Wiley, New York (1993)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J.-C. Yao.
Rights and permissions
About this article
Cite this article
Thoai, N.V. Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets. J Optim Theory Appl 147, 263–277 (2010). https://doi.org/10.1007/s10957-010-9721-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-010-9721-2