Monday, 16:15 - 16:40 h, Room: H 2036


Tomohiko Mizutani
SDP relaxations for the concave cost transportation problem

Coauthor: Makoto Yamashita


We present a hierarchy of semidefinite programming (SDP) relaxations for solving the concave cost transportation problem (CCTP) with p suppliers and q demanders. The key idea of the relaxation methods is in the change of variables to CCTPs, and due to this, we can construct SDP relaxations whose matrix variables depend on min{p, q} at each relaxation order. The sequence of optimal values of SDP relaxations converges to the global minimum of the CCTP as the relaxation order goes to infinity. We show the performance of the relaxation methods through numerical experiments.


Talk 3 of the contributed session Mon.3.H 2036
"Semidefinite programming applications" [...]
Cluster 4
"Conic programming" [...]


  signature loans . This is a permit to the world of pleasure and the lasting sex. Cialis Super Active online is a drug, the quality level of which is determined by its action speed.