IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/795b6c0c-c7bc-4ced-9d6b-a6d9409866be.html
   My bibliography  Save this paper

A Renewed Take on Weighted Sum in Sandwich Algorithms : Modification of the Criterion Space

Author

Listed:
  • Koenen, Melissa

    (Tilburg University, Center For Economic Research)

  • Balvert, Marleen

    (Tilburg University, Center For Economic Research)

  • Fleuren, H.A.

    (Tilburg University, Center For Economic Research)

Abstract

No abstract is available for this item.

Suggested Citation

  • Koenen, Melissa & Balvert, Marleen & Fleuren, H.A., 2023. "A Renewed Take on Weighted Sum in Sandwich Algorithms : Modification of the Criterion Space," Discussion Paper 2023-012, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:795b6c0c-c7bc-4ced-9d6b-a6d9409866be
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/72610036/2023_012.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Solanki, Rajendra S. & Appino, Perry A. & Cohon, Jared L., 1993. "Approximating the noninferior set in multiobjective linear programming problems," European Journal of Operational Research, Elsevier, vol. 68(3), pages 356-373, August.
    2. Kathrin Klamroth & Jørgen Tind & Margaret M. Wiecek, 2003. "Unbiased approximation in multicriteria optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(3), pages 413-437, January.
    3. Gijs Rennen & Edwin R. van Dam & Dick den Hertog, 2011. "Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 493-517, November.
    4. Rasmus Bokrantz & Anders Forsgren, 2013. "An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 377-393, May.
    5. Lizhen Shao & Matthias Ehrgott, 2008. "Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 257-276, October.
    6. Corné Van Dooren & Marcelo Tyszler & Gerard F. H. Kramer & Harry Aiking, 2015. "Combining Low Price, Low Climate Impact and High Nutritional Value in One Shopping Basket through Diet Optimization by Linear Programming," Sustainability, MDPI, vol. 7(9), pages 1-19, September.
    7. Margaret M. Wiecek & Matthias Ehrgott & Alexander Engau, 2016. "Continuous Multiobjective Programming," International Series in Operations Research & Management Science, in: Salvatore Greco & Matthias Ehrgott & José Rui Figueira (ed.), Multiple Criteria Decision Analysis, edition 2, chapter 0, pages 739-815, Springer.
    8. Matthias Ehrgott & Lizhen Shao & Anita Schöbel, 2011. "An approximation algorithm for convex multi-objective programming problems," Journal of Global Optimization, Springer, vol. 50(3), pages 397-416, July.
    9. Matthias Ehrgott & Andreas Löhne & Lizhen Shao, 2012. "A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming," Journal of Global Optimization, Springer, vol. 52(4), pages 757-778, April.
    10. H. P. Benson, 1998. "Hybrid Approach for Solving Multiple-Objective Linear Programs in Outcome Space," Journal of Optimization Theory and Applications, Springer, vol. 98(1), pages 17-35, July.
    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. Koenen, Melissa & Balvert, Marleen & Fleuren, H.A., 2023. "A Renewed Take on Weighted Sum in Sandwich Algorithms : Modification of the Criterion Space," Other publications TiSEM 795b6c0c-c7bc-4ced-9d6b-a, Tilburg University, School of Economics and Management.
    2. Raimundo, Marcos M. & Ferreira, Paulo A.V. & Von Zuben, Fernando J., 2020. "An extension of the non-inferior set estimation algorithm for many objectives," European Journal of Operational Research, Elsevier, vol. 284(1), pages 53-66.
    3. Timothy C. Y. Chan & Tim Craig & Taewoo Lee & Michael B. Sharpe, 2014. "Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy," Operations Research, INFORMS, vol. 62(3), pages 680-695, June.
    4. Rasmus Bokrantz & Anders Forsgren, 2013. "An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 377-393, May.
    5. Kuan-Min Lin & Matthias Ehrgott & Andrea Raith, 2017. "Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes," 4OR, Springer, vol. 15(4), pages 331-357, December.
    6. Rennen, G. & van Dam, E.R. & den Hertog, D., 2009. "Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets," Other publications TiSEM e2255959-6691-4ef1-88a4-5, Tilburg University, School of Economics and Management.
    7. Andreas Löhne & Birgit Rudloff & Firdevs Ulus, 2014. "Primal and dual approximation algorithms for convex vector optimization problems," Journal of Global Optimization, Springer, vol. 60(4), pages 713-736, December.
    8. Gijs Rennen & Edwin R. van Dam & Dick den Hertog, 2011. "Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 493-517, November.
    9. Janusz Miroforidis, 2021. "Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems," Journal of Global Optimization, Springer, vol. 80(3), pages 617-634, July.
    10. Matthias Ehrgott & Lizhen Shao & Anita Schöbel, 2011. "An approximation algorithm for convex multi-objective programming problems," Journal of Global Optimization, Springer, vol. 50(3), pages 397-416, July.
    11. Gabriele Eichfelder & Leo Warnow, 2022. "An approximation algorithm for multi-objective optimization problems using a box-coverage," Journal of Global Optimization, Springer, vol. 83(2), pages 329-357, June.
    12. Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
    13. Breedveld, Sebastiaan & Craft, David & van Haveren, Rens & Heijmen, Ben, 2019. "Multi-criteria optimization and decision-making in radiotherapy," European Journal of Operational Research, Elsevier, vol. 277(1), pages 1-19.
    14. Zachary Feinstein & Birgit Rudloff, 2017. "A recursive algorithm for multivariate risk measures and a set-valued Bellman’s principle," Journal of Global Optimization, Springer, vol. 68(1), pages 47-69, May.
    15. Piercy, Craig A. & Steuer, Ralph E., 2019. "Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 277(2), pages 653-666.
    16. Firdevs Ulus, 2018. "Tractability of convex vector optimization problems in the sense of polyhedral approximations," Journal of Global Optimization, Springer, vol. 72(4), pages 731-742, December.
    17. Zachary Feinstein & Birgit Rudloff, 2015. "A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle," Papers 1508.02367, arXiv.org, revised Jul 2016.
    18. H. P. Benson & E. Sun, 2000. "Outcome Space Partition of the Weight Set in Multiobjective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 17-36, April.
    19. Christine Cleghorn & Nhung Nghiem & Cliona Ni Mhurchu, 2022. "Assessing the Health and Environmental Benefits of a New Zealand Diet Optimised for Health and Climate Protection," Sustainability, MDPI, vol. 14(21), pages 1-13, October.
    20. Rahmatollah Beheshti & Jessica C Jones-Smith & Takeru Igusa, 2017. "Taking dietary habits into account: A computational method for modeling food choices that goes beyond price," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-13, May.

    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:tiu:tiucen:795b6c0c-c7bc-4ced-9d6b-a6d9409866be. 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: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

    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.