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

Approximating the nondominated set of an MOLP by approximately solving its dual problem

Author

Listed:
  • Lizhen Shao
  • Matthias Ehrgott

Abstract

The geometric duality theory of Heyde and Löhne (2006) defines a dual to a multiple objective linear programme (MOLP). In objective space, the primal problem can be solved by Benson’s outer approximation method (Benson 1998a,b) while the dual problem can be solved by a dual variant of Benson’s algorithm (Ehrgott et al. 2007). Duality theory then assures that it is possible to find the (weakly) nondominated set of the primal MOLP by solving its dual. In this paper, we propose an algorithm to solve the dual MOLP approximately but within specified tolerance. This approximate solution set can be used to calculate an approximation of the weakly nondominated set of the primal. We show that this set is a weakly ε-nondominated set of the original primal MOLP and provide numerical evidence that this approach can be faster than solving the primal MOLP approximately. Copyright Springer-Verlag 2008

Suggested Citation

  • Lizhen Shao & Matthias Ehrgott, 2008. "Approximating the nondominated set of an MOLP by approximately solving its dual problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 469-492, December.
    • Handle: RePEc:spr:mathme:v:68:y:2008:i:3:p:469-492
    DOI: 10.1007/s00186-007-0194-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-007-0194-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-007-0194-5?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. S. Ruzika & M. M. Wiecek, 2005. "Approximation Methods in Multiobjective Programming," Journal of Optimization Theory and Applications, Springer, vol. 126(3), pages 473-501, September.
    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. 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.
    2. 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.
    3. Matthias Ehrgott & Çiğdem Güler & Horst Hamacher & Lizhen Shao, 2010. "Mathematical optimization in intensity modulated radiation therapy," Annals of Operations Research, Springer, vol. 175(1), pages 309-365, March.
    4. 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.
    5. 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.

    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. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
    2. 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.
    3. Pontes, Roberto Da Silva Gervasio & Brandão, Diego Nunes & Usberti, Fábio Luiz & De Assis, Laura Silva, 2024. "Multi-objective models for crop rotation planning problems," Agricultural Systems, Elsevier, vol. 219(C).
    4. Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein, 2021. "A general branch-and-bound framework for continuous global multiobjective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 195-227, May.
    5. Kathrin Klamroth & Kaisa Miettinen, 2008. "Integrating Approximation and Interactive Decision Making in Multicriteria Optimization," Operations Research, INFORMS, vol. 56(1), pages 222-234, February.
    6. 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.
    7. Daniel Dörfler, 2022. "On the Approximation of Unbounded Convex Sets by Polyhedra," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 265-287, July.
    8. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    9. Stacey Faulkenberg & Margaret Wiecek, 2012. "Generating equidistant representations in biobjective programming," Computational Optimization and Applications, Springer, vol. 51(3), pages 1173-1210, April.
    10. Nguyen, Trung H. & Granger, Julien & Pandya, Deval & Paustian, Keith, 2019. "High-resolution multi-objective optimization of feedstock landscape design for hybrid first and second generation biorefineries," Applied Energy, Elsevier, vol. 238(C), pages 1484-1496.
    11. Birgit Rudloff & Firdevs Ulus, 2019. "Certainty Equivalent and Utility Indifference Pricing for Incomplete Preferences via Convex Vector Optimization," Papers 1904.09456, arXiv.org, revised Oct 2020.
    12. Lim, Dong-Joon, 2016. "Inverse DEA with frontier changes for new product target setting," European Journal of Operational Research, Elsevier, vol. 254(2), pages 510-516.
    13. Amir Ahmadi-Javid & Nasrin Ramshe, 2019. "Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm," 4OR, Springer, vol. 17(4), pages 373-400, December.
    14. Nathan Adelgren & Akshay Gupte, 2022. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 909-933, March.
    15. Angelo Aliano Filho & Antonio Carlos Moretti & Margarida Vaz Pato & Washington Alves Oliveira, 2021. "An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems," Annals of Operations Research, Springer, vol. 296(1), pages 35-69, January.
    16. I. Kaliszewski & J. Miroforidis, 2022. "Probing the Pareto front of a large-scale multiobjective problem with a MIP solver," Operational Research, Springer, vol. 22(5), pages 5617-5673, November.
    17. Daniel Vanderpooten & Lakmali Weerasena & Margaret M. Wiecek, 2017. "Covers and approximations in multiobjective optimization," Journal of Global Optimization, Springer, vol. 67(3), pages 601-619, March.
    18. 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.
    19. Hartikainen, Markus & Miettinen, Kaisa & Klamroth, Kathrin, 2019. "Interactive Nonconvex Pareto Navigator for multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 275(1), pages 238-251.
    20. Arbib, Claudio & Marinelli, Fabrizio & Pizzuti, Andrea, 2021. "Number of bins and maximum lateness minimization in two-dimensional bin packing," European Journal of Operational Research, Elsevier, vol. 291(1), pages 101-113.

    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:68:y:2008:i:3:p:469-492. 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.