Skip to main content
Log in

Explicitly quasiconvex set-valued optimization

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

Abstract

The principal aim of this paper is to extend some recent results concerning the contractibility of efficient sets and the Pareto reducibility in multicriteria explicitly quasiconvex optimization problems to similar vector optimization problems involving set-valued objective maps. To this end, an appropriate notion of generalized convexity is introduced for set-valued maps taking values in a partially ordered real linear space, which naturally extends the classical concept of explicit quasiconvexity of real-valued functions. Actually, the class of so-called explicitly cone-quasiconvex set-valued maps in particular contains the cone-convex set-valued maps, and it is contained in the class of cone-quasiconvex set-valued maps.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Adán M., Novo V. (2003). Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. Eur. J. Oper. Res. 149, 641–653

    Article  Google Scholar 

  • Aubin J.-P., Frankowska H. (1990) Set-Valued Analysis. Birkhäuser, Boston

    Google Scholar 

  • Benoist J. (1998) Connectedness of the efficient set for strictly quasiconcave sets. J. Optim. Theory Appl. 96, 627–654

    Article  Google Scholar 

  • Benoist J. (2003) Contractibility of efficient frontier of simply shaded sets. J. Glob. Optim. 25, 321–335

    Article  Google Scholar 

  • Benoist J., Borwein J.M., Popovici N. (2003) A characterization of quasiconvex vector-valued functions. Proc. Am. Math. Soc. 131, 1109–1113

    Article  Google Scholar 

  • Benoist J., Popovici N. (2000) The structure of the efficient frontier of finite-dimensional completely-shaded sets. J. Math. Anal. Appl. 250, 98–117

    Article  Google Scholar 

  • Benoist J., Popovici N. (2001) Contractibility of the efficient frontier of three-dimensional simply-shaded sets. J. Optim. Theory Appl. 111, 81–116

    Article  Google Scholar 

  • Borwein J.M. (1977) Multivalued convexity and optimization: a unified approach to inequality and equality constraints. Mathe. Program. 13, 183–199

    Article  Google Scholar 

  • Daniilidis A., Hadjisavvas N., Schaible S. (1997) Connectedness of the efficient set for three-objective quasiconcave maximization problems. J. Optim. Theory Appl. 93, 517–524

    Article  Google Scholar 

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

    Google Scholar 

  • Göpfert A., Riahi H., Tammer C., Zălinescu C. (2003) Variational Methods in Partially Ordered Spaces. Springer-Verlag, New York

    Google Scholar 

  • Hiriart-Urruty J.-B. (1985) Images of connected sets by semicontinuous multifunctions. J. Math. Anal. Appl. 111, 407–422

    Article  Google Scholar 

  • Huy N.Q., Yen N.D. (2005) Contractibility of the solution sets in strictly quasiconcave vector maximization on noncompact domains, J. Optim. Theory Appl. 124, 615–635

    Article  Google Scholar 

  • Jahn J. (1986) Mathematical Vector Optimization in Partially Ordered Linear Spaces. Verlag Peter Lang, Frankfurt am Main

    Google Scholar 

  • Jeyakumar V., Oettli W., Natividad M. (1993) A solvability theorem for a class of quasiconvex mappings with applications to optimization. J. Math. Anal. Appl 179, 537–546

    Article  Google Scholar 

  • Kuroiwa D. (1996) Convexity for set-valued maps. Appl. Math. Lett. 9, 97–101

    Article  Google Scholar 

  • Lowe T.J., Thisse J.-F., Ward J.E., Wendell R.E. (1984) On efficient solutions to multiple objective mathematical programs. Manage. Sci. 30, 1346–1349

    Article  Google Scholar 

  • Luc D.T. (1989) Theory of Vector Optimization. Springer-Verlag, Berlin

    Google Scholar 

  • Luc D.T. (1990) On three concepts of quasiconvexity in vector optimization. Acta Math. Vietnamica 15, 3–9

    Google Scholar 

  • Malivert C., Boissard N. (1994) Structure of efficient sets for strictly quasi-convex objectives. J. Convex Anal. 1, 143–150

    Google Scholar 

  • Peleg B. (1972) Topological properties of the efficient point set. Proc. Am. Math. Soc. 35, 531–536

    Article  Google Scholar 

  • Popovici N. (2005) Pareto reducible multicriteria optimization problems. Optimization 54, 253–263

    Article  Google Scholar 

  • Rubinov A. (2000) Abstract Convexity and Global Optimization. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

  • Schaible S. (1985) Bicriteria quasiconcave programs. Cahiers du Centre d’Etudes de Recherche Operationnelle 27, 213–220

    Google Scholar 

  • Sun E.J. (1996) On the connectedness of the efficient set for strictly quasiconvex vector minimization problems. J. Optim. Theory Appl. 89, 475–481

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicolae Popovici.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Popovici, N. Explicitly quasiconvex set-valued optimization. J Glob Optim 38, 103–118 (2007). https://doi.org/10.1007/s10898-006-9085-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-006-9085-1

Keywords

Mathematics Subject Classification (2000)

Navigation