Listing 1 - 3 of 3 |
Sort by
|
Choose an application
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.
Economics/Management Science. --- Game Theory/Mathematical Methods. --- Operation Research/Decision Theory. --- Production/Logistics/Supply Chain Management. --- Economics. --- Economics, Mathematical. --- Operations research. --- Economie politique --- Mathématiques économiques --- Recherche opérationnelle --- Economics --- Economics, Mathematical --- Business logistics
Choose an application
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.
Business logistics. --- Industrial marketing. --- Business & Economics --- Economic Theory --- Economic lot size. --- Economics, Mathematical. --- Economics. --- Game theory. --- Games, Theory of --- Theory of games --- Economic theory --- Political economy --- Economics --- Mathematical economics --- Batch size determination --- Lot size determination --- Production lot size --- Size of economic lot --- Supply chain management --- Mathematics --- Production management. --- Operations research. --- Decision making. --- Economic theory. --- Econometrics. --- Operation Research/Decision Theory. --- Operations Management. --- Economic Theory/Quantitative Economics/Mathematical Methods. --- Social sciences --- Economic man --- Econometrics --- Mathematical models --- Inventory control --- Industrial management --- Logistics --- Methodology --- Operations Research/Decision Theory. --- Manufacturing management --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Economics, Mathematical --- Statistics --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Decision making
Choose an application
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.
Quantitative methods (economics) --- Economic schools --- Operational research. Game theory --- Mathematical statistics --- Planning (firm) --- Production management --- Computer. Automation --- besluitvorming --- economie --- management --- mathematische modellen --- productie --- economisch denken --- speltheorie --- econometrie --- operationeel onderzoek
Listing 1 - 3 of 3 |
Sort by
|