IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v107y2000i2d10.1023_a1026412918497.html
   My bibliography  Save this article

Connectedness of Cone Superefficient Point Sets in Locally Convex Topological Vector Spaces

Author

Listed:
  • Y. D. Hu

    (Wenzhou University)

  • C. Ling

    (Zhejiang Institute of Finance and Economics)

Abstract

This paper studies the connectedness of the cone superefficient point set in locally convex topological vector spaces. First, we prove a scalarization theorem for a cone superefficient point set. From this result, we obtain the connectedness of a cone superefficient point set under the conditions that the set is cone convex and cone weakly compact.

Suggested Citation

  • Y. D. Hu & C. Ling, 2000. "Connectedness of Cone Superefficient Point Sets in Locally Convex Topological Vector Spaces," Journal of Optimization Theory and Applications, Springer, vol. 107(2), pages 433-446, November.
    • Handle: RePEc:spr:joptap:v:107:y:2000:i:2:d:10.1023_a:1026412918497
    DOI: 10.1023/A:1026412918497
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1026412918497
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1026412918497?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. X. Y. Zheng, 1997. "Proper Efficiency in Locally Convex Topological Vector Spaces," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 469-486, August.
    2. J. Benoist, 1998. "Connectedness of the Efficient Set for Strictly Quasiconcave Sets," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 627-654, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yu Han & Nan-jing Huang, 2018. "Existence and Connectedness of Solutions for Generalized Vector Quasi-Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 65-85, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. E. K. Makarov & N. N. Rachkovski, 1999. "Unified Representation of Proper Efficiency by Means of Dilating Cones," Journal of Optimization Theory and Applications, Springer, vol. 101(1), pages 141-165, April.
    2. Fernando García-Castaño & Miguel Ángel Melguizo-Padial & G. Parzanese, 2023. "Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 367-382, June.
    3. J. H. Qiu & Y. Hao, 2010. "Scalarization of Henig Properly Efficient Points in Locally Convex Spaces," Journal of Optimization Theory and Applications, Springer, vol. 147(1), pages 71-92, October.
    4. Q. S. Qiu & X. M. Yang, 2012. "Connectedness of Henig Weakly Efficient Solution Set for Set-Valued Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 439-449, February.
    5. L. Y. Xia & J. H. Qiu, 2008. "Superefficiency in Vector Optimization with Nearly Subconvexlike Set-Valued Maps," Journal of Optimization Theory and Applications, Springer, vol. 136(1), pages 125-137, January.
    6. J. H. Qiu, 2007. "Superefficiency in Local Convex Spaces," Journal of Optimization Theory and Applications, Springer, vol. 135(1), pages 19-35, October.
    7. L. Huerga & B. Jiménez & V. Novo, 2022. "New Notions of Proper Efficiency in Set Optimization with the Set Criterion," Journal of Optimization Theory and Applications, Springer, vol. 195(3), pages 878-902, December.
    8. M. Zarepisheh & E. Khorram, 2011. "On the transformation of lexicographic nonlinear multiobjective programs to single objective programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(2), pages 217-231, October.
    9. J. Benoist & N. Popovici, 2001. "Contractibility of the Efficient Frontier of Three-Dimensional Simply-Shaded Sets," Journal of Optimization Theory and Applications, Springer, vol. 111(1), pages 81-116, October.
    10. E. Miglierina & E. Molho & F. Patrone & S. Tijs, 2008. "Axiomatic approach to approximate solutions in multiobjective optimization," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 31(2), pages 95-115, November.
    11. A. Daniilidis & N. Hadjisavvas, 1999. "Characterization of Nonsmooth Semistrictly Quasiconvex and Strictly Quasiconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 102(3), pages 525-536, September.
    12. X. D. H. Truong, 2001. "Existence and Density Results for Proper Efficiency in Cone Compact Sets," Journal of Optimization Theory and Applications, Springer, vol. 111(1), pages 173-194, October.
    13. J. Benoist, 2001. "Contractibility of the Efficient Set in Strictly Quasiconcave Vector Maximization," Journal of Optimization Theory and Applications, Springer, vol. 110(2), pages 325-336, August.
    14. Zhi-Ang Zhou & Xin-Min Yang, 2014. "Scalarization of $$\epsilon $$ ϵ -Super Efficient Solutions of Set-Valued Optimization Problems in Real Ordered Linear Spaces," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 680-693, August.
    15. Angelo Guerraggio & Dinh The Luc, 2006. "Properly Maximal Points in Product Spaces," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 305-315, May.
    16. N. Q. Huy & N. D. Yen, 2005. "Contractibility of the Solution Sets in Strictly Quasiconcave Vector Maximization on Noncompact Domains," Journal of Optimization Theory and Applications, Springer, vol. 124(3), pages 615-635, March.
    17. S.T. Hackman & U. Passy, 2002. "Maximizing a Linear Fractional Function on a Pareto Efficient Frontier," Journal of Optimization Theory and Applications, Springer, vol. 113(1), pages 83-103, April.
    18. N. T. T. Huong & J.-C. Yao & N. D. Yen, 2020. "Geoffrion’s proper efficiency in linear fractional vector optimization with unbounded constraint sets," Journal of Global Optimization, Springer, vol. 78(3), pages 545-562, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:107:y:2000:i:2:d:10.1023_a:1026412918497. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.