Cooperative Lot Sizing Games in Supply Chains Cooperative Lot Sizing Games in Supply Chains
Lecture Notes in Economics and Mathematical Systems

Cooperative Lot Sizing Games in Supply Chains

    • USD 39.99
    • USD 39.99

Descripción editorial

The presented work combines two areas of research: cooperative game theory and lot size optimization. One of the most essential problems in cooperations is to allocate cooperative profits or costs among the partners. The core is a well known method from cooperative game theory that describes efficient and stable profit/cost allocations. A general algorithm based on the idea of constraint generation to compute core elements for cooperative optimization problems is provided. Beside its application for the classical core, an extensive discussion of core variants is presented and how they can be handled with the proposed algorithm. The second part of the thesis contains several cooperative lot sizing problems of different complexity that are analyzed regarding theoretical properties like monotonicity or concavity and solved with the proposed row generation algorithm to compute core elements; i.e. determining stable and fair cost allocations.

GÉNERO
Negocios y finanzas personales
PUBLICADO
2010
18 de agosto
IDIOMA
EN
Inglés
EXTENSIÓN
181
Páginas
EDITORIAL
Springer Berlin Heidelberg
VENTAS
Springer Nature B.V.
TAMAÑO
2.6
MB

Otros libros de esta serie

Progress in Artificial Economics Progress in Artificial Economics
2010
Pricing and Risk Management of Synthetic CDOs Pricing and Risk Management of Synthetic CDOs
2011
Random-Like Multiple Objective Decision Making Random-Like Multiple Objective Decision Making
2011
New State of MCDM in the 21st Century New State of MCDM in the 21st Century
2011
Cooperation and Efficiency in Markets Cooperation and Efficiency in Markets
2011
Supply Chain Coordination in Case of Asymmetric Information Supply Chain Coordination in Case of Asymmetric Information
2011