Skip to main content
SpringerLink
Log in

An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1) that has both nonlinear objective functions and a convex, nonpolyhedral feasible region. The algorithm uses a branch and bound search in the outcome space of problem (V1), rather than in the decision space of the problem, to find a global optimal solution. Since the dimension of the outcome space is usually much smaller than the dimension of the decision space, often by one or more orders of magnitude, this approach can be expected to considerably shorten the search. In addition, the algorithm can be easily modified to obtain an approximate global optimal weakly efficient solution after a finite number of iterations. Furthermore, all of the subproblems that the algorithm must solve can be easily solved, since they are all convex programming problems. The key, and sometimes quite interesting, convergence properties of the algorithm are proven, and an example problem is solved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. An L.T.H., Tao P.D., 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)

    Article  Google Scholar 

  2. An L.T.H., Dinh T.P., Muu L.D.: Simplicially-constrained DC optimization over efficient and weakly efficient sets. J. Optim. Theory Appl. 117, 503–531 (2003)

    Article  Google Scholar 

  3. Arrow K.J., Barankin E.W., Blackwell D.: Admissible points of convex sets. In: Kuhn, H.W., Tucker, A.W. (eds) Contributions to the Theory of Games, pp. 87–91. Princeton University Press, Princeton (1953)

    Google Scholar 

  4. Bazaraa M.S., Sherali H.D., Shetty C.M.: Nonlinear Programming—Theory and Algorithms. Wiley, New York (1993)

    Google Scholar 

  5. Benson H.P.: Optimization over the efficient set. J. Math. Anal. Appl. 98, 562–580 (1984)

    Article  Google Scholar 

  6. Benson H.P.: An algorithm for optimizing over the weakly efficient set. Eur. J. Oper. Res. 25, 192–199 (1986)

    Article  Google Scholar 

  7. Benson H.P.: An all-linear programming relaxation algorithm for optimizing over the efficient set. J. Glob. Optim. 1, 82–104 (1991)

    Article  Google Scholar 

  8. Benson H.P.: A finite, non-adjacent extreme point search algorithm for optimization over the efficient set. J. Optim. Theory Appl. 73, 47–64 (1992)

    Article  Google Scholar 

  9. Benson H.P.: A global optimization approach for generating efficient points for multiobjective concave fractional programs. J. Multi Criteria Decis. Anal. 13, 15–28 (2005)

    Article  Google Scholar 

  10. Borwein J.: On the existence of Pareto efficient points. Math. Oper. Res. 8, 64–73 (1983)

    Article  Google Scholar 

  11. Dessouky M., Ghiassi M., Davis W.J.: Estimates of the minimum nondominated criterion values in multiple-criteria decision-making. Eng. Costs Prod. Econ. 10, 95–104 (1986)

    Google Scholar 

  12. Ecker J.G., Song J.H.: Optimizing a linear function over an efficient set. J. Optim. Theory Appl. 83, 541–563 (1994)

    Article  Google Scholar 

  13. Ehrgott M.: Multicriteria Optimization. Springer, Berlin (2005)

    Google Scholar 

  14. Fulop J.: A cutting plane algorithm for linear optimization over the efficient set. In: Komlosi, S., Rapcsak, T., Schaible, S. (eds) Generalized Convexity, pp. 374–385. Springer, Berlin (1994)

    Google Scholar 

  15. Geoffrion A.M.: Duality in nonlinear programming: a simplified applications-oriented development. SIAM Rev. 13, 1–37 (1971)

    Article  Google Scholar 

  16. Horst R.: An algorithm for nonconvex programming problems. Math. Prog. 10, 312–321 (1976)

    Article  Google Scholar 

  17. Horst R., Thoai N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1–43 (1999)

    Article  Google Scholar 

  18. Horst R., Thoai N.V.: Maximizing a concave function over the efficient or weakly efficient set. Eur. J. Oper. Res. 117, 239–252 (1999)

    Article  Google Scholar 

  19. Isermann H., Steuer R.E.: Computational experience concerning payoff tables and minimum criterion values over the efficient set. Eur. J. Oper. Res. 33, 91–97 (1987)

    Article  Google Scholar 

  20. Kim N.T.B.: An algorithm for optimizing over the efficient set. Vietnam J. Math. 28, 329–340 (2000)

    Google Scholar 

  21. Konno H., Inori M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143–158 (1989)

    Google Scholar 

  22. Konno H., Thach P.T., Tuy H.: Optimization on Low Rank Nonconvex Structures. Kluwer, Dordrecht (1997)

    Google Scholar 

  23. LINGO 9.0, Lingo Systems, Inc.: Lingo, Chicago (2010)

  24. Luc D.T.: Theory of Vector Optimization. Springer, Berlin (1989)

    Google Scholar 

  25. Luc L.T.: Reverse polyblock approximation for optimizing over the weakly efficient set and efficient set. Acta Math. Vietnam. 26, 65–80 (2001)

    Google Scholar 

  26. Miettinen K.M.: Nonlinear Multiobjective Optimization. Kluwer, Boston (1999)

    Google Scholar 

  27. Muu L.D.: A convex-concave programming method for optimizing over the efficient set. Acta Math. Vietnam. 25, 67–85 (2000)

    Google Scholar 

  28. Phong T.Q., Tuyen J.Q.: Bisection search algorithm for optimizing over the efficient set. Vietnam J. Math. 28, 217–226 (2000)

    Google Scholar 

  29. Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    Google Scholar 

  30. Sawaragi Y., Nakayama H., Tanino T.: Theory of Multiobjective Optimization. Academic Press, Orlando (1985)

    Google Scholar 

  31. Sosa W., Raupp F.: On minimization over weakly efficient sets. Optimization 56, 207–219 (2007)

    Article  Google Scholar 

  32. Steuer R.E.: Multiple Criteria Optimization: Theory, Computation, and Application. Wiley, New York (1986)

    Google Scholar 

  33. 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)

    Article  Google Scholar 

  34. Thoai N.V.: Conical algorithm in global optimization for optimizing over efficient sets. J. Glob. Optim. 18, 321–336 (2000)

    Article  Google Scholar 

  35. Tuy H.: Convex Analysis and Global Optimization. Kluwer, Dordrecht (1998)

    Google Scholar 

  36. Tuy H.: Robust solution of nonconvex global optimization problems. J. Glob. Optim. 32, 307–323 (2005)

    Article  Google Scholar 

  37. Tuy H., Phuong N.T.H.: Optimization under composite monotonic constraints and constrained optimization over efficient sets. In: Liberti, L., Maculan, N. (eds) Global Optimization, pp. 3–31. Springer, New York (2006)

    Chapter  Google Scholar 

  38. Tuyen H.Q., Muu L.D.: Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem. Oper. Res. Lett. 28, 81–92 (2001)

    Article  Google Scholar 

  39. Weistroffer H.R.: Careful usage of pessimistic values is needed in multiple objectives optimization. Oper. Res. Lett. 4, 23–25 (1985)

    Article  Google Scholar 

  40. Yamada S., Tanino T., Inuiguchi M.: An inner approximation method for optimization, over the weakly-efficient set. J. Glob. Optim. 16, 197–217 (2000)

    Article  Google Scholar 

  41. Yamada S., Tanino T., Inuiguchi M.: An inner approximation method incorporating a branch and bound procedure for optimization over the weakly-efficient set. Eur. J. Oper. Res. 133, 267–286 (2001)

    Article  Google Scholar 

  42. Yamamoto Y.: Optimization over the efficient set: overview. J. Glob. Optim. 22, 285–317 (2002)

    Article  Google Scholar 

  43. Yu P.L.: Multiple-Criteria Decision Making. Plenum, New York (1985)

    Google Scholar 

  44. Zeleny M.: Multiple Criteria Decision Making. McGraw-Hill, New York (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems and Operations Management, University of Florida, Gainesville, FL, 32611-7169, USA

    Harold P. Benson

Authors
  1. Harold P. Benson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harold P. Benson.

Additional information

Dedicated to the memory of my dear friend and mentor, Dr. Reiner Horst.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benson, H.P. An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem. J Glob Optim 52, 553–574 (2012). https://doi.org/10.1007/s10898-011-9786-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9786-y

Keywords

Search

Navigation