IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v168y2016i2d10.1007_s10957-015-0810-0.html
   My bibliography  Save this article

On the Lexicographic Centre of Multiple Objective Optimization

Author

Listed:
  • Zhang Jiangao

    (Chongqing University
    Sichuan University)

  • Shitao Yang

    (Florida Institute of Technology)

Abstract

We study the lexicographic centre of multiple objective optimization. Analysing the lexicographic-order properties yields the result that, if the multiple objective programming’s lexicographic centre is not empty, then it is a subset of all efficient solutions. It exists if the image set of multiple objective programming is bounded below and closed. The multiple objective linear programming’s lexicographic centre is nonempty if and only if there exists an efficient solution to the multiple objective linear programming. We propose a polynomial-time algorithm to determine whether there is an efficient solution to multiple objective linear programming, and we solve the multiple objective linear programming’s lexicographic centre by calculating at most the same number of dual linear programs as the number of objective functions and a system of linear inequalities.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:168:y:2016:i:2:d:10.1007_s10957-015-0810-0
    DOI: 10.1007/s10957-015-0810-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-015-0810-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/s10957-015-0810-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. Alois Behringer, Fred, 1981. "A simplex based algorithm for the lexicographically extended linear maxmin problem," European Journal of Operational Research, Elsevier, vol. 7(3), pages 274-283, July.
    2. Jos A. M. Potters & Johannes H. Reijnierse & Michel Ansing, 1996. "Computing the Nucleolus by Solving a Prolonged Simplex Algorithm," Mathematics of Operations Research, INFORMS, vol. 21(3), pages 757-768, August.
    3. 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.
    4. 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.
    5. M. Meertens & J. Potters, 2006. "The nucleolus of trees with revenues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 363-382, October.
    6. Ogryczak, Wlodzimierz & Wierzbicki, Adam & Milewski, Marcin, 2008. "A multi-criteria approach to fair and efficient bandwidth allocation," Omega, Elsevier, vol. 36(3), pages 451-463, June.
    7. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.
    8. Sun, Minghe, 2005. "Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures," European Journal of Operational Research, Elsevier, vol. 162(2), pages 468-483, April.
    9. Potters, Jos & Reijnierse, Hans & Biswas, Amit, 2006. "The nucleolus of balanced simple flow networks," Games and Economic Behavior, Elsevier, vol. 54(1), pages 205-225, January.
    10. Kostreva, Michael M. & Ogryczak, Wlodzimierz & Wierzbicki, Adam, 2004. "Equitable aggregations and multiple criteria analysis," European Journal of Operational Research, Elsevier, vol. 158(2), pages 362-377, October.
    11. M. Maschler & B. Peleg & L. S. Shapley, 1979. "Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 303-338, November.
    12. Michael Maschler & Jos Potters & Hans Reijnierse, 2010. "The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 89-104, March.
    13. Ogryczak, Wlodzimierz, 1997. "On the lexicographic minimax approach to location problems," European Journal of Operational Research, Elsevier, vol. 100(3), pages 566-585, August.
    14. Marchi, Ezio & Oviedo, Jorge A., 1992. "Lexicographic optimality in the multiple objective linear programming: The nucleolar solution," European Journal of Operational Research, Elsevier, vol. 57(3), pages 355-359, March.
    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. Liu, Songsong & Papageorgiou, Lazaros G., 2013. "Multiobjective optimisation of production, distribution and capacity planning of global supply chains in the process industry," Omega, Elsevier, vol. 41(2), pages 369-382.
    2. Medernach, Emmanuel & Sanlaville, Eric, 2012. "Fair resource allocation for different scenarios of demands," European Journal of Operational Research, Elsevier, vol. 218(2), pages 339-350.
    3. Kostreva, Michael M. & Ogryczak, Wlodzimierz & Wierzbicki, Adam, 2004. "Equitable aggregations and multiple criteria analysis," European Journal of Operational Research, Elsevier, vol. 158(2), pages 362-377, October.
    4. Ogryczak, Wlodzimierz & Wierzbicki, Adam & Milewski, Marcin, 2008. "A multi-criteria approach to fair and efficient bandwidth allocation," Omega, Elsevier, vol. 36(3), pages 451-463, June.
    5. Márton Benedek & Jörg Fliege & Tri-Dung Nguyen, 2020. "Finding and verifying the nucleolus of cooperative games," CERS-IE WORKING PAPERS 2021, Institute of Economics, Centre for Economic and Regional Studies.
    6. Li, Linda & Firouz, Mohammad & Ahmed, Abdulaziz & Delen, Dursun, 2023. "On the Egalitarian–Utilitarian spectrum in stochastic capacitated resource allocation problems," International Journal of Production Economics, Elsevier, vol. 262(C).
    7. Erkut, Erhan & Karagiannidis, Avraam & Perkoulidis, George & Tjandra, Stevanus A., 2008. "A multicriteria facility location model for municipal solid waste management in North Greece," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1402-1421, June.
    8. Cao, Wenwei & Çelik, Melih & Ergun, Özlem & Swann, Julie & Viljoen, Nadia, 2016. "Challenges in service network expansion: An application in donated breastmilk banking in South Africa," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 33-48.
    9. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    10. Tamas Solymosi & Balazs Sziklai, 2015. "Universal Characterization Sets for the Nucleolus in Balanced Games," CERS-IE WORKING PAPERS 1512, Institute of Economics, Centre for Economic and Regional Studies.
    11. Dugardin, Frédéric & Yalaoui, Farouk & Amodeo, Lionel, 2010. "New multi-objective method to solve reentrant hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 22-31, May.
    12. Hubert, Franz & Orlova, Ekaterina, 2018. "Network access and market power," Energy Economics, Elsevier, vol. 76(C), pages 170-185.
    13. Mingming Leng & Mahmut Parlar, 2010. "Analytic solution for the nucleolus of a three‐player cooperative game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(7), pages 667-672, October.
    14. J. N. Hooker & H. P. Williams, 2012. "Combining Equity and Utilitarianism in a Mathematical Programming Model," Management Science, INFORMS, vol. 58(9), pages 1682-1693, September.
    15. Qizhi Fang & Bo Li & Xiaohan Shan & Xiaoming Sun, 2018. "Path cooperative games," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 211-229, July.
    16. Sawik, Tadeusz, 2015. "On the fair optimization of cost and customer service level in a supply chain under disruption risks," Omega, Elsevier, vol. 53(C), pages 58-66.
    17. Hubert Franz & Cobanli Onur, 2015. "Pipeline Power: A Case Study of Strategic Network Investments," Review of Network Economics, De Gruyter, vol. 14(2), pages 75-110, June.
    18. Kasin Ransikarbum & Scott J. Mason, 2016. "Multiple-objective analysis of integrated relief supply and network restoration in humanitarian logistics operations," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 49-68, January.
    19. Hanan Luss, 2010. "Equitable bandwidth allocation in content distribution networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(3), pages 266-278, April.
    20. Włodzimierz Ogryczak, 2009. "Inequality measures and equitable locations," Annals of Operations Research, Springer, vol. 167(1), pages 61-86, 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:joptap:v:168:y:2016:i:2:d:10.1007_s10957-015-0810-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.