IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v63y2016i3d10.1007_s10589-015-9794-9.html
   My bibliography  Save this article

Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem

Author

Listed:
  • Nicolas Delanoue

    (LARIS)

  • Mehdi Lhommeau

    (LARIS)

  • Philippe Lucidarme

    (LARIS)

Abstract

The problem of optimal transportation was formalized by the French mathematician Gaspard Monge in 1781. Since Kantorovitch, this (generalized) problem is formulated with measure theory. Based on Interval Arithmetic, we propose a guaranteed discretization of the Kantorovitch’s mass transportation problem. Our discretization is spatial: supports of the two mass densities are partitioned into finite families. The problem is relaxed to a finite dimensional linear programming problem whose optimum is a lower bound to the optimum of the initial one. Based on Kantorovitch duality and Interval Arithmetic, a method to obtain an upper bound to the optimum is also provided. Preliminary results show that good approximations are obtained.

Suggested Citation

  • Nicolas Delanoue & Mehdi Lhommeau & Philippe Lucidarme, 2016. "Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem," Computational Optimization and Applications, Springer, vol. 63(3), pages 855-873, April.
    • Handle: RePEc:spr:coopap:v:63:y:2016:i:3:d:10.1007_s10589-015-9794-9
    DOI: 10.1007/s10589-015-9794-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-015-9794-9
    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/s10589-015-9794-9?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. E. J. Anderson & A. B. Philpott, 1984. "Duality and an Algorithm for a Class of Continuous Transportation Problems," Mathematics of Operations Research, INFORMS, vol. 9(2), pages 222-231, May.
    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. Muyldermans, L. & Van Wassenhove, L.N. & Guide, V.D.R., 2019. "Managing high-end ex-demonstration product returns," European Journal of Operational Research, Elsevier, vol. 277(1), pages 195-214.
    2. Nicolas Delanoue & Mehdi Lhommeau & Philippe Lucidarme, 2016. "Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem," Computational Optimization and Applications, Springer, vol. 63(3), pages 855-873, April.

    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:coopap:v:63:y:2016:i:3:d:10.1007_s10589-015-9794-9. 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.