Skip to main content
Springer Nature Link
Log in

Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization

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

Abstract

This paper studies \(\varepsilon \)-efficiency in multiobjective optimization by using the so-called coradiant sets. Motivated by the nonlinear separation property for cones, a similar separation property for coradiant sets is investigated. A new notion, called Bishop–Phelps coradiant set is introduced and some appropriate properties of this set are studied. This paper also introduces the notions of \(\varepsilon \)-dual and augmented \(\varepsilon \)-dual for Bishop and Phelps coradiant sets. Using these notions, some scalarization and characterization properties for \(\varepsilon \)-efficient and proper \(\varepsilon \)-efficient points are proposed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Bishop, E., Phelps, R.R.: The support functionals of a convex set. Proc. Sympos. Pure Math. 7, 27–35 (1962)

    Article  MATH  Google Scholar 

  2. Dentcheva, D., Helbig, S.: On variational principles, level sets, well-posedness, and \(\varepsilon -\)solutions in vector optimization. J. Optim. Theory Appl. 89(2), 325–349 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2000)

    Book  MATH  Google Scholar 

  4. Eichfelder, G.: Adaptive Scalarization Methods in Moltiobjective Optimization. Springer-verlag, Berlin (2008)

    Book  MATH  Google Scholar 

  5. Flores-Bazan, F., Hernandez, E.: Optimality conditions for a unified vector optimization problem with not necessarily preordering relations. J. Global Optim. 56(2), 299–315 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gutierrez, C., Jimenez, B., Novo, V.: Multiplier rules and saddle-point theorems for Helbigs approximate solutions in convex Pareto problems. J. Global Optim. 32(3), 367–383 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gutierrez, C., Jimenez, B., Novo, V.: On approximate efficiency in multiobjective programming. Math. Methods Oper. Res. 64, 165–185 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gutierrez, C., Jimenez, B., Novo, V.: A unified approach and optimality conditions for approximate solutions of vector optimization problems. SIAM J. Optim. 17, 688–710 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Helbig, S.: On a New Concept for \(\varepsilon \)-Efficiency: talk at “Optimization Days 1992”, Montreal (1992)

  10. Idrissi, H., Loridan, P., Michelot, C.: Approximation of solutions for location problems. J. Optim. Theory Appl. 56(1), 127–143 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Isac, G.: The Ekelands principle and the Pareto \(\varepsilon -\)efficiency. Lect. Notes Econom. Math. Syst. 432, 148–163 (1996)

    Article  MATH  Google Scholar 

  12. Kasimbeyli, R.: A conic scalarization method in multi-objective optimization. J. Global Optim. 56(2), 279–297 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kasimbeyli, R.: A nonlinear cone separation theorem and scalarization in nonconvex vector optimization. SIAM J. Optim. 20, 1591–1619 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kasimbeyli, R., Kasimbeyli, N.: The nonlinear separation theorem and a representation theorem for Bishop Phelps Cones. In: Modelling, Computation and Optimization in Information Systems and Management Sciences. Springer International Publishing. 419–430 (2015)

  15. Kutateladze, S.S.: Convex \(\varepsilon -\)programming. Soviet Math. Dokl. 20(2), 391–393 (1979)

    MATH  Google Scholar 

  16. Liu, J.C.: \(\varepsilon \)-duality theorem of nondifferentiable nonconvex multiobjective programming. J. Optim. Theory Appl. 69(1), 153–167 (1991)

    Article  MathSciNet  Google Scholar 

  17. Loridan, P.: \(\varepsilon \)-solutions in vector minimization problems. J. Optim. Theory Appl. 43(2), 265–276 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  18. Loridan, P.: \(\varepsilon \)-duality theorem of nondifferentiable nonconvex multiobjective programming. J. Optim. Theory Appl. 74(3), 565–566 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  19. Miettinen, K.M.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston (1999)

    MATH  Google Scholar 

  20. Ruhe, L.G., Fruhwirth, G.B.: \(\varepsilon \)-optimality for bicriteria programs and its application to minimum cost flows. Computing 44(1), 21–34 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  21. Salz, W.: Eine topologische Eigenschaft der effizienten Punkte konvexer Mengen. Oper. Res. Verfahren XXIII. 23, 197–202 (1976)

    MathSciNet  MATH  Google Scholar 

  22. Sayadi-Bander, A., Pourkarimi, L., Basirzadeh, H.: On Convex Coradiant Set. (under review)

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

    MATH  Google Scholar 

  24. Tammer, C.: Ageneralization of Ekelands variational principle. Optimization 25, 129–141 (1992)

    Article  MathSciNet  Google Scholar 

  25. Tanaka, T.: A new approach to approximation of solutions in vector optimization problems. In: Proceedings of APORS. World Scientific Publishing, Singapore, 497–504 (1995)

  26. Valyi, I.: Approximate saddle-point theorems in vector optimization. J. Optim. Theory Appl. 55(3), 435–448 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  27. White, D.J.: Epsilon efficiency. J. Optim. Theory Appl. 49, 319–337 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Mathematical Sciences and Computer, Shahid Chamran University of Ahvaz, Ahvaz, Iran

    Abbas Sayadi-bander & Hadi Basirzadeh

  2. Department of Mathematics, Razi University, Kermanshah, Iran

    Latif Pourkarimi

  3. Department of Industrial Engineering, Anadolu University, Iki Eylul Campus, 26555, Eskisehir, Turkey

    Refail Kasimbeyli

Authors
  1. Abbas Sayadi-bander
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Latif Pourkarimi
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Refail Kasimbeyli
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Hadi Basirzadeh
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Latif Pourkarimi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sayadi-bander, A., Pourkarimi, L., Kasimbeyli, R. et al. Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization. J Glob Optim 68, 587–600 (2017). https://doi.org/10.1007/s10898-016-0495-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-016-0495-4

Keywords