InvGame

6
***Before starting, ensure that C6:N37 contains zeros*** Sale Cost O H S 30 -20 -60 -1 -7 Total Profit Group Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr $ - 1 0 0 0 0 0 0 0 0 0 0 $ - 2 0 0 0 0 0 0 0 0 0 0 $ - 3 0 0 0 0 0 0 0 0 0 0 $ - 4 0 0 0 0 0 0 0 0 0 0 $ - 5 0 0 0 0 0 0 0 0 0 0 $ - 6 0 0 0 0 0 0 0 0 0 0 $ - 7 0 0 0 0 0 0 0 0 0 0 $ - 8 0 0 0 0 0 0 0 0 0 0 $ - 9 0 0 0 0 0 0 0 0 0 0 $ - 10 0 0 0 0 0 0 0 0 0 0 Demand 0 0 0 0 0 0 0 0 0 0 Ending Inventory 1 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 0 0 8 0 0 0 0 0 0 0 0 0 0 9 0 0 0 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 Designed by: Keith Willoughby, Bucknell Univer Ken Klassen, California State Uni © Keith Willoughby and Ken Klassen, 2003

description

inv

Transcript of InvGame

GameSheet***Before starting, ensure that C6:N37 contains zeros***SaleCostOHS30-20-60-1-7TotalCostsCostsProfitGroupJulAugSepOctNovDecJanFebMarAprMayJunJulASONDJanFMAMayJ0.010000000000000000000000000.020000000000000000000000000.030000000000000000000000000.040000000000000000000000000.050000000000000000000000000.060000000000000000000000000.070000000000000000000000000.080000000000000000000000000.090000000000000000000000000.010000000000000000000000000Demand000000000000Ending Inventory10000000000002000000000000300000000000040000000000005000000000000600000000000070000000000008000000000000900000000000010000000000000Designed by:Keith Willoughby, Bucknell UniversityKen Klassen, California State University, Northridge Keith Willoughby and Ken Klassen, 2003

AGame ADemandOptimal order Quantity*July2969August40September5555October99131November32December7979January93133February40March3653April17May2846June18Total566566Max Profit$5,093* optimal solution using the Wagner-Whitin dynamic programming method

BGame BDemandOptimal order QuantityJuly2626August5689September33October84133November49December79122January43February55112March35April22May2750June23Total532532Max Profit$4,733* optimal solution using the Wagner-Whitin dynamic programming method

CGame CDemandOptimal order QuantityJuly3030August4994September45October73112November39December8282January6363February68115March27April20May2648June22Total544544Max Profit$4,847* optimal solution using the Wagner-Whitin dynamic programming method