1.

{
Let X i = 1, project iis selected
0, otherwise
i=1,2,3,45

Maximize Z =0.2 X 1+ 0.3 X 2 +0.5 X 3 +0.1 X 4 subject 0.5 X 1 + X 2 +1.5 X 3 +0.1 X 4 3.1

0.3 X 1 +0.8 X 2 +1.5 X 3 +0.4 X 4 2.5 0.2 X 1 +0.2 X 2 +0.3 X 3 +0.1 X 4 0.4

X i 01 ,i=1,2,3,4

Solution (QM)

2.
 {
Let X i = 1, if fire station is built on town i
0, otherwise
i=1,2,3,4,5

Maximize Z =X 1 + X 2 + X 3 + X 4 + X 5+ X 6 subject X 1 + X 2 1 X1+ X2+ X6 1

X 3 + X 4 1 X 3 + X 4 + X 5 1 X4+ X5+ X6 1 X2+ X5+ X6 1

X i=01, i=1,2,3,4,5,6

Solution (QM)

3.
 Let X 1=number of gold medallion produce X 2=number of silver medallion produce

X 3=number of bronze medallion produce

{
Let Y i= 1,if batchiis selected
0, otherwise
i=1,2,3

Maximize Z =50 X 1+ 30 X 2+ 20 X 3500 Y 1400Y 2300 Y 3 subject

2 X 1+4 X 2+ 5 X 3 100 X 1 + X 2 + X 3 30 10 X 1 +5 X 2 +2 X 3 204 X1 M Y 1

X2 M Y 2 X3 M Y 3 X i 0,integer

Y i=1,0 i=1,2,3

Solution (QM)

4.
Let X 1=daily number of units of product i {
Y = 0, if location 1is selected
1, if location 2is selected

Maximize Z =25 X 1 +30 X 2 +22 X 3 subject

3 X 1 +4 X 2 +5 X 3 100+ MY 4 X 1+ 3 X 2 +6 X 3 100+ MY

3 X 1 +4 X 2 +5 X 3 90+ M (1Y ) 4 X 1+ 3 X 2 +6 X 3 100+ M (1Y )

X i 0,integer

Y =1,0 i=1,2,3