Optimization Online


On the Transportation Problem with Market Choice

Pelin Damci-Kurt (damci-kurt.1***at***osu.edu)
Santanu Dey (santanu.dey***at***isye.gatech.edu)
Simge Kucukyavuz (kucukyavuz.2***at***osu.edu)

Abstract: We study a variant of the classical transportation problem in which suppliers with limited capacities have a choice of which demands (markets) to satisfy. We refer to this problem as the transportation problem with market choice (TPMC). While the classical transportation problem is known to be strongly polynomial-time solvable, we show that its market choice counterpart is strongly NP-complete. For the special case when all potential demands are no greater than two, we show that the problem reduces in polynomial time to minimum weight perfect matching in a general graph, and thus can be solved in polynomial time. We give valid inequalities and coefficient update schemes for general mixed-integer sets that are substructures of TPMC. Finally, we give conditions under which these inequalities define facets, and report our preliminary computational experiments with using them in a branch-and-cut algorithm.

Keywords: Transportation problem, market choice, complexity, facet

Category 1: Integer Programming ((Mixed) Integer Linear Programming )

Category 2: Applications -- OR and Management Sciences (Transportation )

Citation: April/2013

Download: [PDF]

Entry Submitted: 04/03/2013
Entry Accepted: 04/04/2013
Entry Last Modified: 08/21/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society