IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v74y2011i2p217-231.html
   My bibliography  Save this article

On the transformation of lexicographic nonlinear multiobjective programs to single objective programs

Author

Listed:
  • M. Zarepisheh
  • E. Khorram

Abstract

This paper deals with multiobjective optimization programs in which the objective functions are ordered by their degree of priority. A number of approaches have been proposed (and several implemented) for the solution of lexicographic (preemptive priority) multiobjective optimization programs. These approaches may be divided into two classes. The first encompasses the development of algorithms specifically designed to deal directly with the initial model. Considered only for linear multiobjective programs and multiobjective programs with a finite discrete feasible region, the second one attempts to transform, efficiently, the lexicographic multiobjective model into an equvivalent model, i.e. a single objective programming problem. In this paper, we deal with the second approach for lexicographic nonlinear multiobjective programs. Copyright Springer-Verlag 2011

Suggested Citation

  • 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.
    • Handle: RePEc:spr:mathme:v:74:y:2011:i:2:p:217-231
    DOI: 10.1007/s00186-011-0360-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-011-0360-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-011-0360-7?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. Jeyakumar, V. & Lee, G.M. & Dinh, N., 2006. "Characterizations of solution sets of convex vector minimization problems," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1380-1395, November.
    2. M. M. Mäkelä & Y. Nikulin, 2009. "On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 143(3), pages 519-538, December.
    3. Kaisa Miettinen & Marko M. Mäkelä, 2001. "On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 53(2), pages 233-245, June.
    4. 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.
    5. 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.
    6. J. Vada & O. Slupphaug & T. A. Johansen, 2001. "Optimal Prioritized Infeasibility Handling in Model Predictive Control: Parametric Preemptive Multiobjective Linear Programming Approach," Journal of Optimization Theory and Applications, Springer, vol. 109(2), pages 385-413, May.
    7. 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.
    8. 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.
    9. Viviane Gascon & Sophie Villeneuve & Philippe Michelon & Jacques Ferland, 2000. "Scheduling the flying squad nurses of a hospital using a multi-objective programming model," Annals of Operations Research, Springer, vol. 96(1), pages 149-166, November.
    10. Onésimo Hernández-Lerma & Luis F. Hoyos-Reyes, 2001. "A multiobjective control approach to priority queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 53(2), pages 265-277, June.
    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. 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.
    2. 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.
    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. X. M. Yang, 2009. "On Characterizing the Solution Sets of Pseudoinvex Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 140(3), pages 537-542, March.
    5. 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.
    6. Augustine Esogbue & Qiang Song & Donovan Young, 2006. "Non-Euler–Lagrangian Pareto-optimality Conditions for Dynamic Multiple Criterion Decision Problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 525-542, July.
    7. 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.
    8. Xiangkai Sun & Kok Lay Teo & Liping Tang, 2019. "Dual Approaches to Characterize Robust Optimal Solution Sets for a Class of Uncertain Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 182(3), pages 984-1000, September.
    9. 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.
    10. 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.
    11. Alexander Engau, 2017. "Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 119-134, January.
    12. Villacorta, Kely D.V. & Oliveira, P. Roberto, 2011. "An interior proximal method in vector optimization," European Journal of Operational Research, Elsevier, vol. 214(3), pages 485-492, November.
    13. Eitan Altman, 2007. "Comments on: Dynamic priority allocation via restless bandit marginal productivity indices," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(2), pages 202-207, December.
    14. 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.
    15. 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.
    16. Topaloglu, Seyda, 2009. "A shift scheduling model for employees with different seniority levels and an application in healthcare," European Journal of Operational Research, Elsevier, vol. 198(3), pages 943-957, November.
    17. 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.
    18. J. H. Qiu, 2007. "Superefficiency in Local Convex Spaces," Journal of Optimization Theory and Applications, Springer, vol. 135(1), pages 19-35, October.
    19. M. M. Mäkelä & Y. Nikulin, 2009. "On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 143(3), pages 519-538, December.
    20. 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.

    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:mathme:v:74:y:2011:i:2:p:217-231. 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.