IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v207y2010i3p1162-1168.html
   My bibliography  Save this article

Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs

Author

Listed:
  • Khorram, E.
  • Zarepisheh, M.
  • Ghaznavi-ghosoni, B.A.

Abstract

This paper deals with a class of multiple objective linear programs (MOLP) called lexicographic multiple objective linear programs (LMOLP). In this paper, by providing an efficient algorithm which employs the preceding computations as well, it is shown how we can solve the LMOLP problem if the priority of the objective functions is changed. In fact, the proposed algorithm is a kind of sensitivity analysis on the priority of the objective functions in the LMOLP problems.

Suggested Citation

  • Khorram, E. & Zarepisheh, M. & Ghaznavi-ghosoni, B.A., 2010. "Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1162-1168, December.
    • Handle: RePEc:eee:ejores:v:207:y:2010:i:3:p:1162-1168
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00372-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Pourkarimi, L. & Zarepisheh, M., 2007. "A dual-based algorithm for solving lexicographic multiple objective programs," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1348-1356, February.
    2. Ignizio, James P. & Thomas, Lyn C., 1984. "An enhanced conversion scheme for lexicographic, multiobjective integer programs," European Journal of Operational Research, Elsevier, vol. 18(1), pages 57-61, October.
    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. 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.
    2. Lorenzo Fiaschi & Marco Cococcioni, 2022. "A Non-Archimedean Interior Point Method and Its Application to the Lexicographic Multi-Objective Quadratic Programming," Mathematics, MDPI, vol. 10(23), pages 1-34, November.
    3. Zhang Jiangao & Shitao Yang, 2016. "On the Lexicographic Centre of Multiple Objective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 600-614, February.
    4. Fereshteh Akbari & Mehrdad Ghaznavi & Esmaile Khorram, 2018. "A Revised Pascoletti–Serafini Scalarization Method for Multiobjective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 560-590, August.

    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. 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.
    2. Morovati, Vahid & Pourkarimi, Latif, 2019. "Extension of Zoutendijk method for solving constrained multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 44-57.
    3. Zhang Jiangao & Shitao Yang, 2016. "On the Lexicographic Centre of Multiple Objective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 600-614, February.
    4. Lorenzo Fiaschi & Marco Cococcioni, 2022. "A Non-Archimedean Interior Point Method and Its Application to the Lexicographic Multi-Objective Quadratic Programming," Mathematics, MDPI, vol. 10(23), pages 1-34, November.
    5. Cococcioni, Marco & Pappalardo, Massimo & Sergeyev, Yaroslav D., 2018. "Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 298-311.
    6. Salles, Ronaldo M. & Barria, Javier A., 2008. "Lexicographic maximin optimisation for fair bandwidth allocation in computer networks," European Journal of Operational Research, Elsevier, vol. 185(2), pages 778-794, 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:eee:ejores:v:207:y:2010:i:3:p:1162-1168. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.