Skip to main content
SpringerLink
Log in

Generating the weakly efficient set of nonconvex multiobjective problems

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

Abstract

We present a method for generating the set of weakly efficient solutions of a nonconvex multiobjective optimization problem. The convergence of the method is proven and some numerical examples are encountered.

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. Armand P. (1993). Finding all maximal efficient faces in multiobjective linear programming. Math. Program. Ser. A 61: 357–375

    Article  Google Scholar 

  2. Benson H.P. (1979). Vector maximization with two objective functions. J. Optim. Theory Appl. 28: 253–257

    Article  Google Scholar 

  3. Benson H.P. (1998). An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Glob. Optim. 13: 1–24

    Article  Google Scholar 

  4. Benson H.P. and SUN E. (2000). Outcome space partition of the weight set in multiobjective linear programming. J. Optim. Theory Appl. 105: 17–36

    Article  Google Scholar 

  5. Chankong, V., Haimes, Y.Y.: Multiobjective Decision Making: Theory and Methodology. North- Holland Publishers (1983)

  6. Das I. and Dennis J.E. (1998). Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8: 631–657

    Article  Google Scholar 

  7. Debreu G. (1959). Theory of Value. John Wiley, New York

    Google Scholar 

  8. Jahn J. (2004). Vector Optimization: Theory, Applications and Extensions. Springer, Berlin

    Google Scholar 

  9. Kim N.T.B. and Luc D.T. (2000). Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming. Acta Mathematica Vietnamica 25: 101–124

    Google Scholar 

  10. Klamroth K., Tind J. and Wiecek M.M. (2002). Unbiased approximation in multicriteria optimization. Math. Methods Oper. Res. 56: 413–457

    Article  Google Scholar 

  11. Krasnoselskij M.A. (1964). Positive Solutions of Operator Equations. P.Noordhoff Ltd., Groningen

    Google Scholar 

  12. Lin J.G. (1975). Three methods for determining Pareto-optimal solutions of multiple-objective problems. In: Ho, Y.C. and Mitter, S.K. (eds) Large-Scale Systems, pp. Plenum Press, New York

    Google Scholar 

  13. Luc, D.T.: On scalarizing method in vector optimization. In: Fandel, G., Grauer, M., Kurzhanski, A., Wiersbicki, A.P. (eds.) Large-Scale Modelling and Interactive Decision Analysis. Proceedings, Eisenach 1985. LNEMS 273, pp. 46–51 (1986)

  14. Luc D.T. (1987). Scalarization of vector optimization problems. J. Optim. Theory Appl. 55: 85–102

    Article  Google Scholar 

  15. Luc D.T. (1989). Theory of Vector Optimization. Lectures Notes in Economics and Mathematical Systems 319. Springer-Verlag, Germany

    Google Scholar 

  16. Luc D.T., Phong T.Q. and Volle M. (2005). Scalarizing functions for generating the weakly efficient solution set in convex multiobjective problems. SIAM J. Optim. 15: 987–1001

    Article  Google Scholar 

  17. Luc D.T., Phong T.Q. and Volle M. (2006). A new duality approach to solving concave vector maximization problems. J. Glob. Optim. 36: 401–423

    Article  Google Scholar 

  18. Miettinen K. (1999). Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston

    Google Scholar 

  19. Pascoletti A. and Serafini P. (1984). Scalarizing vector optimization problems. J. Optim. Theory Appl. 42: 499–524

    Article  Google Scholar 

  20. Rakowska J., Hafka R.T. and Watson L.T. (1991). Tracing the efficient curve for multi-objective control- structure optimization. Comput. Syst. Eng. 2: 461–471

    Article  Google Scholar 

  21. Rubinov A.M. (1977). Sublinear operators and their applications. Russ. Math. Surv. 32: 115–175

    Article  Google Scholar 

  22. Ruzika S. and Wiecek M.M. (2005). Approximation methods in multiobjective programming. J. Optim. Theory Appl. 126: 473–501

    Article  Google Scholar 

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

    Google Scholar 

  24. (1997). Trends in Multicriteria Decision Making. Lectures Notes in Economics and Mathematical Systems 465. Springer, Berlin

    Google Scholar 

  25. Yu P.L. (1985). Multiple-Criteria Decision Making: Concepts, Techniques and Extensions. Plenum Press, New York

    Google Scholar 

  26. Zeleny M. (1974). Linear Multiobjective Programming. Springer Verlag, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Avignon, 33, rue Louis Pasteur, 84000, Avignon, France

    Daniel Gourion & Dinh The Luc

Authors
  1. Daniel Gourion
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dinh The Luc
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniel Gourion.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gourion, D., Luc, D.T. Generating the weakly efficient set of nonconvex multiobjective problems. J Glob Optim 41, 517–538 (2008). https://doi.org/10.1007/s10898-007-9263-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-007-9263-9

Keywords

AMS Subject Classification

Search

Navigation