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

A dual-based algorithm for solving lexicographic multiple objective programs

Author

Listed:
  • Pourkarimi, L.
  • Zarepisheh, M.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:3:p:1348-1356
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00899-4
    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. Sherali, Hanif D., 1982. "Equivalent weights for lexicographic multi-objective programs: Characterizations and computations," European Journal of Operational Research, Elsevier, vol. 11(4), pages 367-379, December.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    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. 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.
    7. 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.

    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. Lamghari, Amina & Ferland, Jacques A., 2011. "Assigning judges to competitions of several rounds using Tabu search," European Journal of Operational Research, Elsevier, vol. 210(3), pages 694-705, May.
    2. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    3. Sherali, Hanif D. & Narayanan, Arvind & Sivanandan, R., 2003. "Estimation of origin-destination trip-tables based on a partial set of traffic link volumes," Transportation Research Part B: Methodological, Elsevier, vol. 37(9), pages 815-836, November.
    4. Laura Laguna-Salvadó & Matthieu Lauras & Uche Okongwu & Tina Comes, 2019. "A multicriteria Master Planning DSS for a sustainable humanitarian supply chain," Annals of Operations Research, Springer, vol. 283(1), pages 1303-1343, December.
    5. Amir Akbari & Paul I. Barton, 2018. "An Improved Multi-parametric Programming Algorithm for Flux Balance Analysis of Metabolic Networks," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 502-537, August.
    6. Sherali, Hanif D. & Van Goubergen, Dirk & Van Landeghem, Hendrik, 2008. "A quantitative approach for scheduling activities to reduce set-up in multiple machine lines," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1224-1237, June.
    7. Sharma, Anuj & Verma, Vanita & Kaur, Prabhjot & Dahiya, Kalpana, 2015. "An iterative algorithm for two level hierarchical time minimization transportation problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 700-707.
    8. Bish, Douglas R. & Sherali, Hanif D., 2013. "Aggregate-level demand management in evacuation planning," European Journal of Operational Research, Elsevier, vol. 224(1), pages 79-92.
    9. Sonia & Puri, M.C., 2008. "Two-stage time minimizing assignment problem," Omega, Elsevier, vol. 36(5), pages 730-740, October.
    10. Ashkan Fakhri & Mehdi Ghatee, 2013. "Solution of preemptive multi-objective network design problems applying Benders decomposition method," Annals of Operations Research, Springer, vol. 210(1), pages 295-307, November.
    11. Karabuk, Suleyman & Manzour, Hasan, 2019. "A multi-stage stochastic program for evacuation management under tornado track uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 124(C), pages 128-151.
    12. Dimitrios Letsios & Jeremy T. Bradley & Suraj G & Ruth Misener & Natasha Page, 2021. "Approximate and robust bounded job start scheduling for Royal Mail delivery offices," Journal of Scheduling, Springer, vol. 24(2), pages 237-258, April.
    13. Podinovski, Victor V. & Bouzdine-Chameeva, Tatiana, 2016. "On single-stage DEA models with weight restrictions," European Journal of Operational Research, Elsevier, vol. 248(3), pages 1044-1050.
    14. Proll, Les, 2007. "ILP approaches to the blockmodel problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 840-850, March.
    15. Hanif Sherali & Brian Lunday, 2013. "On generating maximal nondominated Benders cuts," Annals of Operations Research, Springer, vol. 210(1), pages 57-72, November.
    16. Krutein, Klaas Fiete & Goodchild, Anne, 2022. "The isolated community evacuation problem with mixed integer programming," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    17. Fanrong Xie & Zuoan Li, 2022. "An iterative solution technique for capacitated two-stage time minimization transportation problem," 4OR, Springer, vol. 20(4), pages 637-684, December.
    18. Letsios, Dimitrios & Mistry, Miten & Misener, Ruth, 2021. "Exact lexicographic scheduling and approximate rescheduling," European Journal of Operational Research, Elsevier, vol. 290(2), pages 469-478.
    19. 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.
    20. Sonia Puri & M. Puri, 2006. "Max-min sum minimization transportation problem," Annals of Operations Research, Springer, vol. 143(1), pages 265-275, March.

    More about this item

    Statistics

    Access and download statistics

    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:176:y:2007:i:3:p:1348-1356. 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.