Abstract
This work develops a multi-objective MILP (Mixed Integer Linear Programming) model, devised to optimize the planning of supply chains using Game Theory optimization for decision making in cooperative and/or competitive scenarios. Three different optimization criteria are considered (total cost, tardiness and expenses of the buyers for the competitive problem). The multi objective problem has been solved using the Pareto frontier solutions, and both cooperative and non cooperative scenarios between supply chains are considered, so multiple optimization tools/techniques have been combined to analyze the different trade-offs associated to the resulting decision making: Game Theory, MILP based approach and Pareto frontiers. The resulting model is tested in a case study, based on the operation of two different supply chains in both competitive and cooperative situations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
