Semi-infinite assignment and transportation games

Judith B. Timmer, Joaqu´ın Sánchez-Soriano, Navidad Llorca, Stef Tijs

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

98 Downloads (Pure)

Abstract

Games corresponding to semi-infinite transportation and related assignment situations are studied. In a semi-infinite transportation situation, one aims at maximizing the profit from the transportation of a certain good from a finite number of suppliers to an infinite number of demanders. An assignment situation is a special kind of transportation situation where the supplies and demands for the good all equal one unit. It is shown that the special structure of these situations implies that the underlying infinite programs have no duality gap and that the core of the corresponding game is nonempty.
Original languageUndefined
Title of host publicationSemi-Infinite Programming
EditorsMiguel A. Goberna, Marco A. López
Place of PublicationDordrecht
PublisherKluwer Academic Publishers
Pages349-363
Number of pages11
ISBN (Print)978-1-4020-0032-4
Publication statusPublished - 2001

Publication series

NameNonconvex Optimization and Its Applications
PublisherKluwer Academic Publishers
Volume57

Keywords

  • assignment situations
  • Transportation situations
  • METIS-201325
  • EWI-18081
  • duality gap
  • Cooperative games
  • Core
  • IR-72754

Cite this