IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v84y2016i2d10.1007_s00186-016-0547-z.html
   My bibliography  Save this article

Relationships between constrained and unconstrained multi-objective optimization and application in location theory

Author

Listed:
  • Christian Günther

    (Martin Luther University Halle-Wittenberg)

  • Christiane Tammer

    (Martin Luther University Halle-Wittenberg)

Abstract

This article deals with constrained multi-objective optimization problems. The main purpose of the article is to investigate relationships between constrained and unconstrained multi-objective optimization problems. Under suitable assumptions (e.g., generalized convexity assumptions) we derive a characterization of the set of (strictly, weakly) efficient solutions of a constrained multi-objective optimization problem using characterizations of the sets of (strictly, weakly) efficient solutions of unconstrained multi-objective optimization problems. We demonstrate the usefulness of the results by applying it on constrained multi-objective location problems. Using our new results we show that special classes of constrained multi-objective location problems (e.g., point-objective location problems, Weber location problems, center location problems) can be completely solved with the help of algorithms for the unconstrained case.

Suggested Citation

  • Christian Günther & Christiane Tammer, 2016. "Relationships between constrained and unconstrained multi-objective optimization and application in location theory," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(2), pages 359-387, October.
    • Handle: RePEc:spr:mathme:v:84:y:2016:i:2:d:10.1007_s00186-016-0547-z
    DOI: 10.1007/s00186-016-0547-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-016-0547-z
    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/s00186-016-0547-z?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. Ndiaye, M. & Michelot, C., 1998. "Efficiency in constrained continuous location," European Journal of Operational Research, Elsevier, vol. 104(2), pages 288-298, January.
    2. J.-F. Thisse & J. E. Ward & R. E. Wendell, 1984. "Some Properties of Location Problems with Block and Round Norms," Operations Research, INFORMS, vol. 32(6), pages 1309-1327, December.
    3. Stefan Nickel & Justo Puerto & Antonio M. Rodríguez-Chía, 2015. "Location Problems with Multiple Criteria," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 205-247, Springer.
    4. Alberto Cambini & Laura Martein, 2009. "Generalized Convexity and Optimization," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-540-70876-6, December.
    5. A.M. Rodríguez-Chía & J. Puerto, 2002. "Geometrical Description of the Weakly Efficient Solution Set for Multicriteria Location Problems," Annals of Operations Research, Springer, vol. 111(1), pages 181-196, March.
    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. Gabriele Eichfelder & Kathrin Klamroth & Julia Niebling, 2021. "Nonconvex constrained optimization by a filtering branch and bound," Journal of Global Optimization, Springer, vol. 80(1), pages 31-61, May.
    2. Marius Durea & Radu Strugariu & Christiane Tammer, 2017. "On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 175(3), pages 738-763, December.

    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. Boualem Alleche & Vicenţiu D. Rădulescu, 2017. "Further on Set-Valued Equilibrium Problems and Applications to Browder Variational Inclusions," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 39-58, October.
    2. Sorin-Mihai Grad & Felipe Lara, 2022. "An extension of the proximal point algorithm beyond convexity," Journal of Global Optimization, Springer, vol. 82(2), pages 313-329, February.
    3. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    4. A. Kabgani & F. Lara, 2023. "Semistrictly and neatly quasiconvex programming using lower global subdifferentials," Journal of Global Optimization, Springer, vol. 86(4), pages 845-865, August.
    5. Giorgio, 2019. "On Second-Order Optimality Conditions in Smooth Nonlinear Programming Problems," DEM Working Papers Series 171, University of Pavia, Department of Economics and Management.
    6. Li, Ruihai & Chan, Ya-Lan & Chang, Chun-Tao & Cárdenas-Barrón, Leopoldo Eduardo, 2017. "Pricing and lot-sizing policies for perishable products with advance-cash-credit payments by a discounted cash-flow analysis," International Journal of Production Economics, Elsevier, vol. 193(C), pages 578-589.
    7. R. Cambini & R. Riccardi & D. Scopelliti, 2023. "Solving linear multiplicative programs via branch-and-bound: a computational experience," Computational Management Science, Springer, vol. 20(1), pages 1-32, December.
    8. Kock, Anders Bredahl & Preinerstorfer, David & Veliyev, Bezirgen, 2023. "Treatment recommendation with distributional targets," Journal of Econometrics, Elsevier, vol. 234(2), pages 624-646.
    9. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.
    10. Al-Amin Khan, Md. & Shaikh, Ali Akbar & Konstantaras, Ioannis & Bhunia, Asoke Kumar & Cárdenas-Barrón, Leopoldo Eduardo, 2020. "Inventory models for perishable items with advanced payment, linearly time-dependent holding cost and demand dependent on advertisement and selling price," International Journal of Production Economics, Elsevier, vol. 230(C).
    11. Dye, Chung-Yuan & Yang, Chih-Te & Kung, Fang-Cheng, 2014. "A note on “Seller’s optimal credit period and cycle time in a supply chain for deteriorating items with maximum lifetime”," European Journal of Operational Research, Elsevier, vol. 239(3), pages 868-871.
    12. Delle Site, Paolo & Kilani, Karim & Gatta, Valerio & Marcucci, Edoardo & de Palma, André, 2019. "Estimation of consistent Logit and Probit models using best, worst and best–worst choices," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 87-106.
    13. Alzorba, Shaghaf & Günther, Christian & Popovici, Nicolae & Tammer, Christiane, 2017. "A new algorithm for solving planar multiobjective location problems involving the Manhattan norm," European Journal of Operational Research, Elsevier, vol. 258(1), pages 35-46.
    14. A. Iusem & F. Lara, 2022. "Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 443-461, June.
    15. Md. Sujan Miah & Md. Mominul Islam & Mahmudul Hasan & Abu Hashan Md. Mashud & Dipa Roy & Shib Sankar Sana, 2021. "A Discount Technique-Based Inventory Management on Electronics Products Supply Chain," JRFM, MDPI, vol. 14(9), pages 1-16, August.
    16. Frank Plastria, 2020. "On the Structure of the Weakly Efficient Set for Quasiconvex Vector Minimization," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 547-564, February.
    17. Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
    18. Md. Abdul Hakim & Ibrahim M. Hezam & Adel Fahad Alrasheedi & Jeonghwan Gwak, 2022. "Pricing Policy in an Inventory Model with Green Level Dependent Demand for a Deteriorating Item," Sustainability, MDPI, vol. 14(8), pages 1-16, April.
    19. Chinedu Izuchukwu & Yekini Shehu & Chibueze C. Okeke, 2023. "Extension of forward-reflected-backward method to non-convex mixed variational inequalities," Journal of Global Optimization, Springer, vol. 86(1), pages 123-140, May.
    20. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.

    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:84:y:2016:i:2:d:10.1007_s00186-016-0547-z. 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.