Scribd
Upload
60 views2 pages

Solution 220 Lec07

1. The document describes two linear programming problems: - The first aims to maximize advertising exposure quality across different media subject to budget and capacity constraints. The decision variables are the number of ads in different media and the objective is a weighted sum of ads. - The second aims to minimize total production and inventory costs over six months. The decision variables are units produced and inventory held each month, and the objective is to minimize costs weighted by unit production and holding costs. Both problems have constraints on minimum/maximum production, inventory, and demand fulfillment.

Uploaded by

api-26315128
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
60 views2 pages

Solution 220 Lec07

1. The document describes two linear programming problems: - The first aims to maximize advertising exposure quality across different media subject to budget and capacity constraints. The decision variables are the number of ads in different media and the objective is a weighted sum of ads. - The second aims to minimize total production and inventory costs over six months. The decision variables are units produced and inventory held each month, and the objective is to minimize costs weighted by unit production and holding costs. Both problems have constraints on minimum/maximum production, inventory, and demand fulfillment.

Uploaded by

api-26315128
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Media Selection:
Decision variables
DTV: # of ads on day time TV;
ETV: # of ads on eve TV;
DNP: # of ads on Daily Newspaper;
SNP: # of ads on Sunday Newspaper;
RN: # of ads on radio news.
Objective function
Max exposure quality: 65DTV+90ETV+40DNP+60SNP+20RN
Constraints
Total budget: 1500DTV+3000ETV+400DNP+1000SNP+100RN < 30,000
TV ads: DTV + ETV > 10
Customer: 1000DTV+2000ETV+1500DNP+2500SNP+300RN > 50,000
TV budget: 1500DTV+3000ETV < 18,000
DTV max: DTV < 15
ETV max: ETV < 10
DNP max: DNP < 25
SNP max: SNP <4
RN max: RN < 30
Nonnegativity: DTV, ETV, DNP, SNP, RN > 0

2. Production and inventory planning:


Decision variables
Pi: # of DVDs produced in month i, i=1, 2, …, 6
Ii: # of DVDs held in inventory at the end of month i, i=1, 2, …, 6
Objective function
Min cost = production cost + inventory holding cost
=
I I
460 P1  470 P2  480 P3  500 P4  500 P5  490 P6  8g( 0 6  I1  I 2  I 3  I 4  I 5 )
2
Constraints
Production min month 1: P1  3500
Production min month 2: P2  2500
Production min month 3: P3  2000
Production min month 4: P4  4000
Production min month 5: P5  3000
Production min month 6: P6  1500
Production max month 1: P1  7000
Production max month 2: P2  5000
Production max month 3: P3  4000
Production max month 4: P4  8000
Production max month 5: P5  6000
Production max month 6: P6  3000
Inventory min month 1: I1  2500
Inventory min month 2: I 2  2500
Inventory min month 3: I 3  2500
Inventory min month 4: I 4  2500
Inventory min month 5: I 5  2500
Inventory min month 6: I 6  2500
Inventory max month 1: I1  7000
Inventory max month 2: I 2  7000
Inventory max month 3: I 3  7000
Inventory max month 4: I 4  7000
Inventory max month 5: I 5  7000
Inventory max month 6: I 6  7000
Flow month 1:
I 0  P1  D1  I1  P1  I1 ( D1  I 0 )  1000  3500
Flow month 2: I1  P2  D2  I 2  I1  P2  I 2 ( D2 )  4000
Flow month 3: I 2  P3  D3  I 3  I 2  P3  I 3 ( D3 )  6000
Flow month 4: I 3  P4  D4  I 4  I 3  P4  I 4 ( D4 )  5000
Flow month 5: I 4  P5  D5  I 5  I 4  P5  I 5 ( D5 )  3000
Flow month 6: I 5  P6  D6  I 6  I 5  P6  I 6 (  D6 )  2000
Nonegativity:
I i , Pi  0(However, this nonnegative requirement is redundant here).

You might also like