Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
27 views2 pages

Integer Prog Formul Sol

Uploaded by

sayantini123bak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views2 pages

Integer Prog Formul Sol

Uploaded by

sayantini123bak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Integer Programming Formulation

Solutions
1. Maximize Z= 300x1 + 90x2 +400x3 + 150x4
Subject to:
35,000x1 +10,000x2 +25,000x3 + 90,000x4  120,000
4x1 + 2x2 +7x3 +3x4  12 acres
x1 + x2  1 facility
xi = 0, 1 (i=1,2,3,4)

2. Maximize Z= 20,000x1 + 28,000x2 +18,500x3 + 27,500x4+ 31,000x5


Subject to:
12,000x1 + 14,000x2 +7,000x3 + 13,000x4+ 16,000x5  48,000
x1 + x2 +x3 + x4+ x5  3
x3  x2 (should invest in investment II if it invests in investment III)
x4+ x5  1
xi = 0, 1 (i=1,2,3,4,5)

variation 1: x3=x2 should invest in investment II only if it invests in investment III


variation 2: x2  x3 can invest in II only if it invests in investment III

3. Define decision variables as

x1 = number of units produced at Baytown plant


x2 = number of units produced at Lake Charles plant
x3 = number of units produced at Mobile plant
y1 = 1 if factory is built in Baytown; 0 otherwise
y2 = 1 if factory is built in Lake Charles; 0 otherwise
y3 = 1 if factory is built in Mobile; 0 otherwise

Minimize Z= 340,000y1 + 270,000y2 +290,000y3 + 32x1+ 33x2 + 30x3

Subject to:
x1+ x2 + x3 ≥ 38,000
x1  21,000y1
x2  20,000y2
x3  19,000y3
yi = 0 or 1 (for i=1,2,3)
xi  0 and integer (for i=1,2,3).
4. Define decision variables as

y1 = 1 if plant is constructed in Detroit; 0 otherwise


y2 = 1 if plant is constructed in Toledo; 0 otherwise
y3 = 1 if plant is constructed in Denver; 0 otherwise
y4 = 1 if plant is constructed in Kansas City; 0 otherwise
xij = the units shipped in thousands from plant i to distribution center j
i= 1,2,3,4,5 and j = 1,2,3

Minimize cost= 5x11 + 2x12 +3x13 + 4x21+ 3x22 + 4x23 + 9x31 + 7x32 +5x33 + 10x41+ 4x42 + 2x43
+ 8x51 + 4x52 +3x53 + 175000 y1 + 300000 y2 + 375000y3 + 500000y4

Subject to:
x11 +x12 +x13  10000y1 Detroit capacity
x21 +x22 +x23  20000y2
x31 +x32 +x33  30000y3
x41 +x42 +x43  40000y4
x51 +x52 +x53  30000

x11 + x21 + x31 + x41 + x51 = 30000 Boston Demand


x12+ x22 + x32 + x42 + x52 = 20000
x13 + x23 + x33 + x43 + x53 = 20000
yi = 0 or 1 (for i=1,2,3,4), xij  0 and integer for all i and j.

Boston Atlanta Houston Capacity (‘000)


Detroit x11 (5) x12 (2) x13 (3) 10
Toledo x21 (4) x22 (3) x23 (4) 20
Denver x31 (9) x32 (7) x33 (5) 30
Kansas x41 (10) x42 (4) x43 (2) 40
St. Louis x51 (8) x52 (4) x53 (3) 30
Demand (‘000) 30 20 20

You might also like