***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 University

Ken Klassen, California State University, Northridge
Keith Willoughby and Ken Klassen, 2003
 ***Before starting, ensure that C6:N37 contains zeros***

Costs Costs
Group May Jun Jul A S O N D Jan
1 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0 0
4 0 0 0 0 0 0 0 0 0
5 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0
7 0 0 0 0 0 0 0 0 0
8 0 0 0 0 0 0 0 0 0
9 0 0 0 0 0 0 0 0 0
10 0 0 0 0 0 0 0 0 0

Demand 0 0

Ending Inventory
1 0 0
2 0 0
3 0 0
4 0 0
5 0 0
6 0 0
7 0 0
8 0 0
9 0 0
10 0 0

a State University, Northridge

***Before starting, ensure that C6:N37 contains zeros***

Group F M A May J
1 0 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 0
4 0 0 0 0 0
5 0 0 0 0 0
6 0 0 0 0 0
7 0 0 0 0 0
8 0 0 0 0 0
9 0 0 0 0 0
10 0 0 0 0 0

Demand

Ending Inventory
1
2
3
4
5
6
7
8
9
10
 Game A

Optimal order
Demand Quantity*
July 29 69
August 40
September 55 55
October 99 131
November 32
December 79 79
January 93 133
February 40
March 36 53
April 17
May 28 46
June 18

Total 566 566

Max Profit $ 5,093

* optimal solution using the Wagner-Whitin dynamic programming method

 Game B

Optimal order
Demand Quantity
July 26 26
August 56 89
September 33
October 84 133
November 49
December 79 122
January 43
February 55 112
March 35
April 22
May 27 50
June 23

Total 532 532

Max Profit $ 4,733

* optimal solution using the Wagner-Whitin dynamic programming method

 Game C

Optimal order
Demand Quantity
July 30 30
August 49 94
September 45
October 73 112
November 39
December 82 82
January 63 63
February 68 115
March 27
April 20
May 26 48
June 22

Total 544 544

Max Profit $ 4,847

* optimal solution using the Wagner-Whitin dynamic programming method