IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v82y2022i2d10.1007_s10898-021-01069-0.html
   My bibliography  Save this article

Improperly efficient solutions in a class of vector optimization problems

Author

Listed:
  • Nguyen Thi Thu Huong

    (Le Quy Don Technical University)

  • Nguyen Dong Yen

    (Vietnam Academy of Science and Technology)

Abstract

Improperly efficient solutions in the sense of Geoffrion in linear fractional vector optimization problems with unbounded constraint sets are studied systematically for the first time in this paper. We give two sets of conditions which assure that all the efficient solutions of a given problem are improperly efficient. We also obtain necessary conditions for an efficient solution to be improperly efficient. As a result, we have new sufficient conditions for Geoffrion’s proper efficiency. The obtained results enrich our knowledge on properly efficient solutions in linear fractional vector optimization.

Suggested Citation

  • Nguyen Thi Thu Huong & Nguyen Dong Yen, 2022. "Improperly efficient solutions in a class of vector optimization problems," Journal of Global Optimization, Springer, vol. 82(2), pages 375-387, February.
    • Handle: RePEc:spr:jglopt:v:82:y:2022:i:2:d:10.1007_s10898-021-01069-0
    DOI: 10.1007/s10898-021-01069-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01069-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-021-01069-0?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. E. U. Choo & D. R. Atkins, 1983. "Connectedness in Multiple Linear Fractional Programming," Management Science, INFORMS, vol. 29(2), pages 250-255, February.
    2. Eng Ung Choo, 1984. "Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem," Operations Research, INFORMS, vol. 32(1), pages 216-220, February.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Feng Guo & Liguo Jiao, 2023. "A new scheme for approximating the weakly efficient solution set of vector rational optimization problems," Journal of Global Optimization, Springer, vol. 86(4), pages 905-930, August.
    3. X. Y. Zheng, 2000. "Contractibility and Connectedness of Efficient Point Sets," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 717-737, March.
    4. Lara, P. & Stancu-Minasian, I., 1999. "Fractional programming: a tool for the assessment of sustainability," Agricultural Systems, Elsevier, vol. 62(2), pages 131-141, November.
    5. Ehrgott, Matthias & Klamroth, Kathrin, 1997. "Connectedness of efficient solutions in multiple criteria combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 97(1), pages 159-166, February.
    6. 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.
    7. 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.

    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:jglopt:v:82:y:2022:i:2:d:10.1007_s10898-021-01069-0. 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.